Research on Logistics Distribution Enterprise Vehicle Routing Problem Based on the Simulated Annealing

The optimization of the vehicle routing problem (VRP) is the focus of the logistics distribution enterprise. According to the complexity and dynamic nature of the traffic network, a logistics distribution enterprise vehicle routing problem model is built. Aiming at solving the model optimal solution problem that need search the optimal solution or quasi-optimal solution in a complex and huge space and search process will lead to combination explosion if algorithm traverses the whole search space, a simulated annealing algorithm is applied. The algorithm optimizes the number of vehicles and transporting routes, so as to achieve the goal of shortest distance, fewer vehicles and less cost. At the same time, an example is taken to prove the usability and global optimality of the simulated annealing algorithm in the logistics distribution enterprise vehicle routing problem.

Language

  • English

Media Info

  • Media Type: Web
  • Features: References;
  • Pagination: pp 3521-3527
  • Monograph Title: ICLEM 2010: Logistics For Sustained Economic Development: Infrastructure, Information, Integration

Subject/Index Terms

Filing Info

  • Accession Number: 01525632
  • Record Type: Publication
  • ISBN: 9780784411391
  • Files: TRIS, ASCE
  • Created Date: Nov 12 2013 1:53PM