| Article ID: | iaor19981688 |
| Country: | Netherlands |
| Volume: | 86 |
| Issue: | 3 |
| Start Page Number: | 480 |
| End Page Number: | 490 |
| Publication Date: | Nov 1995 |
| Journal: | European Journal of Operational Research |
| Authors: | Breedam Alex Van |
| Keywords: | programming: travelling salesman, optimization: simulated annealing, programming: nonlinear |
This paper reports on the use of simulated annealing-based improvement methods for the Vehicle Routing Problem. The improvement methods considered are aimed at relocating and/or exchanging stops or strings of stops between different routes, starting from an initial feasible solution. The simulated annealing-based improvement methods are compared against their descent alternatives as well as other metaheuristics implementations on a set of classical test problems. The results are reported.