IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v219y2012i2p214-223.html
   My bibliography  Save this article

Divide-and-price: A decomposition algorithm for solving large railway crew scheduling problems

Author

Listed:
  • Jütte, Silke
  • Thonemann, Ulrich W.

Abstract

The railway crew scheduling problem consists of generating crew duties to operate trains at minimal cost, while meeting all work regulations and operational requirements. Typically, a railway operation uses tens of thousands of train movements (trips) and requires thousands of crew members to be assigned to these trips. Despite the large size of the problem, crew schedules need to be generated in short time, because large parts of the train schedule are not finalized until few days before operation.

Suggested Citation

  • Jütte, Silke & Thonemann, Ulrich W., 2012. "Divide-and-price: A decomposition algorithm for solving large railway crew scheduling problems," European Journal of Operational Research, Elsevier, vol. 219(2), pages 214-223.
    • Handle: RePEc:eee:ejores:v:219:y:2012:i:2:p:214-223
    DOI: 10.1016/j.ejor.2011.12.038
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221711011325
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2011.12.038?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. 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.
    2. Richard Freling & Ramon Lentink & Albert Wagelmans, 2004. "A Decision Support System for Crew Planning in Passenger Transportation Using a Flexible Branch-and-Price Algorithm," Annals of Operations Research, Springer, vol. 127(1), pages 203-222, March.
    3. Huisman, Dennis & Wagelmans, Albert P.M., 2006. "A solution approach for dynamic vehicle and crew scheduling," European Journal of Operational Research, Elsevier, vol. 172(2), pages 453-471, July.
    4. François Vanderbeck, 2000. "On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm," Operations Research, INFORMS, vol. 48(1), pages 111-128, February.
    5. Desrochers, Martin & Soumis, Francois, 1988. "A reoptimization algorithm for the shortest path problem with time windows," European Journal of Operational Research, Elsevier, vol. 35(2), pages 242-254, May.
    6. Saddoune, Mohammed & Desaulniers, Guy & Elhallaoui, Issmail & Soumis, François, 2011. "Integrated airline crew scheduling: A bi-dynamic constraint aggregation method using neighborhoods," European Journal of Operational Research, Elsevier, vol. 212(3), pages 445-454, August.
    7. Balaji Gopalakrishnan & Ellis. Johnson, 2005. "Airline Crew Scheduling: State-of-the-Art," Annals of Operations Research, Springer, vol. 140(1), pages 305-337, November.
    8. 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.
    9. Lan, Guanghui & DePuy, Gail W. & Whitehouse, Gary E., 2007. "An effective and simple heuristic for the set covering problem," European Journal of Operational Research, Elsevier, vol. 176(3), pages 1387-1403, February.
    10. Abbink, E.J.W. & Albino, L. & Dollevoet, T.A.B. & Huisman, D. & Roussado, J. & Saldanha, R.L., 2010. "Solving Large Scale Crew Scheduling Problems in Practice," Econometric Institute Research Papers EI 2010-63, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    11. Raymond Kwan & Ann Kwan, 2007. "Effective search space control for large and/or complex driver scheduling problems," Annals of Operations Research, Springer, vol. 155(1), pages 417-435, November.
    12. Cynthia Barnhart & Ellis L. Johnson & George L. Nemhauser & Martin W. P. Savelsbergh & Pamela H. Vance, 1998. "Branch-and-Price: Column Generation for Solving Huge Integer Programs," Operations Research, INFORMS, vol. 46(3), pages 316-329, June.
    13. Huseyin Topaloglu & Warren B. Powell, 2005. "A Distributed Decision-Making Structure for Dynamic Resource Allocation Using Nonlinear Functional Approximations," Operations Research, INFORMS, vol. 53(2), pages 281-297, April.
    14. Cynthia Barnhart & Levent Hatay & Ellis L. Johnson, 1995. "Deadhead Selection for the Long-Haul Crew Pairing Problem," Operations Research, INFORMS, vol. 43(3), pages 491-499, June.
    15. Panayiotis Alefragis & Peter Sanders & Tuomo Takkula & Dag Wedelin, 2000. "Parallel Integer Optimization for Crew Scheduling," Annals of Operations Research, Springer, vol. 99(1), pages 141-166, December.
    16. 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.
    17. Stefan Irnich & Guy Desaulniers, 2005. "Shortest Path Problems with Resource Constraints," Springer Books, in: Guy Desaulniers & Jacques Desrosiers & Marius M. Solomon (ed.), Column Generation, chapter 0, pages 33-65, Springer.
    18. Marco E. Lübbecke & Jacques Desrosiers, 2005. "Selected Topics in Column Generation," Operations Research, INFORMS, vol. 53(6), pages 1007-1023, December.
    19. Alberto Caprara & Matteo Fischetti & Paolo Toth, 1999. "A Heuristic Method for the Set Covering Problem," Operations Research, INFORMS, vol. 47(5), pages 730-743, October.
    20. Julien Bramel & David Simchi-Levi, 1997. "On the Effectiveness of Set Covering Formulations for the Vehicle Routing Problem with Time Windows," Operations Research, INFORMS, vol. 45(2), pages 295-301, April.
    21. Lubbecke, Marco E., 2005. "Dual variable based fathoming in dynamic programs for column generation," European Journal of Operational Research, Elsevier, vol. 162(1), pages 122-125, April.
    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. Guo, Jia & Bard, Jonathan F., 2024. "Weekly scheduling for freight rail engineers & trainmen," Transportation Research Part B: Methodological, Elsevier, vol. 183(C).
    2. Neufeld, Janis S. & Scheffler, Martin & Tamke, Felix & Hoffmann, Kirsten & Buscher, Udo, 2021. "An efficient column generation approach for practical railway crew scheduling with attendance rates," European Journal of Operational Research, Elsevier, vol. 293(3), pages 1113-1130.
    3. Shen, Yindong & Peng, Kunkun & Chen, Kai & Li, Jingpeng, 2013. "Evolutionary crew scheduling with adaptive chromosomes," Transportation Research Part B: Methodological, Elsevier, vol. 56(C), pages 174-185.
    4. Heil, Julia & Hoffmann, Kirsten & Buscher, Udo, 2020. "Railway crew scheduling: Models, methods and applications," European Journal of Operational Research, Elsevier, vol. 283(2), pages 405-425.
    5. Dauzère-Pérès, Stéphane & De Almeida, David & Guyon, Olivier & Benhizia, Faten, 2015. "A Lagrangian heuristic framework for a real-life integrated planning problem of railway transportation resources," Transportation Research Part B: Methodological, Elsevier, vol. 74(C), pages 138-150.
    6. Kirsten Hoffmann & Udo Buscher & Janis Sebastian Neufeld & Felix Tamke, 2017. "Solving Practical Railway Crew Scheduling Problems with Attendance Rates," Business & Information Systems Engineering: The International Journal of WIRTSCHAFTSINFORMATIK, Springer;Gesellschaft für Informatik e.V. (GI), vol. 59(3), pages 147-159, June.
    7. Bach, L. & Dollevoet, T.A.B. & Huisman, D., 2014. "Integrating Timetabling and Crew," Econometric Institute Research Papers EI 2014-03, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    8. Lukas Bach & Twan Dollevoet & Dennis Huisman, 2016. "Integrating Timetabling and Crew Scheduling at a Freight Railway Operator," Transportation Science, INFORMS, vol. 50(3), pages 878-891, August.
    9. van Rossum, B.T.C. & Dollevoet, T. & Huisman, D., 2024. "Railway crew planning with fairness over time," European Journal of Operational Research, Elsevier, vol. 318(1), pages 55-70.
    10. Fuentes, Manuel & Cadarso, Luis & Marín, Ángel, 2019. "A hybrid model for crew scheduling in rail rapid transit networks," Transportation Research Part B: Methodological, Elsevier, vol. 125(C), pages 248-265.
    11. Suyabatmaz, Ali Çetin & Şahin, Güvenç, 2015. "Railway crew capacity planning problem with connectivity of schedules," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 84(C), pages 88-100.

    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. Silke Jütte & Marc Albers & Ulrich W. Thonemann & Knut Haase, 2011. "Optimizing Railway Crew Scheduling at DB Schenker," Interfaces, INFORMS, vol. 41(2), pages 109-122, April.
    2. Heil, Julia & Hoffmann, Kirsten & Buscher, Udo, 2020. "Railway crew scheduling: Models, methods and applications," European Journal of Operational Research, Elsevier, vol. 283(2), pages 405-425.
    3. Masoud Yaghini & Mohammad Karimi & Mohadeseh Rahbar, 2015. "A set covering approach for multi-depot train driver scheduling," Journal of Combinatorial Optimization, Springer, vol. 29(3), pages 636-654, April.
    4. Mohamed Haouari & Farah Zeghal Mansour & Hanif D. Sherali, 2019. "A New Compact Formulation for the Daily Crew Pairing Problem," Transportation Science, INFORMS, vol. 53(3), pages 811-828, May.
    5. 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.
    6. Luciano Costa & Claudio Contardo & Guy Desaulniers, 2019. "Exact Branch-Price-and-Cut Algorithms for Vehicle Routing," Transportation Science, INFORMS, vol. 53(4), pages 946-985, July.
    7. Atoosa Kasirzadeh & Mohammed Saddoune & François Soumis, 2017. "Airline crew scheduling: models, algorithms, and data sets," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 6(2), pages 111-137, June.
    8. Breugem, T. & Dollevoet, T.A.B. & Huisman, D., 2017. "Is Equality always desirable?," Econometric Institute Research Papers EI2017-30, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    9. Vahid Zeighami & François Soumis, 2019. "Combining Benders’ Decomposition and Column Generation for Integrated Crew Pairing and Personalized Crew Assignment Problems," Transportation Science, INFORMS, vol. 53(5), pages 1479-1499, September.
    10. Paul A. Chircop & Timothy J. Surendonk & Menkes H. L. van den Briel & Toby Walsh, 2022. "On routing and scheduling a fleet of resource-constrained vessels to provide ongoing continuous patrol coverage," Annals of Operations Research, Springer, vol. 312(2), pages 723-760, May.
    11. Frédéric Quesnel & Guy Desaulniers & Frédéric Quesnel, 2020. "Improving Air Crew Rostering by Considering Crew Preferences in the Crew Pairing Problem," Transportation Science, INFORMS, vol. 54(1), pages 97-114, January.
    12. Quesnel, Frédéric & Desaulniers, Guy & Soumis, François, 2020. "A branch-and-price heuristic for the crew pairing problem with language constraints," European Journal of Operational Research, Elsevier, vol. 283(3), pages 1040-1054.
    13. Thomas Breugem & Twan Dollevoet & Dennis Huisman, 2022. "Is Equality Always Desirable? Analyzing the Trade-Off Between Fairness and Attractiveness in Crew Rostering," Management Science, INFORMS, vol. 68(4), pages 2619-2641, April.
    14. Stefan Irnich & Guy Desaulniers & Jacques Desrosiers & Ahmed Hadjar, 2010. "Path-Reduced Costs for Eliminating Arcs in Routing and Scheduling," INFORMS Journal on Computing, INFORMS, vol. 22(2), pages 297-313, May.
    15. Bouarab, Hocine & El Hallaoui, Issmail & Metrane, Abdelmoutalib & Soumis, François, 2017. "Dynamic constraint and variable aggregation in column generation," European Journal of Operational Research, Elsevier, vol. 262(3), pages 835-850.
    16. Arpan Rijal & Marco Bijvank & Asvin Goel & René de Koster, 2021. "Workforce Scheduling with Order-Picking Assignments in Distribution Facilities," Transportation Science, INFORMS, vol. 55(3), pages 725-746, May.
    17. Jesica Armas & Luis Cadarso & Angel A. Juan & Javier Faulin, 2017. "A multi-start randomized heuristic for real-life crew rostering problems in airlines with work-balancing goals," Annals of Operations Research, Springer, vol. 258(2), pages 825-848, November.
    18. Fuentes, Manuel & Cadarso, Luis & Marín, Ángel, 2019. "A hybrid model for crew scheduling in rail rapid transit networks," Transportation Research Part B: Methodological, Elsevier, vol. 125(C), pages 248-265.
    19. Philippe Racette & Frédéric Quesnel & Andrea Lodi & François Soumis, 2024. "Gaining insight into crew rostering instances through ML-based sequential assignment," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 32(3), pages 537-578, October.
    20. 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.

    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:eee:ejores:v:219:y:2012:i:2:p:214-223. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.