Please use this identifier to cite or link to this item: https://doi.org/10.1016/S0377-2217(02)00363-6
DC FieldValue
dc.titleVehicle routing problem with time windows and a limited number of vehicles
dc.contributor.authorLau, H.C.
dc.contributor.authorSim, M.
dc.contributor.authorTeo, K.M.
dc.date.accessioned2013-07-04T07:29:27Z
dc.date.available2013-07-04T07:29:27Z
dc.date.issued2003
dc.identifier.citationLau, H.C., Sim, M., Teo, K.M. (2003). Vehicle routing problem with time windows and a limited number of vehicles. European Journal of Operational Research 148 (3) : 559-569. ScholarBank@NUS Repository. https://doi.org/10.1016/S0377-2217(02)00363-6
dc.identifier.issn03772217
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/38901
dc.description.abstractThis paper introduces a variant of the vehicle routing problem with time windows where a limited number of vehicles is given (m-VRPTW). Under this scenario, a feasible solution is one that may contain either unserved customers and/or relaxed time windows. We provide a computable upper bound to the problem. To solve the problem, we propose a tabu search approach characterized by a holding list and a mechanism to force dense packing within a route. We also allow time windows to be relaxed by introducing the notion of penalty for lateness. In our approach, customer jobs are inserted based on a hierarchical objective function that captures multiple objectives. Computational results on benchmark problems show that our approach yields solutions that are competitive to best-published results on VRPTW. On m-VRPTW instances, experiments show that our approach produces solutions that are very close to computed upper bounds. Moreover, as the number of vehicles decreases, the routes become more densely packed monotically. This shows that our approach is good from both the optimality as well as stability point of view. © 2002 Elsevier Science B.V. All rights reserved.
dc.description.urihttp://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1016/S0377-2217(02)00363-6
dc.sourceScopus
dc.subjectCombinatorial optimization
dc.subjectHeuristics
dc.subjectRouting
dc.subjectTabu search
dc.subjectVehicle routing problem with time windows
dc.typeArticle
dc.contributor.departmentCOMPUTER SCIENCE
dc.description.doi10.1016/S0377-2217(02)00363-6
dc.description.sourcetitleEuropean Journal of Operational Research
dc.description.volume148
dc.description.issue3
dc.description.page559-569
dc.description.codenEJORD
dc.identifier.isiut000182791900008
Appears in Collections:Staff Publications

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

SCOPUSTM   
Citations

186
checked on Jan 20, 2023

WEB OF SCIENCETM
Citations

141
checked on Jan 20, 2023

Page view(s)

246
checked on Jan 26, 2023

Google ScholarTM

Check

Altmetric


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