Abstract
We investigate a real-world large scale vehicle dispatching problem with strict real-time requirements, posed by our cooperation partner, the German Automobile Association. We present computational experience on real-world data with a dynamic column generation method employing a portfolio of acceleration techniques. Our computer program ZIBDIP yields solutions on heavy-load real-world instances (215 service requests, 95 service units) in less than a minute that are no worse than 1% from optimum on state-of-the-art personal computers.
Research supported by the German Science Foundation (DFG, grant GR 883/10)
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
Julien Bramel and David Simchi-Levi, On the effectiveness of set covering formulations for the vehicle routing problem with time windows, Operations Research 45 (1997), no. 2, 295–301.
Vasek Chvatal, Linear programming, Freeman, New York, 1983.
Jaques Desrosiers, Yvan Dumas, Marius M. Solomon, and François Soumis, Time constraint routing and scheduling, Network Routing (Michael Ball, Tom Magnanti, Clyde Monma, and George Newhauser, eds.), Handbooks in Operations Research and Management Science, vol. 8, Elsevier, Amsterdam, 1995, pp. 35–140.
Soumia Ichoua, Michel Gendreau, and Jean-Yves Potvin, Diversion issues in realtime vehicle dispatching, Transportation Science 34 (2000), no. 4, 426–438.
Jesper Larsen, Vehicle routing with time windows-finding optimal solutions efficiently, DORSnyt (engl.) (1999), no. 116.
Leon S. Lasdon, Optimization theory for large systems, Macmillan, New York, 1970.
Sushil J. Louis, Xiangying Yin, and Zhen Ya Yuan, Multiple vehicle routing with time windows using genetic algorithms, 1999 Congress on Evolutionary Computation (Piscataway, NJ), IEEE Service Center, 1999, pp. 1804–1808.
D.G. Luenberger, Linear and nonlinear programming, 2 ed., Addison-Wesley, 1984.
Éric Taillard, P. Badeau, Michel Gendreau, F. Guertin, and Jean-Yves Potvin, A tabu search heuristic for the vehicle routing problem with soft time windows, Transportation Science 31 (1997), 170–186.
Kenny Qili Zhu and Kar-Loon Ong, A reactive method for real time dynamic vehicle routing problem, Proceedings of the 12th ICTAI, 2000.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Krumke, S.O., Rambau, J., Torres, L.M. (2002). Real-Time Dispatching of Guided and Unguided Automobile Service Units with Soft Time Windows. In: Möhring, R., Raman, R. (eds) Algorithms — ESA 2002. ESA 2002. Lecture Notes in Computer Science, vol 2461. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45749-6_56
Download citation
DOI: https://doi.org/10.1007/3-540-45749-6_56
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44180-9
Online ISBN: 978-3-540-45749-7
eBook Packages: Springer Book Archive