Computer Aided Scheduling of Switching Engines

  • Uwe T. Zimmermann
  • Marco E. Lübbecke


Scheduling the switching engines of an industrial railroad is a formidable and responsible task, closely related to the well-studied pickup and delivery problem with time windows. Aiming at an efficient usage of resources the need arose for a computer aided scheduling tool as support for the human dispatcher. We sketch a set partitioning formulation of this problem to be solved via column generation. The pricing subproblem is hard in the theoretical sense but can be solved by means of a combination of heuristics and exact algorithms. A trade-off between mathematical rigor and practicability becomes apparent and is extensively discussed. Our computational experience with an academic prototype implementation is encouraging. We succeed in obtaining practically acceptable solutions for instances of more than forty customers and six vehicles.


Column Generation Price Problem Delivery Problem Implicit Enumeration Price Subproblem 
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.
    C. Barnhart, E.L. Johnson, G.L. Nemhauser, M.W.R Savelsbergh, and P.H. Vance. Branch-and-price: Column generation for solving huge integer programs. Oper. Res., 46(3):316–329, 1998.MathSciNetzbMATHCrossRefGoogle Scholar
  2. 2.
    G. Desaulniers, J. Desrosiers, and M.M. Solomon. Accelerating strategies in column generation methods for vehicle routing and crew scheduling problems. Les Cahiers du GERAD G-99-36, École des Hautes Études Commerciales, Montréal, Canada, August 1999.Google Scholar
  3. 3.
    J. Desrosiers and Y. Dumas. The shortest path problem for the construction of vehicle routes with pick-up, delivery and time constraints. In Advances in Optimization and Control, volume 302 of Lecture Notes in Economics and Mathematical Systems, pages 144–157, 1988.Google Scholar
  4. 4.
    J. Desrosiers, Y. Dumas, and F. Soumis. A dynamic programming solution of the large-scale single-vehicle dial-a-ride problem with time windows. American Journal of Mathematical and Management Sciences, 6:301–326, 1986.zbMATHGoogle Scholar
  5. 5.
    Y. Dumas, J. Desrosiers, and F. Soumis. The pickup and delivery problem with time windows. European J. Oper. Res., 54:7–22, 1991.zbMATHCrossRefGoogle Scholar
  6. 6.
    T. Ibaraki. Enumerative Approaches to Combinatorial Optimization, volume 10 and 11 of Annals of Operations Research. Baltzer, 1987.Google Scholar
  7. 7.
    E.L. Johnson. Modelling and strong linear programs for mixed integer programming. In S.W. Wallace, editor, Algorithms and Model Formulations in Mathematical Programming, pages 1–43, Berlin, 1989. Springer-Ver lag.Google Scholar
  8. 8.
    L.S. Lasdon. Optimization Theory for Large Systems. Macmillan, London, 1970.Google Scholar
  9. 9.
    M.E. Lübbecke. Optimal Engine Scheduling by Column Generation. PhD thesis, Dept. Mathematical Opimization, Braunschweig University of Technology, 2000. In preparation.Google Scholar
  10. 10.
    M.E. Lübbecke and U.T. Zimmermann. Optimal engine routing and scheduling at industrial in-plant railroads. Technical report, Dept. Mathematical Opimization, Braunschweig University of Technology, 2000. In preparation.Google Scholar
  11. 11.
    J.L. Nazareth. Computer Solution of Linear Programs. Oxford University Press, Oxford, 1987.Google Scholar
  12. 12.
    M. Sol. Column Generation Techniques for Pickup and Delivery Problems. PhD thesis, Eindhoven University of Technology, 1994.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Uwe T. Zimmermann
    • 1
  • Marco E. Lübbecke
    • 1
  1. 1.Department of Mathematical OptimizationBraunschweig University of TechnologyBraunschweigGermany

Personalised recommendations