IDEAS home Printed from https://ideas.repec.org/a/inm/ortrsc/v46y2012i2p217-232.html
   My bibliography  Save this article

Railway Rolling Stock Planning: Robustness Against Large Disruptions

Author

Listed:
  • Valentina Cacchiani

    (Department of Electronics, Computer Science, and Systems, University of Bologna, 40136 Bologna, Italy)

  • Alberto Caprara

    (Department of Electronics, Computer Science, and Systems, University of Bologna, 40136 Bologna, Italy)

  • Laura Galli

    (Department of Electronics, Computer Science, and Systems, University of Bologna, 40136 Bologna, Italy)

  • Leo Kroon

    (Rotterdam School of Management, Erasmus University Rotterdam, NL-3000 DR Rotterdam, The Netherlands; and Netherlands Railways, NL-3500 HA Utrecht, The Netherlands)

  • Gábor Maróti

    (Rotterdam School of Management, Erasmus University Rotterdam, NL-3000 DR Rotterdam, The Netherlands)

  • Paolo Toth

    (Department of Electronics, Computer Science, and Systems, University of Bologna, 40136 Bologna, Italy)

Abstract

In this paper we describe a two-stage optimization model for determining robust rolling stock circulations for passenger trains. Here robustness means that the rolling stock circulations can better deal with large disruptions of the railway system. The two-stage optimization model is formulated as a large mixed-integer linear programming (MILP) model. We first use Benders decomposition to determine optimal solutions for the LP-relaxation of this model. Then we use the cuts that were generated by the Benders decomposition for computing heuristic robust solutions for the two-stage optimization model. We call our method Benders heuristic . We evaluate our approach on the real-life rolling stock-planning problem of Netherlands Railways, the main operator of passenger trains in the Netherlands. The computational results show that, thanks to Benders decomposition, the LP-relaxation of the two-stage optimization problem can be solved in a short time for a representative number of disruption scenarios. In addition, they demonstrate that the robust rolling stock circulation computed heuristically has total costs that are close to the LP lower bounds. Finally, we discuss the practical effectiveness of the robust rolling stock circulation: When a large number of disruption scenarios were applied to these robust circulations and to the nonrobust optimal circulations, the former appeared to be much more easily recoverable than the latter.

Suggested Citation

  • Valentina Cacchiani & Alberto Caprara & Laura Galli & Leo Kroon & Gábor Maróti & Paolo Toth, 2012. "Railway Rolling Stock Planning: Robustness Against Large Disruptions," Transportation Science, INFORMS, vol. 46(2), pages 217-232, May.
    • Handle: RePEc:inm:ortrsc:v:46:y:2012:i:2:p:217-232
    DOI: 10.1287/trsc.1110.0388
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.1110.0388
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.1110.0388?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
    ---><---

    References listed on IDEAS

    as
    1. Kroon, Leo & Maróti, Gábor & Helmrich, Mathijn Retel & Vromans, Michiel & Dekker, Rommert, 2008. "Stochastic improvement of cyclic railway timetables," Transportation Research Part B: Methodological, Elsevier, vol. 42(6), pages 553-570, July.
    2. Alan L. Erera & Juan C. Morales & Martin Savelsbergh, 2009. "Robust Optimization for Empty Repositioning Problems," Operations Research, INFORMS, vol. 57(2), pages 468-483, April.
    3. Matteo Fischetti & Domenico Salvagnin & Arrigo Zanette, 2009. "Fast Approaches to Improve the Robustness of a Railway Timetable," Transportation Science, INFORMS, vol. 43(3), pages 321-335, August.
    4. A. Ben-Tal & A. Nemirovski, 1998. "Robust Convex Optimization," Mathematics of Operations Research, INFORMS, vol. 23(4), pages 769-805, November.
    5. Dimitris Bertsimas & Melvyn Sim, 2004. "The Price of Robustness," Operations Research, INFORMS, vol. 52(1), pages 35-53, February.
    6. Valentina Cacchiani & Alberto Caprara & Matteo Fischetti, 2012. "A Lagrangian Heuristic for Robustness, with an Application to Train Timetabling," Transportation Science, INFORMS, vol. 46(1), pages 124-133, February.
    7. Fioole, Pieter-Jan & Kroon, Leo & Maroti, Gabor & Schrijver, Alexander, 2006. "A rolling stock circulation model for combining and splitting of passenger trains," European Journal of Operational Research, Elsevier, vol. 174(2), pages 1281-1297, October.
    8. Joyce W. Yen & John R. Birge, 2006. "A Stochastic Programming Approach to the Airline Crew Scheduling Problem," Transportation Science, INFORMS, vol. 40(1), pages 3-14, February.
    Full references (including those not matched with items on IDEAS)

    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. Lusby, Richard M. & Larsen, Jesper & Bull, Simon, 2018. "A survey on robustness in railway planning," European Journal of Operational Research, Elsevier, vol. 266(1), pages 1-15.
    2. Gabrel, Virginie & Murat, Cécile & Thiele, Aurélie, 2014. "Recent advances in robust optimization: An overview," European Journal of Operational Research, Elsevier, vol. 235(3), pages 471-483.
    3. Anita Schöbel, 2014. "Generalized light robustness and the trade-off between robustness and nominal quality," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 80(2), pages 161-191, October.
    4. Goerigk, Marc & Knust, Sigrid & Le, Xuan Thanh, 2016. "Robust storage loading problems with stacking and payload constraints," European Journal of Operational Research, Elsevier, vol. 253(1), pages 51-67.
    5. Högdahl, Johan & Bohlin, Markus & Fröidh, Oskar, 2019. "A combined simulation-optimization approach for minimizing travel time and delays in railway timetables," Transportation Research Part B: Methodological, Elsevier, vol. 126(C), pages 192-212.
    6. Jovanović, Predrag & Kecman, Pavle & Bojović, Nebojša & Mandić, Dragomir, 2017. "Optimal allocation of buffer times to increase train schedule robustness," European Journal of Operational Research, Elsevier, vol. 256(1), pages 44-54.
    7. Schrotenboer, Albert H. & Wenneker, Rob & Ursavas, Evrim & Zhu, Stuart X., 2023. "Reliable reserve-crew scheduling for airlines," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 178(C).
    8. Yang, Lixing & Zhou, Xuesong & Gao, Ziyou, 2014. "Credibility-based rescheduling model in a double-track railway network: a fuzzy reliable optimization approach," Omega, Elsevier, vol. 48(C), pages 75-93.
    9. Varas, Mauricio & Maturana, Sergio & Pascual, Rodrigo & Vargas, Ignacio & Vera, Jorge, 2014. "Scheduling production for a sawmill: A robust optimization approach," International Journal of Production Economics, Elsevier, vol. 150(C), pages 37-51.
    10. Jia Shu & Miao Song, 2014. "Dynamic Container Deployment: Two-Stage Robust Model, Complexity, and Computational Results," INFORMS Journal on Computing, INFORMS, vol. 26(1), pages 135-149, February.
    11. Jiateng Yin & Lixing Yang & Xuesong Zhou & Tao Tang & Ziyou Gao, 2019. "Balancing a one‐way corridor capacity and safety‐oriented reliability: A stochastic optimization approach for metro train timetabling," Naval Research Logistics (NRL), John Wiley & Sons, vol. 66(4), pages 297-320, June.
    12. Alberto Caprara & Laura Galli & Sebastian Stiller & Paolo Toth, 2014. "Delay-Robust Event Scheduling," Operations Research, INFORMS, vol. 62(2), pages 274-283, April.
    13. Marcus Ang & Yun Fong Lim & Melvyn Sim, 2012. "Robust Storage Assignment in Unit-Load Warehouses," Management Science, INFORMS, vol. 58(11), pages 2114-2130, November.
    14. Jonas Ide & Anita Schöbel, 2016. "Robustness for uncertain multi-objective optimization: a survey and analysis of different concepts," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 38(1), pages 235-271, January.
    15. Marla, Lavanya & Rikun, Alexander & Stauffer, Gautier & Pratsini, Eleni, 2020. "Robust modeling and planning: Insights from three industrial applications," Operations Research Perspectives, Elsevier, vol. 7(C).
    16. Sparing, Daniel & Goverde, Rob M.P., 2017. "A cycle time optimization model for generating stable periodic railway timetables," Transportation Research Part B: Methodological, Elsevier, vol. 98(C), pages 198-223.
    17. Bakker, Hannah & Dunke, Fabian & Nickel, Stefan, 2020. "A structuring review on multi-stage optimization under uncertainty: Aligning concepts from theory and practice," Omega, Elsevier, vol. 96(C).
    18. Da Lu & Fatma Gzara, 2015. "The robust crew pairing problem: model and solution methodology," Journal of Global Optimization, Springer, vol. 62(1), pages 29-54, May.
    19. Yongzhen Li & Jia Shu & Miao Song & Jiawei Zhang & Huan Zheng, 2017. "Multisourcing Supply Network Design: Two-Stage Chance-Constrained Model, Tractable Approximations, and Computational Results," INFORMS Journal on Computing, INFORMS, vol. 29(2), pages 287-300, May.
    20. Ben-Tal, Aharon & Chung, Byung Do & Mandala, Supreet Reddy & Yao, Tao, 2011. "Robust optimization for emergency logistics planning: Risk mitigation in humanitarian relief supply chains," Transportation Research Part B: Methodological, Elsevier, vol. 45(8), pages 1177-1189, September.

    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:inm:ortrsc:v:46:y:2012:i:2:p:217-232. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.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.