Skip to main content

A Crew Scheduling Approach for Public Transit Enhanced with Aspects from Vehicle Scheduling

  • Conference paper
Computer-aided Systems in Public Transport

Part of the book series: Lecture Notes in Economics and Mathematical Systems ((LNE,volume 600))

Abstract

This paper presents a new approach for solving the crew scheduling problem in public transit. The approach is based on interaction with the corresponding vehicle scheduling problem. We use a model of the vehicle scheduling problem which is based on a time-space network formulation. An advantage of this procedure is that it produces a bundle of optimal vehicle schedules, implicitly given by the solution flow. In our approach, we give this degree of freedom to the crew scheduling phase, where a vehicle schedule is selected that is most consistent with the objectives of crew scheduling.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 149.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 199.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Ball, M. O., Bodin, L., and Dial, R. (1983). A matching based heuristic for scheduling mass transit crews and vehicles. Transportation Science, 17, 4–31.

    Article  Google Scholar 

  • Barahona, F. and Anbil, R. (2000). The volume algorithm: Producing primal solutions with a subgradient method. Mathematical Programming, 87(3), 385–399.

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Carraresi, P., Girardi, L., and Nonato, M. (1995). Network models, lagrangean relaxation and subgradient bundle approach in crew scheduling problems. In J. Daduna, I. Branco, and J.M.P. Paixão, editors, Computer-Aided Transit Scheduling, pages 188–212. Springer, Berlin.

    Google Scholar 

  • Darby-Dowman, K., Jachnik, J. K., Lewis, R. L., and Mitra, G. (1988). Integrated decision support systems for urban transport scheduling: Discussion of implementation and experience. In J. Daduna and A. Wren, editors, Computer-Aided Transit Scheduling, pages 226–239. Springer, Berlin.

    Google Scholar 

  • Desaulniers, G., Cordeau, J.-F., Desrosiers, J., and Villeneuve, D. (2001). Simultaneous multi-depot bus and driver scheduling. Technical report, TRISTAN IV preprints.

    Google Scholar 

  • Desrochers, M. and Soumis, F. (1989). A column generation approach to the urban transit crew scheduling problem. Transportation Science, 23, 1–13.

    Google Scholar 

  • Falkner, J. C. and Ryan, D. M. (1992). Express: Set partitioning for bus crew scheduling in Christchurch. In M. Desrochers and D. Rousseau, editors, Computer-Aided Transit Scheduling, pages 359–378. Springer, Berlin.

    Google Scholar 

  • Fischetti, M., Martello, S., and Toth, P. (1987). The fixed job schedule problem with spread-time constraints. Operations Research, 35, 849–858.

    Google Scholar 

  • Fischetti, M., Martello, S., and Toth, P. (1989). The fixed job schedule problem with working-time constraints. Operations Research, 37, 395–403.

    Google Scholar 

  • Forbes, M. A., Hotts, J. N., and Watts, A. M. (1994). An exact algorithm for multiple depot vehicle scheduling. European Journal of Operations Research, 72, 115–124.

    Article  Google Scholar 

  • Freling, R. (1997). Models and Techniques for Integrating Vehicle and Crew Scheduling. Ph.D. thesis, Tinbergen Institute, Erasmus University Rotterdam.

    Google Scholar 

  • Freling, R., Boender, C. G. E., and ao, Paixão, J. M. P. (1995). An integrated approach to vehicle and crew scheduling. Technical report 9503/a, Econometric Institute, Erasmus University Rotterdam.

    Google Scholar 

  • Friberg, C. and Haase, K. (1999). An exact branch and cut algorithm for the vehicle and crew scheduling problem. In N. Wilson, editor, Computer-Aided Transit Scheduling, pages 63–80. Springer, Berlin.

    Google Scholar 

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

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Hane, C., Barnhart, C., Johnson, E. L., Marsten, R. E., Nemhauser, G. L., and Sigismondi, G. (1995). The fleet assignment problem: Solving a large integer program. Mathematical Programming, 70(2), 211–232.

    Google Scholar 

  • Huisman, D. (2004). Integrated and Dynamic Vehicle and Crew Scheduling. Ph.D. thesis, Tinbergen Institute, Erasmus University Rotterdam.

    Google Scholar 

  • Huisman, D., Freling, R., and Wagelmans, A. P.M. (2005). Multiple-depot integrated vehicle and crew scheduling. Transportation Science, 39, 491–502.

    Article  Google Scholar 

  • Kliewer, N., Mellouli, T., and 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, Politechnic of Bari.

    Google Scholar 

  • Kliewer, N., Mellouli, T., and Suhl, L. (2005). A time-space network based exact optimization model for multi-depot bus scheduling. European Journal of Operations Research, in press (online available).

    Google Scholar 

  • Löbel, A. (1997). Optimal Vehicle Scheduling in Public Transit. Ph.D. thesis, Technische Universität Berlin.

    Google Scholar 

  • 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 

  • Mesquita, M. and Paixão, J. (1999). Exact algorithms for the multiple-depot vehicle scheduling problem based on multicommodity network flow type formulations. In N. Wilson, editor, Computer-Aided Transit Scheduling, pages 223–246. Springer, Berlin.

    Google Scholar 

  • Patrikalakis, I. and Xerocostas, D. (1992). A new decomposition scheme of the urban public transport scheduling problem. In M. Desrochers and J. Rousseau, editors, Computer-Aided Transit Scheduling, pages 407–425. Springer, Berlin.

    Google Scholar 

  • Scott, D. (1985). A large linear programming approach to the public transport scheduling and cost model. In J. Rousseau, editor, Computer Scheduling of Public Transport 2, pages 473–491. North Holland, Amsterdam.

    Google Scholar 

  • Tosini, E. and Vercellis, C. (1988). An interactive system for the extra-urban vehicle and crew scheduling problems. In J. Daduna and A. Wren, editors, Computer-Aided Transit Scheduling, pages 41–53. Springer, Berlin.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

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. Lecture Notes in Economics and Mathematical Systems, vol 600. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73312-6_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-73312-6_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-73311-9

  • Online ISBN: 978-3-540-73312-6

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics