IDEAS home Printed from https://ideas.repec.org/p/ems/eureir/112228.html
   My bibliography  Save this paper

Determining and Evaluating Alternative Line Plans in (Near) Out-of-Control Situations

Author

Listed:
  • van Lieshout, R.N.
  • Bouman, P.C.
  • Huisman, D.

Abstract

From time to time, large disruptions cause heavily utilized railway networks to get in a state of (near) out-of-control, in which hardly any trains are able to run as the result of a lack of accurate and up-to-date information available to dispatchers. In this paper, we develop and test disruption management strategies for dealing with these situations. First, we propose an algorithm that finds an alternative line plan that can be operated in the affected part of the railway network. As the line plan should be feasible with respect to infrastructural and resource restrictions, we integrate these aspects in the algorithm in a Benders'-like fashion. Second, to operate the railway system within the disrupted region, we propose several local train dispatching strategies requiring varying degrees of exibility and coordination. Computational experiments based on disruptions in the Dutch railway network indicate that the algorithm performs well, finding workable and passenger oriented line plans within a couple of minutes. Moreover, we also demonstrate in a simulation study that the produced line plans can be operated smoothly without depending on central coordination.

Suggested Citation

  • van Lieshout, R.N. & Bouman, P.C. & Huisman, D., 2018. "Determining and Evaluating Alternative Line Plans in (Near) Out-of-Control Situations," Econometric Institute Research Papers EI2018-20, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
  • Handle: RePEc:ems:eureir:112228
    as

    Download full text from publisher

    File URL: https://repub.eur.nl/pub/112228/EI2018-20.pdf
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Mor Kaspi & Tal Raviv, 2013. "Service-Oriented Line Planning and Timetabling for Passenger Trains," Transportation Science, INFORMS, vol. 47(3), pages 295-311, August.
    2. Nadjla Ghaemi & Oded Cats & Rob M. P. Goverde, 2017. "Railway disruption management challenges and possible solution directions," Public Transport, Springer, vol. 9(1), pages 343-364, July.
    3. VANDERBECK, François & WOLSEY, Laurence A., 2010. "Reformulation and decomposition of integer programs," LIDAM Reprints CORE 2188, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    4. Jan-Willem Goossens & Stan van Hoesel & Leo Kroon, 2004. "A Branch-and-Cut Approach for Solving Railway Line-Planning Problems," Transportation Science, INFORMS, vol. 38(3), pages 379-393, August.
    5. Claessens, M. T. & van Dijk, N. M. & Zwaneveld, P. J., 1998. "Cost optimal allocation of rail passenger lines," European Journal of Operational Research, Elsevier, vol. 110(3), pages 474-489, November.
    6. Jespersen-Groth, J. & Potthoff, D. & Clausen, J. & Huisman, D. & Kroon, L.G. & Maróti, G. & Nielsen, M.N., 2007. "Disruption management in passenger railway transportation," Econometric Institute Research Papers EI 2007-05, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    7. Gianni Codato & Matteo Fischetti, 2006. "Combinatorial Benders' Cuts for Mixed-Integer Linear Programming," Operations Research, INFORMS, vol. 54(4), pages 756-766, August.
    8. Dekker, M.M. & van Lieshout, R.N. & Ball, R.C. & Bouman, P.C. & Dekker, S.C. & Dijkstra, H.A. & Goverde, R.M.P. & Huisman, D. & Panja, D. & Schaafsma, A.M. & van den Akker, M., 2018. "A Next Step in Disruption Management: Combining Operations Research and Complexity Science," Econometric Institute Research Papers EI2018-25, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    9. Berrebi, Simon J. & Watkins, Kari E. & Laval, Jorge A., 2015. "A real-time bus dispatching policy to minimize passenger wait on a high frequency route," Transportation Research Part B: Methodological, Elsevier, vol. 81(P2), pages 377-389.
    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. Fu, Huiling & Nie, Lei & Meng, Lingyun & Sperry, Benjamin R. & He, Zhenhuan, 2015. "A hierarchical line planning approach for a large-scale high speed rail network: The China case," Transportation Research Part A: Policy and Practice, Elsevier, vol. 75(C), pages 61-83.
    2. Zhang, Yongxiang & Peng, Qiyuan & Lu, Gongyuan & Zhong, Qingwei & Yan, Xu & Zhou, Xuesong, 2022. "Integrated line planning and train timetabling through price-based cross-resolution feedback mechanism," Transportation Research Part B: Methodological, Elsevier, vol. 155(C), pages 240-277.
    3. Yan, Fei & Goverde, Rob M.P., 2019. "Combined line planning and train timetabling for strongly heterogeneous railway lines with direct connections," Transportation Research Part B: Methodological, Elsevier, vol. 127(C), pages 20-46.
    4. Hu, Huaibin & Yue, Yixiang & Fu, Huiling & Li, Jiaxi, 2024. "How to optimize train lines for diverse passenger demands: A line planning approach providing matched train services for each O-D market," Transportation Research Part A: Policy and Practice, Elsevier, vol. 186(C).
    5. Jinfei Wu & Xinghua Shan & Jingxia Sun & Shengyuan Weng & Shuo Zhao, 2023. "Daily Line Planning Optimization for High-Speed Railway Lines," Sustainability, MDPI, vol. 15(4), pages 1-20, February.
    6. Tangjian Wei & Feng Shi & Guangming Xu, 2019. "Estimation of Time-Varying Passenger Demand for High Speed Rail System," Complexity, Hindawi, vol. 2019, pages 1-24, March.
    7. Masing, Berenike & Lindner, Niels & Borndörfer, Ralf, 2022. "The price of symmetric line plans in the Parametric City," Transportation Research Part B: Methodological, Elsevier, vol. 166(C), pages 419-443.
    8. Shuo Zhao & Xiwei Mi & Zhenyi Li, 2019. "A Stop-Probability Approach for O-D Service Frequency on High-Speed Railway Lines," Sustainability, MDPI, vol. 11(24), pages 1-21, December.
    9. Guan, J.F. & Yang, Hai & Wirasinghe, S.C., 2006. "Simultaneous optimization of transit line configuration and passenger line assignment," Transportation Research Part B: Methodological, Elsevier, vol. 40(10), pages 885-902, December.
    10. Pu, Song & Zhan, Shuguang, 2021. "Two-stage robust railway line-planning approach with passenger demand uncertainty," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 152(C).
    11. Yao, Zhiyuan & Nie, Lei & Fu, Huiling, 2024. "Railway line planning with passenger routing: Direct-service network representations and a two-phase solution approach," Transportation Research Part B: Methodological, Elsevier, vol. 186(C).
    12. Evelien van der Hurk & Haris N. Koutsopoulos & Nigel Wilson & Leo G. Kroon & Gábor Maróti, 2016. "Shuttle Planning for Link Closures in Urban Public Transport Networks," Transportation Science, INFORMS, vol. 50(3), pages 947-965, August.
    13. Ralf Borndörfer & Martin Grötschel & Marc E. Pfetsch, 2007. "A Column-Generation Approach to Line Planning in Public Transport," Transportation Science, INFORMS, vol. 41(1), pages 123-132, February.
    14. Schiewe, Alexander & Schiewe, Philine & Schmidt, Marie, 2019. "The line planning routing game," European Journal of Operational Research, Elsevier, vol. 274(2), pages 560-573.
    15. Wenliang Zhou & Xiang Li & Xin Shi, 2023. "Joint Optimization of Time-Dependent Line Planning and Differential Pricing with Passenger Train Choice in High-Speed Railway Networks," Mathematics, MDPI, vol. 11(6), pages 1-28, March.
    16. Mor Kaspi & Tal Raviv, 2013. "Service-Oriented Line Planning and Timetabling for Passenger Trains," Transportation Science, INFORMS, vol. 47(3), pages 295-311, August.
    17. Xu, Xiaoming & Li, Chung-Lun & Xu, Zhou, 2021. "Train timetabling with stop-skipping, passenger flow, and platform choice considerations," Transportation Research Part B: Methodological, Elsevier, vol. 150(C), pages 52-74.
    18. Hamid, Faiz & Agarwal, Yogesh K., 2024. "Train stop scheduling problem: An exact approach using valid inequalities and polar duality," European Journal of Operational Research, Elsevier, vol. 313(1), pages 207-224.
    19. Canca, David & Barrena, Eva & De-Los-Santos, Alicia & Andrade-Pineda, José Luis, 2016. "Setting lines frequency and capacity in dense railway rapid transit networks with simultaneous passenger assignment," Transportation Research Part B: Methodological, Elsevier, vol. 93(PA), pages 251-267.
    20. Goerigk, Marc & Schmidt, Marie, 2017. "Line planning with user-optimal route choice," European Journal of Operational Research, Elsevier, vol. 259(2), pages 424-436.

    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:ems:eureir:112228. 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: RePub (email available below). General contact details of provider: https://edirc.repec.org/data/feeurnl.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.