Skip to main content
Log in

Computing strong lower and upper bounds for the integrated multiple-depot vehicle and crew scheduling problem with branch-and-price

  • Original Paper
  • Published:
Central European Journal of Operations Research Aims and scope Submit manuscript

Abstract

In the problem of the title, vehicle and crew schedules are to be determined simultaneously in order to satisfy a given set of trips over time. The vehicles and the crew are assigned to depots, and a number of rules have to be observed in the course of constructing feasible schedules. The main contribution of the paper is a novel mathematical programming formulation which combines ideas from known models, and an exact solution procedure based on branch-and-price. The method is tested on benchmark instances from the literature and it provides suboptimal schedules using limited computational resources.

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

Access this article

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

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2

Similar content being viewed by others

References

  • Achterberg T (2009) SCIP: solving constraint integer programs. Math Program Comput 1(1):1–41. http://mpc.zib.de/index.php/MPC/article/view/4

  • Ball M, Bodin L, Dial R (1983) A matching based heuristic for scheduling mass transit crews and vehicles. Transp Sci 17(1):4–31

    Article  Google Scholar 

  • Balogh J, Békési J (2014) Driver scheduling for vehicle schedules using a set covering approach: a case study. In: Proceedings of the 10th international conference on applied informatics (accepted)

  • Békési J, Brodnik A, Krész M, Pash D (2009) An integrated framework for bus logistics management: case studies. In: Voß S, Pahl J, Schwarze S (eds) Logistik management. Physica-Verlag HD, Heidelberg, pp 389–411

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

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Borndörfer R, Löbel A, Weider S (2008) A bundle method for integrated multi-depot vehicle and duty scheduling in public transit. 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, Heidelberg, pp 3–24

  • Bunte S, Kliewer N (2009) An overview on vehicle scheduling models. Public Transp 1(4):299–317

    Article  Google Scholar 

  • Darby-Dowman K, Jachnik J, Lewis R, Mitra G (1988) Integrated decision support systems for urban transport scheduling: discussion of implementation and experience. In: Daduna JR, Wren A (eds) Computer-aided transit scheduling. Springer, Berlin, pp 226–239

  • Dezső B, Jüttner A, Kovács P (2011) LEMON—an open source C++ graph template library. Electron Notes Theor Comput Sci 264(5):23–45

    Article  Google Scholar 

  • Falkner J, Ryan D (1992) Express: set partitioning for bus crew scheduling in christchurch. In: Desrochers M, Rousseau J-M (eds) Computer-aided transit scheduling. Springer, Berlin, pp. 359–378

  • FICO (2016) FICO\(^{\textregistered }\) Xpress Optimization Suite. http://www.fico.com/en/products/fico-xpress-optimization-suite/. Accessed 28 Jul 2016

  • Fischetti M, Martello S, Toth P (1987) The fixed job schedule problem with spread-time constraints. Oper Res 35(6):849–858

    Article  Google Scholar 

  • Fischetti M, Martello S, Toth P (1989) The fixed job schedule problem with working-time constraints. Oper Res 37(3):395–403

    Article  Google Scholar 

  • Freling R, Boender CGE, Paixão JMP (1995a) An integrated approach to vehicle and crew scheduling. Technical report 9503/A, Econometric Institute, Erasmus University Rotterdam, Rotterdam

  • Freling R, Paixão JMP, Wagelmans AP (1995b) Models and algorithms for vehicle scheduling. Econometric Institute, Erasmus University Rotterdam, Rotterdam

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

    Article  Google Scholar 

  • Freling R, Huisman D, Wagelmans AP (2003) Models and algorithms for integration of vehicle and crew scheduling. J Sched 6(1):63–85

    Article  Google Scholar 

  • Friberg C, Haase K (1999) An exact branch and cut algorithm for the vehicle and crew scheduling problem. In: Wilson NHM (ed) Computer-aided transit scheduling. Springer, Berlin, pp 63–80

  • Gaffi A, Nonato M (1999) An integrated approach to ex-urban crew and vehicle scheduling. In: Wilson NHM (ed) Computer-aided transit scheduling. Springer, Berlin, pp 103–128

  • Gintner V, Kliewer N, Suhl L (2008) A crew scheduling approach for public transit enhanced with aspects from vehicle scheduling. In: Hickman M, Mirchandani P, Voß S (eds) Computer-aided systems in public transport. Springer, Berlin, pp 25–42

  • Haase K, Desaulniers G, Desrosiers J (2001) Simultaneous vehicle and crew scheduling in urban mass transit systems. Transp Sci 35(3):286–303

    Article  Google Scholar 

  • Huisman D (2003) Random data instances for multiple-depot vehicle and crew scheduling. http://people.few.eur.nl/huisman/instances.htm

  • Huisman D (2004) Integrated and dynamic vehicle and crew scheduling. PhD thesis, Erasmus School of Economics (ESE)

  • Huisman D, Freling R, Wagelmans AP (2005) Multiple-depot integrated vehicle and crew scheduling. Transp Sci 39(4):491–502

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Laurent B, Hao J-K (2008) Simultaneous vehicle and crew scheduling for extra urban transports. In: Nguyen NH, Borzemski L, Grzech A, Ali M (eds) New frontiers in applied artificial intelligence. Springer, Berlin, pp 466–475

  • Mesquita M, Paias A (2008) Set partitioning/covering-based approaches for the integrated vehicle and crew scheduling problem. Comput Oper Res 35(5):1562–1575

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Patrikalakis I, Xerocostas D (1992) A new decomposition scheme of the urban public transport scheduling problem. In: Desrochers M, Rousseau J-M (eds) Computer-aided transit scheduling. Springer, Berlin, pp 407–425

  • Pepin A-S, Desaulniers G, Hertz A, Huisman D (2006) Comparison of heuristic approaches for the multiple depot vehicle scheduling problem. Technical report, econometric institute research papers

  • Ryan DM, Foster BA (1981) An integer programming approach to scheduling. In: Computer scheduling of public transport urban passenger vehicle and crew scheduling. pp 269–280

  • Scott D (1985) A large scale linear programming approach to the public transport scheduling and costing problem. Computer scheduling of public transport, vol 2. Elsevier, Amsterdam, pp 473–491

    Google Scholar 

  • Steinzen I (2007) Topics in integrated vehicle and crew scheduling in public transit. PhD thesis, University of Paderborn

  • Steinzen I, Gintner V, Suhl L, Kliewer N (2010) A time-space network approach for the integrated vehicle-and crew-scheduling problem with multiple depots. Transp Sci 44(3):367–382

    Article  Google Scholar 

  • Tosini E, Vercellis C (1988) An interactive system for extra-urban vehicle and crew scheduling problems. In: Daduna JR, Wren A (eds) Computer-aided transit scheduling. Springer, Berlin, pp 41–53

Download references

Acknowledgements

This work has been supported by the OTKA Grant K112881, and by the GINOP-2.3.2-15-2016-00002 Grant of the Ministry of National Economy of Hungary. The authors are grateful to the developers of the SCIP Optimization Suite for their support.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Tamás Kis.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Horváth, M., Kis, T. Computing strong lower and upper bounds for the integrated multiple-depot vehicle and crew scheduling problem with branch-and-price. Cent Eur J Oper Res 27, 39–67 (2019). https://doi.org/10.1007/s10100-017-0489-4

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10100-017-0489-4

Keywords

Navigation