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.
Research on Logistics Distribution Enterprise Vehicle Routing Problem Based on the Simulated Annealing
International Conference of Logistics Engineering and Management (ICLEM) 2010 ; 2010 ; Chengdu, China
ICLEM 2010 ; 3521-3527
2010-09-09
Conference paper
Electronic Resource
English
A Simulated Annealing Heuristic for the Green Vehicle Routing Problem
Springer Verlag | 2013
|Multi-UAV Logistics Planning Problem Based on Improved Genetic Simulated Annealing Algorithm
Springer Verlag | 2023
|Reverse Logistics Network Problem using simulated annealing with and without Priority-algorithm
DOAJ | 2018
|Research on multi-objective emergency logistics vehicle routing problem under constraint conditions
BASE | 2013
|