Research on Taboo Simulated Annealing Combinatorial Optimization Algorithm of Location Routing Problem with Pickups and Deliveries

MDLRPPD (Multi-depot Location Routing Problem with Pickups and Deliveries)to be studied in this paper is a kin d of problem very close to reality in the optimization of logistics system. In this paper , the complementary restraint relationship between depot selection, transports, p ickups and deliveries is analyzed, the mathematical model with the lowest total cost i n the logistics system is established, and the verification of correctness of mathematical model established through the application of LINGO software under the condition of small-scale data is conducted. Because of its NP-hard property, the pap er designs the taboo-simulated annealing combinatorial optimization algorithm to r equire a solution, and applies C++ language programming to realize this combinatorial optimization algorithm. Through the comparison with optimum solution obtained from the application of LINGO software, the results show that the taboo-sim ulated annealing combinatorial optimization algorithm proposed in this paper prove s to be a rapid and effective approach in solving MDLRPPD.