Abstract
This paper addresses a new variant of the vehicle routing problem with time windows that takes drivers’ working periods into consideration. In this problem, each vehicle is dispatched to perform one route in a multi-period planning horizon. At the end of each period, each vehicle is not required to return to the depot but must stay at one of vertices for recuperation. We propose a tabu search algorithm to solve 48 test instances generated from Solomon’s VRPTW instances. The computational results can serve as benchmarks for future researchers on the problem.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Lau, H.C., Sim, M., Teo, K.M.: Vehicle routing problem with time windows and a limited number of vehicles. European Journal of Operational Research 148(3), 559–569 (2003)
Vansteenwegen, P., Souffriau, W., Vanden Berghe, G., Van Oudheusden, D.: Iterated local search for the team orienteering problem with time windows. Computers & Operations Research 36(12), 3281–3290 (2009)
Vansteenwegen, P., Souffriau, W., Van Oudheusden, D.: The orienteering problem: A survey. European Journal of Operational Research 209(1), 1–10 (2011)
Savelsbergh, M., Sol, M.: Drive: Dynamic routing of independent vehicles. Operations Research 46(4), 474–490 (1998)
Xu, H., Chen, Z.L., Rajagopal, S., Arunapuram, S.: Solving a practical pickup and delivery problem. Transportation Science 37(3), 347–364 (2003)
Goel, A.: Vehicle scheduling and routing with drivers’ working hours. Transportation Science 43(1), 17–26 (2009)
Goel, A.: Truck driver scheduling in the European union. Transportation Science 44(4), 429–441 (2010)
Kok, A.L., Meyer, C.M., Kopfer, H., Schutten, J.M.J.: A dynamic programming heuristic for the vehicle routing problem with time windows and European community social legislation. Transportation Science 44(4), 442–454 (2010)
Cordeau, J.F., Gendreau, M., Laporte, G.: A tabu search heuristic for periodic and multi-depot vehicle routing problems. Networks 30(2), 105–119 (1997)
Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network flows: Theory, algorithms, and applications. Prentice Hall, Englewood Cliffs (1993)
Glover, F., Laguna, M.: Tabu Search. Kluwer Academic Publishers, Norwell (1997)
Bräysy, O., Gendreau, M.: Vehicle routing problem with time windows, part I: Route construction and local search algorithms. Transportation Science 39(1), 104–118 (2005)
Solomon, M.M.: Algorithms for the vehicle routing and scheduling problems with time window constraints. Operations Research 35(2), 254–265 (1987)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Xie, Y., Zhang, Z., Qin, H., Guo, S., Lim, A. (2014). The Multi-period Profit Collection Vehicle Routing Problem with Time Windows. In: Ali, M., Pan, JS., Chen, SM., Horng, MF. (eds) Modern Advances in Applied Intelligence. IEA/AIE 2014. Lecture Notes in Computer Science(), vol 8482. Springer, Cham. https://doi.org/10.1007/978-3-319-07467-2_49
Download citation
DOI: https://doi.org/10.1007/978-3-319-07467-2_49
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-07466-5
Online ISBN: 978-3-319-07467-2
eBook Packages: Computer ScienceComputer Science (R0)