Abstract
The Cumulative Capacitated Vehicle Routing Problem (or CCVRP) models transportation problems where the objective is to minimize the sum of arrival times at customers, taking into account capacity limitations. It generalizes the traveling repairman problem (or TRP), by adding capacity constraints and an homogeneous vehicle fleet. This paper presents the first metaheuristic designed for the CCVRP, taking into account specific properties to improve its speed and efficiency. The algorithm obtained also becomes the best metaheuristic for the TRP.
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.
References
Archer, A., Levin, A., Williamson, D.P.: A faster, better approximation algorithm for the minimum latency problem. SIAM Journal on Computing 5(37), 1473–1498 (2008)
Arkin, E.M., Hassin, R., Levin, A.: Approximations for minimum and min-max vehicle routing problems. J. Algorithms 59(1), 1–18 (2006)
Blum, A., Chalasani, P., Coppersmith, D., Pulleyblank, B., Raghavan, P., Sudan, M.: The minimum latency problem. In: Proceedings of the twenty-sixth annual ACM Symposium on Theory of Computing (STOC 1994), pp. 163–171 (1994)
Campbell, A.M., Vandenbussche, D., Hermann, W.: Routing for relief efforts. Transportation Science 42(2), 127–145 (2008)
Christofides, N., Mingozzi, A., Toth, P.: The vehicle routing problem. In: Christofides, N., Mingozzi, A., Toth, P., Sandi, L. (eds.) Combinatorial Optimization, pp. 315–338. Wiley, Wichester (1979)
Hsueh, C.-H., Chen, H.-K., Chou, H.-W.: Dynamic vehicle routing for relief logistics in natural disasters. In: Caric, T., Gold, H. (eds.) Vehicle Routing Problem, vol. 1, pp. 71–84. IN-TECH, Croatia (2008)
Kallehauge, B., Larsen, J., Madsen, O.B.G.: Lagrangean duality applied to the vehicle routing problem with time windows. Computers and Operations Research 33, 1464–1487 (2006)
Kara, I., Yetis, B.K., Yetis, K.: Energy minimizing vehicle routing problem. In: Dress, A.W.M., Xu, Y., Zhu, B. (eds.) COCOA 2007. LNCS, vol. 4616, pp. 62–71. Springer, Heidelberg (2007)
Prins, C.: A simple and effective evolutionary algorithm for the vehicle routing problem. Computers and Operations Research 31, 1985–2002 (2004)
Reinelt, G.: (1995), http://www.iwr.uni-heidelberg.de/groups/comopt/software/TSPLIB95/
Sahni, S., Gonzalez, T.: P-complete problems and approximate solutions. In: 15th Annual Symposium on Switching and Automata Theory, pp. 28–32. IEEE, Los Alamitos (1974)
Salehipour, A., Sörensen, K., Goos, P., Bräysy, O.: An efficient GRASP+VND metaheuristic for the traveling repairman problem. Working paper, University of Antwerp, Faculty of Applied Economics (May 2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ngueveu, S.U., Prins, C., Wolfler-Calvo, R. (2009). An Effective Evolutionary Algorithm for the Cumulative Capacitated Vehicle Routing Problem. In: Giacobini, M., et al. Applications of Evolutionary Computing. EvoWorkshops 2009. Lecture Notes in Computer Science, vol 5484. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-01129-0_88
Download citation
DOI: https://doi.org/10.1007/978-3-642-01129-0_88
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-01128-3
Online ISBN: 978-3-642-01129-0
eBook Packages: Computer ScienceComputer Science (R0)