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

• Type: Journal
• Year: 2002
• Where: SAC
• Authors: Haibing Li, Andrew Lim
• Keywords: Applied Computing, Extensive Comparisons, SAC 2002, Time Windows, Vehicle