Real-Time Dispatching of Guided and Unguided Automobile Service Units with Soft Time Windows

  • Sven O. Krumke
  • Jörg Rambau
  • Luis M. Torres
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2461)


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.


Column Generation Home Position Acceptance Threshold Column Generation Algorithm Sorting Criterion 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    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.zbMATHMathSciNetGoogle Scholar
  2. [2]
    Vasek Chvatal, Linear programming, Freeman, New York, 1983.zbMATHGoogle Scholar
  3. [3]
    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.Google Scholar
  4. [4]
    Soumia Ichoua, Michel Gendreau, and Jean-Yves Potvin, Diversion issues in realtime vehicle dispatching, Transportation Science 34 (2000), no. 4, 426–438.zbMATHCrossRefGoogle Scholar
  5. [5]
    Jesper Larsen, Vehicle routing with time windows-finding optimal solutions efficiently, DORSnyt (engl.) (1999), no. 116.Google Scholar
  6. [6]
    Leon S. Lasdon, Optimization theory for large systems, Macmillan, New York, 1970.zbMATHGoogle Scholar
  7. [7]
    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.Google Scholar
  8. [8]
    D.G. Luenberger, Linear and nonlinear programming, 2 ed., Addison-Wesley, 1984.Google Scholar
  9. [9]
    É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.zbMATHCrossRefGoogle Scholar
  10. [10]
    Kenny Qili Zhu and Kar-Loon Ong, A reactive method for real time dynamic vehicle routing problem, Proceedings of the 12th ICTAI, 2000.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Sven O. Krumke
    • 1
  • Jörg Rambau
    • 1
  • Luis M. Torres
    • 1
  1. 1.Department OptimizationKonrad-Zuse-Zentrum für Informationstechnik BerlinBerlin-DahlemGermany

Personalised recommendations