Please use this identifier to cite or link to this item:
|Title:||Local search with annealing-like restarts to solve the VRPTW||Authors:||Li, H.
Vehicle routing problem with time windows
|Issue Date:||2003||Citation:||Li, H., Lim, A. (2003). Local search with annealing-like restarts to solve the VRPTW. European Journal of Operational Research 150 (1) : 115-127. ScholarBank@NUS Repository. https://doi.org/10.1016/S0377-2217(02)00486-1||Abstract:||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. © 2002 Elsevier Science B.V. All rights reserved.||Source Title:||European Journal of Operational Research||URI:||http://scholarbank.nus.edu.sg/handle/10635/41543||ISSN:||03772217||DOI:||10.1016/S0377-2217(02)00486-1|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Apr 10, 2021
WEB OF SCIENCETM
checked on Apr 2, 2021
checked on Apr 14, 2021
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.