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 kind of problem very close to reality in the optimization of logistics system. In this paper, the complementary restraint relationship between depot selection, transports, pickups and deliveries is analyzed, the mathematical model with the lowest total cost in 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 paper designs the taboo-simulated annealing combinatorial optimization algorithm to require 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-simulated annealing combinatorial optimization algorithm proposed in this paper proves to be a rapid and effective approach in solving MDLRPPD.

Language

  • English

Media Info

  • Media Type: Web
  • Pagination: pp 1-7
  • Monograph Title: ICCTP 2009: Critical Issues In Transportation Systems Planning, Development, and Management

Subject/Index Terms

Filing Info

  • Accession Number: 01921908
  • Record Type: Publication
  • ISBN: 9780784410646
  • Files: TRIS, ASCE
  • Created Date: Jun 17 2024 2:45PM