IDEAS home Printed from https://ideas.repec.org/p/zbw/cauman/416.html
   My bibliography  Save this paper

An exact algorithm for the vehicle and crew scheduling problem

Author

Listed:
  • Friberg, Christian
  • Haase, Knut

Abstract

We present a model for the vehicle and crew scheduling problem in urban public transport Systems by combining models for vehicle and crew scheduling that cover a great variety of real world aspects, especially constraints for crews resulting from wage agreements and internal regulations. The main part of the model consists of a set partitioning formulation to cover the desired trips of the schedule. Because of the great number of columns, e.g. more than 5 million for a problem with 30 trips, a column generation algorithm is implemented to use all columns implicitly for the calculation of the continuous relaxation of the set partitioning problem. The column generation algorithm is embedded in a brauch and bound approach to generate an exact solution for the problem. To generate even better lower bound, polyhedral cuts basing on clique detection and a variant of the column generation algorithm that suits the cuts were tested.

Suggested Citation

  • Friberg, Christian & Haase, Knut, 1996. "An exact algorithm for the vehicle and crew scheduling problem," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 416, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    • Handle: RePEc:zbw:cauman:416
    as

    Download full text from publisher

    File URL: https://www.econstor.eu/bitstream/10419/149047/1/manuskript_416.pdf
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Celso C. Ribeiro & François Soumis, 1994. "A Column Generation Approach to the Multiple-Depot Vehicle Scheduling Problem," Operations Research, INFORMS, vol. 42(1), pages 41-52, February.
    2. Michael Ball & Lawrence Bodin & Robert Dial, 1983. "A Matching Based Heuristic for Scheduling Mass Transit Crews and Vehicles," Transportation Science, INFORMS, vol. 17(1), pages 4-31, February.
    3. Martin Desrochers & François Soumis, 1989. "A Column Generation Approach to the Urban Transit Crew Scheduling Problem," Transportation Science, INFORMS, vol. 23(1), pages 1-13, February.
    4. Eugene L. Lawler, 1972. "A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem," Management Science, INFORMS, vol. 18(7), pages 401-405, March.
    5. Karla L. Hoffman & Manfred Padberg, 1993. "Solving Airline Crew Scheduling Problems by Branch-and-Cut," Management Science, INFORMS, vol. 39(6), pages 657-682, June.
    6. El-Darzi, Elia & Mitra, Gautam, 1995. "Graph theoretic relaxations of set covering and set partitioning problems," European Journal of Operational Research, Elsevier, vol. 87(1), pages 109-121, November.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Rodrigues, Maikol M. & de Souza, Cid C. & Moura, Arnaldo V., 2006. "Vehicle and crew scheduling for urban bus lines," European Journal of Operational Research, Elsevier, vol. 170(3), pages 844-862, May.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. A. Mingozzi & M. A. Boschetti & S. Ricciardelli & L. Bianco, 1999. "A Set Partitioning Approach to the Crew Scheduling Problem," Operations Research, INFORMS, vol. 47(6), pages 873-888, December.
    2. Knut Haase & Guy Desaulniers & Jacques Desrosiers, 2001. "Simultaneous Vehicle and Crew Scheduling in Urban Mass Transit Systems," Transportation Science, INFORMS, vol. 35(3), pages 286-303, August.
    3. Ingmar Steinzen & Vitali Gintner & Leena Suhl & Natalia Kliewer, 2010. "A Time-Space Network Approach for the Integrated Vehicle- and Crew-Scheduling Problem with Multiple Depots," Transportation Science, INFORMS, vol. 44(3), pages 367-382, August.
    4. Beasley, J. E. & Cao, B., 1996. "A tree search algorithm for the crew scheduling problem," European Journal of Operational Research, Elsevier, vol. 94(3), pages 517-526, November.
    5. Perumal, S.S.G. & Dollevoet, T.A.B. & Huisman, D. & Lusby, R.M. & Larsen, J. & Riis, M., 2020. "Solution Approaches for Vehicle and Crew Scheduling with Electric Buses," Econometric Institute Research Papers EI-2020-02, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    6. Ciancio, Claudio & Laganà, Demetrio & Musmanno, Roberto & Santoro, Francesco, 2018. "An integrated algorithm for shift scheduling problems for local public transport companies," Omega, Elsevier, vol. 75(C), pages 139-153.
    7. Michel Gamache & François Soumis & Gérald Marquis & Jacques Desrosiers, 1999. "A Column Generation Approach for Large-Scale Aircrew Rostering Problems," Operations Research, INFORMS, vol. 47(2), pages 247-263, April.
    8. Maenhout, Broos & Vanhoucke, Mario, 2010. "A hybrid scatter search heuristic for personalized crew rostering in the airline industry," European Journal of Operational Research, Elsevier, vol. 206(1), pages 155-167, October.
    9. Haase, Knut, 1999. "Retail business staff scheduling under complex labor relations," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 511, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    10. Guo, Yufeng & Mellouli, Taieb & Suhl, Leena & Thiel, Markus P., 2006. "A partially integrated airline crew scheduling approach with time-dependent crew capacities and multiple home bases," European Journal of Operational Research, Elsevier, vol. 171(3), pages 1169-1181, June.
    11. Perumal, Shyam S.G. & Lusby, Richard M. & Larsen, Jesper, 2022. "Electric bus planning & scheduling: A review of related problems and methodologies," European Journal of Operational Research, Elsevier, vol. 301(2), pages 395-413.
    12. Cynthia Barnhart & Amy Cohn, 2004. "Airline Schedule Planning: Accomplishments and Opportunities," Manufacturing & Service Operations Management, INFORMS, vol. 6(1), pages 3-22, November.
    13. Abdelouahab Zaghrouti & Issmail El Hallaoui & François Soumis, 2020. "Improving set partitioning problem solutions by zooming around an improving direction," Annals of Operations Research, Springer, vol. 284(2), pages 645-671, January.
    14. Marco E. Lübbecke & Jacques Desrosiers, 2005. "Selected Topics in Column Generation," Operations Research, INFORMS, vol. 53(6), pages 1007-1023, December.
    15. Haghani, Ali & Banihashemi, Mohamadreza, 2002. "Heuristic approaches for solving large-scale bus transit vehicle scheduling problem with route time constraints," Transportation Research Part A: Policy and Practice, Elsevier, vol. 36(4), pages 309-333, May.
    16. Desaulniers, G. & Desrosiers, J. & Dumas, Y. & Marc, S. & Rioux, B. & Solomon, M. M. & Soumis, F., 1997. "Crew pairing at Air France," European Journal of Operational Research, Elsevier, vol. 97(2), pages 245-259, March.
    17. Perumal, Shyam S.G. & Larsen, Jesper & Lusby, Richard M. & Riis, Morten & Sørensen, Kasper S., 2019. "A matheuristic for the driver scheduling problem with staff cars," European Journal of Operational Research, Elsevier, vol. 275(1), pages 280-294.
    18. Kuo, Yong-Hong & Leung, Janny M.Y. & Yan, Yimo, 2023. "Public transport for smart cities: Recent innovations and future challenges," European Journal of Operational Research, Elsevier, vol. 306(3), pages 1001-1026.
    19. Ernst, A. T. & Jiang, H. & Krishnamoorthy, M. & Sier, D., 2004. "Staff scheduling and rostering: A review of applications, methods and models," European Journal of Operational Research, Elsevier, vol. 153(1), pages 3-27, February.
    20. Breugem, T. & van Rossum, B.T.C. & Dollevoet, T. & Huisman, D., 2022. "A column generation approach for the integrated crew re-planning problem," Omega, Elsevier, vol. 107(C).

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:zbw:cauman:416. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: ZBW - Leibniz Information Centre for Economics (email available below). General contact details of provider: https://edirc.repec.org/data/ibkiede.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.