Article ID: | iaor20023247 |
Country: | Netherlands |
Volume: | 7 |
Issue: | 2 |
Start Page Number: | 107 |
End Page Number: | 129 |
Publication Date: | Mar 2001 |
Journal: | Journal of Heuristics |
Authors: | Calvo Roberto Wolfler, Cordone Roberto |
Keywords: | heuristics |
In this paper we propose a heuristic algorithm to solve the Vehicle Routing Problem with Time Windows. Its framework is a smart combination of three simple procedures: the classical k-opt exchanges improve the solution, an ad hoc procedure reduces the number of vehicles and a second objective function drives the search out of local optima. No parameter tuning is required and no random choice is made: these are the distinguishing features with respect to the recent literature. The algorithm has been tested on benchmark problems which prove it to be more effective than comparable algorithms.