Abstract
In this paper we investigate a vehicle routing problem motivated by a real-world application in cooperation with the German Automobile Association (ADAC). The general task is to assign service requests to service units and to plan tours for the units such as to minimize the overall cost. The characteristics of this large-scale problem due to the data volume involve strict real-time requirements. We show that the problem of finding a feasible dispatch for service units starting at their current position and serving at most k requests is NP-complete for each fixed k ≥ 2. We also present a polynomial time (2k − 1)-approximation algorithm, where again k denotes the maximal number of requests served by a single service unit. For the boundary case when k equals the total number |E| of requests (and thus there are no limitations on the tour length), we provide a \({\left(2-\frac{1}{|E|} \right)}\)-approximation. Finally, we extend our approximation results to include linear and quadratic lateness costs.
Similar content being viewed by others
References
Ahuja RK, Magnanti TL, Orlin JB (1993) Networks flows. Prentice Hall, Englewood Cliffs
Bertossi AA, Carraresi P, Gallo G (1987) On some matching problems arising in vehicle scheduling models. Networks 17(3): 271–281
Dischke I (2004) Disposition von Einsatzfahrzeugen: Startheuristiken, Branching-Regeln und Rundungstechniken. Diplomarbeit, TU Berlin
Garey MR, Johnson DS (1979) Computers and intractability (A guide to the theory of NP-completeness). W.H. Freeman and Company, New York
Haimovich M, Rinnooy Kan AHG (1985) Bounds and heuristics for capacitated routing problems. Math Oper Res 10: 527–542
Hiller B, Krumke SO, Rambau J (2005) Reoptimization gaps versus model errors in online-dispatching of service units. Discrete Applied Mathematics, 2005. A preliminary version appeared in the Proceedings of the Latin-American Conference on Combinatorics, Graphs and Algorithms, 2004
Krumke SO, Noltemeier H (2005a) Graphentheorische Konzepte und Algorithmen. B.G. Teubner
Krumke SO, Rambau J, Torres LM (2002a) Online dispatching of automobile in real-time. ZIB Report 02-18, Konrad-Zuse-Zentrum für Informationstechnik Berlin
Krumke SO, Rambau J, Torres LM (2002b) Real-time dispatching of guided and unguided automobile service units with soft time windows. In: Proceedings of the 10th Annual European Symposium on Algorithms. Lecture Notes in Computer Science, vol 2461. Springer, Heidelberg
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Krumke, S.O., Saliba, S., Vredeveld, T. et al. Approximation algorithms for a vehicle routing problem. Math Meth Oper Res 68, 333–359 (2008). https://doi.org/10.1007/s00186-008-0224-y
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00186-008-0224-y