Sciweavers

Share
SAC
2002
ACM

Local search with annealing-like restarts to solve the vehicle routing problem with time windows

8 years 9 months ago
Local search with annealing-like restarts to solve the vehicle routing problem with time windows
In this paper, we propose a metaheuristic based on snneedinglikerestarts to diversifyand intensifylocalsearches for solving the vehicle muting problem with time windows (VR_PTW). Using the Solomon's benchmark instances for the problem, our method obtained 7 new best results and equaled 19 other best results. Extensive comparisons indicate that our method is comparable to the best published literatures. Keywords routing, vehicle routing problem with time windows, local search, diversification, intensification
Haibing Li, Andrew Lim
Added 23 Dec 2010
Updated 23 Dec 2010
Type Journal
Year 2002
Where SAC
Authors Haibing Li, Andrew Lim
Comments (0)
books