Please use this identifier to cite or link to this item:
|Title:||Vehicle routing problem with time windows and a limited number of vehicles|
|Authors:||Lau, H.C. |
Vehicle routing problem with time windows
|Citation:||Lau, 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|
|Abstract:||This 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.|
|Source Title:||European Journal of Operational Research|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jul 14, 2018
WEB OF SCIENCETM
checked on Jul 4, 2018
checked on May 19, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.