scholarly journals Application of Simulated Annealing to Routing Problems in City Logistics

10.5772/5564 ◽  
2008 ◽  
Author(s):  
Hisafumi Kokubugata ◽  
Hironao Kawashim
Keyword(s):  
Simulated Annealing ◽  
City Logistics ◽  
Routing Problems

scholarly journals Vehicle routing problems for city logistics

2015 ◽  
Vol 6 (1) ◽  
pp. 51-79 ◽  
Author(s):  
Diego Cattaruzza ◽  
Nabil Absi ◽  
Dominique Feillet ◽  
Jesús González-Feliu
Keyword(s):  
Vehicle Routing ◽  
City Logistics ◽  
Vehicle Routing Problems ◽  
Routing Problems

Application Research of Improved Simulated Annealing Algorithm in Vehicle Routing Problems

2011 ◽  
Vol 58-60 ◽  
pp. 1031-1036
Author(s):  
Dong Mei Yan ◽  
Cheng Hua Lu
Keyword(s):  
Simulated Annealing ◽  
Vehicle Routing ◽  
Simulated Annealing Algorithm ◽  
Memory Function ◽  
Optimal Solution ◽  
Vehicle Routing Problems ◽  
Application Research ◽  
Routing Problems ◽  
Annealing Algorithm ◽  
Optimization Efficiency

This paper analyzed the principle and insufficient of traditional simulated annealing algorithm, and on the basis of the traditional simulated annealing algorithm, this paper used improved simulated annealing algorithm to solve vehicle routing problems. The new algorithm increases memory function, and keeps the current best state to avoid losing current optimal solution while reducing the computation times and accelerating the algorithm speed. The experimental results show that, the algorithm can significantly improve the optimization efficiency, and has faster convergence speed than traditional simulated annealing algorithm.

AN ASSIGNMENT-BASED LOCAL SEARCH METHOD FOR SOLVING VEHICLE ROUTING PROBLEMS

2005 ◽  
Vol 22 (01) ◽  
pp. 85-104 ◽  
Author(s):  
L. ZENG ◽  
H. L. ONG ◽  
K. M. NG
Keyword(s):  
Simulated Annealing ◽  
Local Search ◽  
Vehicle Routing ◽  
Search Method ◽  
Benchmark Problems ◽  
Heuristic Methods ◽  
Vehicle Routing Problems ◽  
Local Search Method ◽  
Routing Problems ◽  
Improvement Algorithm

In this paper, we propose an assignment-based local search method for solving vehicle routing problems. This method is a multi-route improvement algorithm that can operate on several routes at a time. To evaluate the performance of the proposed method, extensive computational experiments on the proposed method applied to a set of benchmark problems are carried out. The results show that the proposed method, when coupled with metaheuristics such as simulated annealing, is comparable with other efficient heuristic methods proposed in the literature.

Sign in / Sign up

Export Citation Format

Share Document