Skip to main content
SpringerLink
Log in

An overview on vehicle scheduling models

  • Original Paper
  • Published:
Public Transport Aims and scope Submit manuscript

Abstract

The vehicle scheduling problem, arising in public transport bus companies, addresses the task of assigning buses to cover a given set of timetabled trips with consideration of practical requirements such as multiple depots and vehicle types as well as further extensions. An optimal schedule is characterized by minimal fleet size and/or minimal operational costs. Various publications were released as a result of extensive research in the last decades on this topic. Several modeling approaches as well as specialized solution strategies were presented for the problem and its extensions. This paper discusses the modeling approaches for different kinds of vehicle scheduling problems and gives an up-to-date and comprehensive overview on the basis of a general problem definition. Although we concentrate on the presentation of modeling approaches, also the basic ideas of solution approaches are given.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Bertossi AA, Carraresi P, Gallo G (1987) On some matching problems arising in vehicle scheduling models. Networks 17:271–281

    Article  Google Scholar 

  • Bianco L, Mingozzi A, Ricciardelli S (1994) A set partitioning approach to the multiple depot vehicle scheduling problem. Optim Methods Softw 3:163–194

    Article  Google Scholar 

  • Bodin L, Golden B (1981) Classification in vehicle routing and scheduling. Networks 11(2):97–108

    Article  Google Scholar 

  • Bodin L, Rosenfield D (1976) Estimation of the operating cost of mass transit systems. Technical report, State University of New York

  • Bodin L, Golden B, Assad A, Ball M (1983) Routing and scheduling of vehicles and crews: the state of the art. Comput Oper Res 10(2):63–211

    Article  Google Scholar 

  • Carpaneto G, Dell’Amico M, Fischetti M, Toth P (1989) A branch and bound algorithm for the multiple depot vehicle scheduling problem. Networks 19:531–548

    Article  Google Scholar 

  • Costa A, Branco I, Paixão JMP (1995) Vehicle scheduling problem with multiple type of vehicles and a single depot. In: Daduna J, Branco I, Paixão J (eds) Computer-aided transit scheduling. Lecture notes in economics and mathematical systems, vol 430. Springer, Berlin, pp 115–129

    Google Scholar 

  • Daduna JR, Mojsilovic M (1988) Computer-aided vehicle and duty scheduling using the HOT programme system. In: Daduna J, Wren A (eds) Computer-aided transit scheduling. Lecture notes in economics and mathematical systems, vol 308. Springer, Berlin, pp 133–146

    Google Scholar 

  • Daduna JR, Paixão JMP (1995) Vehicle scheduling for public mass transit—an overview. In: Daduna J, Branco I, Paixão J (eds) Computer-aided transit scheduling. Lecture notes in economics and mathematical systems, vol 430. Springer, Berlin, pp 76–90

    Google Scholar 

  • Daduna JR, Völker M (1997) Fahrzeugumlaufbildung im ÖPNV mit unscharfen Abfahrtszeiten. Nahverkehr 11:39–43

    Google Scholar 

  • Daduna JR, Mojsilovic M, Schütze P (1993) Practical experiences using an interactive optimization procedure for vehicle scheduling. In: Network optimization problems: algorithms, applications and complexity. World Scientific, Singapore, pp 37–52

    Google Scholar 

  • Dantzig GB, Fulkerson DR (1954) Minimizing the number of tankers to meet a fixed schedule. Nav Res Logist Q 1:217–222

    Article  Google Scholar 

  • Desaulniers G, Lavigne J, Soumis F (1998) Multi-depot vehicle scheduling problems with time windows and waiting costs. Eur J Oper Res 111:479–494

    Article  Google Scholar 

  • Dilworth RP (1950) A decomposition theorem for partially ordered sets. Ann Math 51(1):161–166

    Article  Google Scholar 

  • El-Azm A (1985) The minimum fleet size problem and its applications to bus scheduling. In: Rousseau J-M (ed) Computer scheduling of public transport 2. Elsevier Science, Amsterdam, pp 493–512

    Google Scholar 

  • Ferland JA, Michelon P (1988) The vehicle scheduling problem with multiple vehicle types. J Oper Res Soc 39(6):577–583

    Google Scholar 

  • Fischetti M, Lodi A, Toth P (1999) A branch-and-cut algorithm for the multi depot vehicle scheduling problem. Technical report, Universita di Bologna

  • Fischetti M, Lodi A, Martello S, Toth P (2001) A polyhedral approach to simplified crew scheduling and vehicle scheduling problems. Manag Sci 47(6):833–850

    Article  Google Scholar 

  • Forbes M, Holt JN, Watts AM (1994) An exact algorithm for multiple depot bus scheduling. Eur J Oper Res 72:115–124

    Article  Google Scholar 

  • Freling R, Paixão JMP (1995) Vehicle scheduling with time constraint. In: Daduna J, Branco I, Paixão J (eds) Computer-aided transit scheduling. Lecture notes in economics and mathematical systems, vol 430. Springer, Berlin, pp 130–144

    Google Scholar 

  • Freling R, Wagelmans AP, Paixão JMP (2001) Models and algorithms for single-depot vehicle scheduling. Transp Sci 35(2):165–180

    Article  Google Scholar 

  • Gavish B, Shlifer E (1979) An approach for solving a class of transportation scheduling problems. Eur J Oper Res 3:122–134

    Article  Google Scholar 

  • Gintner V, Kliewer N, Suhl L (2005) Solving large multiple-depot multiple-vehicle-type bus scheduling problems in practice. OR Spektrum 27(4):507–523

    Google Scholar 

  • Hadjar A, Soumis F (2005) Window reduction for the multiple depot vehicle scheduling problem with time windows. Technical Report G-2005-54, HEC Montreal, Montreal, Canada

  • Hadjar A, Marcotte O, Soumis F (2006) A branch-and-cut algorithm for the multiple depot vehicle scheduling problem. Oper Res 54(1):130–149

    Article  Google Scholar 

  • Haghani A, Banihashemi M (2002) Heuristic approaches for solving large-scale bus transit vehicle scheduling problem with route time constraints. Transp Res, Part A, Policy Pract 36:309–333

    Article  Google Scholar 

  • Hoffstadt J (1981) Computerized vehicle and driver scheduling for the Hamburger Hochbahn Aktiengesellschaft. In: Wren A (ed) Computer scheduling of public transport. North-Holland, Amsterdam, pp 35–52

    Google Scholar 

  • Kliewer N, Mellouli T, Suhl L (2002) A new solution model for multi-depot 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

  • Kliewer N, Bunte S, Suhl L (2006a) Time windows for scheduled trips in multiple depot vehicle scheduling. In: Proceedings of the EWGT2006 joint conferences, pp 340–346

  • Kliewer N, Mellouli T, Suhl L (2006b) A time-space network based exact optimization model for multi-depot bus scheduling. Eur J Oper Res 175(3):1616–1627

    Article  Google Scholar 

  • Kliewer N, Gintner V, Suhl L (2008) Line change considerations within a time-space network based multi-depot bus scheduling model. In: Hickman M, Mirchandani P, VoßS (eds) Computer-aided systems in public transport. Lecture notes in economics and mathematical systems, vol 600. Springer, Berlin, pp 57–70

    Chapter  Google Scholar 

  • Kresz M, Brodnik A, Bekesi J, Pash D (2009) An integrated framework for bus logistics management: case studies. In: Logistic management proceedings. Springer, Berlin, pp 21–37

    Google Scholar 

  • Lamatsch A (1992) An approach to vehicle scheduling with depot capacity constraints. In: Desrochers M, Rousseau J-M (eds) Computer-aided transit scheduling. Lecture notes in economics and mathematical systems, vol 386. Springer, Berlin, pp 181–195

    Google Scholar 

  • Lenstra J, Kan AR (1981) Complexity of vehicle routing and scheduling problems. Networks 11(2):221–227

    Article  Google Scholar 

  • Levin A (1971) Scheduling and fleet routing models for transportation systems. Transp Sci 5:232–255

    Article  Google Scholar 

  • Löbel A (1997) Optimal vehicle scheduling in public transit. PhD thesis, Technische Universität Berlin

  • Löbel A (1998) Vehicle scheduling in public transit and Lagrangian pricing. Manag Sci 44(12):1637–1650

    Article  Google Scholar 

  • Mesquita M, Paixão JMP (1992) Multiple depot vehicle scheduling problem: a new heuristic based on quasi-assignment algorithms. In: Desrochers M, Rousseau J-M (eds) Computer-aided transit scheduling. Lecture notes in economics and mathematical systems, vol 386. Springer, Berlin, pp 167–180

    Google Scholar 

  • Mesquita M, Paixão JMP (1999) Exact algorithms for the multi-depot vehicle scheduling problem based on multicommodity network flow type formulations. In: Wilson NH (ed) Computer-aided transit scheduling. Lecture notes in economics and mathematical systems, vol 471. Springer, Berlin, pp 221–243

    Google Scholar 

  • Mesquita M, Paias A, Respicio A (2009) Branching approaches for integrated vehicle and crew scheduling. Public Transp 1:21–37

    Article  Google Scholar 

  • Mingozzi A, Bianco L, Ricciardelli S (1995) An exact algorithm for combining vehicle trips. In: Daduna J, Branco I, Paixão J (eds) Computer-aided transit scheduling. Lecture notes in economics and mathematical systems, vol 430. Springer, Berlin, pp 145–172

    Google Scholar 

  • Orloff CS (1976) Route constrained fleet scheduling. Transp Sci 10(2):149–168

    Article  Google Scholar 

  • Oukil A, Amor HB, Desrosiers J, Gueddari HE (2007) Stabilized column generation for highly degenerate multiple-depot vehicle scheduling problems. Comput Oper Res 34:817–834

    Article  Google Scholar 

  • Paixão JMP, Branco I (1987) A quasi-assignment algorithm for bus scheduling. Networks 17:249–269

    Article  Google Scholar 

  • Ribeiro C, Soumis F (1994) A column generation approach to the multiple-depot vehicle scheduling problem. Oper Res 42(1):41–52

    Article  Google Scholar 

  • Saha JL (1972) An algorithm for bus scheduling problems. Oper Res Q 21(4):463–474

    Article  Google Scholar 

  • Savelsbergh MWP (1985) Local search in routing problems with time windows. Ann Oper Res 4:285–305

    Article  Google Scholar 

  • Silva GP, Wren A, Kwan RS, Gualda NDF (1999) Bus scheduling based on an arc generation—network flow approach. Technical report, University of Leeds, School of Computer Studies

  • Smith BM, Wren A (1981) Vampires and tasc: two successfully applied bus scheduling programs. In: Wren A (ed) Computer scheduling of public transport. North-Holland, Amsterdam, pp 97–124

    Google Scholar 

  • Wren A (2003) Scheduling vehicles and their drivers—forty years’ experience. Technical report, University of Leeds

Download references

Author information

Authors and Affiliations

  1. Decision Support & Operations Research Lab, University of Paderborn, Warburger Str. 100, 33098, Paderborn, Germany

    Stefan Bunte

  2. Department of Business Administration, Freie Universität Berlin, Garystr. 21, 14195, Berlin, Germany

    Natalia Kliewer

Authors
  1. Stefan Bunte
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Natalia Kliewer
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Stefan Bunte.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bunte, S., Kliewer, N. An overview on vehicle scheduling models. Public Transp 1, 299–317 (2009). https://doi.org/10.1007/s12469-010-0018-5

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12469-010-0018-5

Keywords

Search

Navigation