Please use this identifier to cite or link to this item:
https://scholarbank.nus.edu.sg/handle/10635/41093
| Title: | Local search with annealing-like restarts to solve the vehicle routing problem with time windows | Authors: | Li, H. Lim, A. |
Keywords: | Diversification Intensification Local search Routing Vehicle routing problem with time windows |
Issue Date: | 2002 | Citation: | Li, H.,Lim, A. (2002). Local search with annealing-like restarts to solve the vehicle routing problem with time windows. Proceedings of the ACM Symposium on Applied Computing : 560-567. ScholarBank@NUS Repository. | 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 7 new best results and equaled 19 other best results. Extensive comparisons indicate that our method is comparable to the best published literatures. | Source Title: | Proceedings of the ACM Symposium on Applied Computing | URI: | http://scholarbank.nus.edu.sg/handle/10635/41093 |
| Appears in Collections: | Staff Publications |
Show full item record
Files in This Item:
There are no files associated with this item.
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.