Please use this identifier to cite or link to this item: https://scholarbank.nus.edu.sg/handle/10635/41093
DC FieldValue
dc.titleLocal search with annealing-like restarts to solve the vehicle routing problem with time windows
dc.contributor.authorLi, H.
dc.contributor.authorLim, A.
dc.date.accessioned2013-07-04T08:19:28Z
dc.date.available2013-07-04T08:19:28Z
dc.date.issued2002
dc.identifier.citationLi, 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.
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/41093
dc.description.abstractIn 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.
dc.sourceScopus
dc.subjectDiversification
dc.subjectIntensification
dc.subjectLocal search
dc.subjectRouting
dc.subjectVehicle routing problem with time windows
dc.typeConference Paper
dc.contributor.departmentCOMPUTER SCIENCE
dc.description.sourcetitleProceedings of the ACM Symposium on Applied Computing
dc.description.page560-567
dc.identifier.isiutNOT_IN_WOS
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Page view(s)

121
checked on May 5, 2021

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.