Line Change Considerations Within a Time-Space Network Based Multi-Depot Bus Scheduling Model

  • Natalia Kliewer
  • Vitali Gintner
  • Leena Suhl
Part of the Lecture Notes in Economics and Mathematical Systems book series (LNE, volume 600)


The vehicle scheduling problem, arising in public transport bus companies, addresses the task of assigning buses to cover a given set of timetabled trips. It considers additional requirements, such as multiple depots for vehicles and vehicle type groups for timetabled trips as well as depot capacities. An optimal schedule is characterized by minimal fleet size and minimal operational costs including costs for unloaded trips and idle time spent outside the depot. This paper discusses the multi-depot, multi-vehicle-type bus scheduling problem for timetabled trips organized in bus lines. We use time-space-based networks for problem modeling. The cost-optimal vehicle schedule may involve several line changes for a given bus within a working day which might not be desirable from the practical point of view. Some bus companies prefer to pose a restriction for bus line changes as well. Because the network flow based model works with trips and not lines, it does not explicitly take into account line changes. In this contribution, we discuss several methods to find schedules with an acceptable number of line changes.


Public Transport Vehicle Type Line Change Vehicle Schedule Minimal Alternation 
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. Bertossi, A., Carraresi, P., and Gallo, G. (1987). On some matching problems arising in vehicle scheduling models. Networks, 17, 271–281.CrossRefGoogle Scholar
  2. Daduna, J. R. and Paixão, J. M. P. (1995). Vehicle scheduling for public mass transit — an overview. In J. R. Daduna, I. Branco and J.M.P. Paixão, editors, Computer-Aided Transit Scheduling, Lecture Notes in Economics and Mathematical Systems 430, pages 76–90. Springer, Berlin.Google Scholar
  3. Forbes, M., Hotts, J., and Watts, A. (1994). An exact algorithm for multiple depot vehicle scheduling. European Journal of Operational Research, 72, 115–124.CrossRefGoogle Scholar
  4. Hane, C., Barnhart, C., Johnson, E., Marsten, R., Nemhauser, G., and Sigismondi, G. (1995). The fleet assignment problem: Solving a large integer program. Mathematical Programming, 70(2), 211–232.Google Scholar
  5. ILOG (2003). Cplex v8.0 User’s Manual. ILOG, Gentilly, France.Google Scholar
  6. Kliewer, N., Mellouli, T., and Suhl, L. (2002). A new solution model for multidepot multi-vehicle-type vehicle scheduling in (sub)urban public transport. In Proceedings of the 13th Mini-EURO Conference and the 9th meeting of the EURO working group on transportation, Politechnic of Bari.Google Scholar
  7. Kliewer, N., Mellouli, T., and Suhl, L. (2006). A time-space network based exact optimization model for multi-depot bus scheduling. European Journal of Operational Research, 175, 1616–1627.CrossRefGoogle Scholar
  8. Löbel, A. (1999). Solving large-scale multiple-depot vehicle scheduling problems. In N. Wilson, editor, Computer-Aided Transit Scheduling, pages 193–220. Springer, Berlin.Google Scholar
  9. Ribeiro, C. and Soumis, F. (1994). A column generation approach to the multiple-depot vehicle scheduling problem. Operations Research, 42, 41–52.CrossRefGoogle Scholar
  10. Suhl, U. (2000). Mops — mathematical optimization system. OR News, 8, 11–16.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Natalia Kliewer
    • 1
  • Vitali Gintner
    • 2
  • Leena Suhl
    • 1
  1. 1.Decision Support & Operations Research LabUniversity of PaderbornPaderbornGermany
  2. 2.Decision Support & Operations Research Lab and International Graduate School for Dynamic Intelligent SystemsUniversity of PaderbornPaderbornGermany

Personalised recommendations