Journal
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Volume 150, Issue 1, Pages 115-127Publisher
ELSEVIER
DOI: 10.1016/S0377-2217(02)00486-1
Keywords
routing; vehicle grouting problem with time windows; local search; diversification; intensification
Ask authors/readers for more resources
In this paper, we propose a metaheuristic based on annealing-like restarts to diversify and intensify local searches for solving the vehicle routing problem with time windows (VRPTW). Using the Solomon's benchmark instances for the problem, our method obtained seven new best results and equaled 19 other best results. Extensive comparisons indicate that our method is comparable to the best in published literature. This approach is flexible and can be extended to handle other variants of vehicle routing problems and other combinatorial optimization problems. (C) 2002 Elsevier Science B.V.. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available