IDEAS home Printed from https://ideas.repec.org/a/spr/pubtra/v13y2021i3d10.1007_s12469-020-00253-x.html
   My bibliography  Save this article

Railway timetabling: a maximum bottleneck path algorithm for finding an additional train path

Author

Listed:
  • Fredrik Ljunggren

    (Linköping University
    Trafikverket)

  • Kristian Persson

    (Linköping University
    Sweco)

  • Anders Peterson

    (Linköping University)

  • Christiane Schmidt

    (Linköping University)

Abstract

We present an algorithm to insert a train path in an existing railway timetable close to operation, when we want to affect the existing (passenger) traffic as little as possible. Thus, we consider all other trains as fixed, and aim for a resulting train path that maximizes the bottleneck robustness, that is, a train path that maximizes the temporal distance to neighboring trains in the timetable. Our algorithm is based on a graph formulation of the problem and uses a variant of Dijkstra’s algorithm. We present an extensive experimental evaluation of our algorithm for the Swedish railway stretch from Malmö to Hallsberg. Moreover, we analyze the size of our constructed graph.

Suggested Citation

  • Fredrik Ljunggren & Kristian Persson & Anders Peterson & Christiane Schmidt, 2021. "Railway timetabling: a maximum bottleneck path algorithm for finding an additional train path," Public Transport, Springer, vol. 13(3), pages 597-623, October.
    • Handle: RePEc:spr:pubtra:v:13:y:2021:i:3:d:10.1007_s12469-020-00253-x
    DOI: 10.1007/s12469-020-00253-x
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s12469-020-00253-x
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s12469-020-00253-x?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. Cacchiani, Valentina & Caprara, Alberto & Toth, Paolo, 2010. "Scheduling extra freight trains on railway networks," Transportation Research Part B: Methodological, Elsevier, vol. 44(2), pages 215-231, February.
    2. Burdett, R.L. & Kozan, E., 2009. "Techniques for inserting additional trains into existing timetables," Transportation Research Part B: Methodological, Elsevier, vol. 43(8-9), pages 821-836, September.
    3. Jiang, Feng & Cacchiani, Valentina & Toth, Paolo, 2017. "Train timetabling by skip-stop planning in highly congested lines," Transportation Research Part B: Methodological, Elsevier, vol. 104(C), pages 149-174.
    4. Christian Liebchen, 2008. "The First Optimized Railway Timetable in Practice," Transportation Science, INFORMS, vol. 42(4), pages 420-435, November.
    5. Maurice Pollack, 1960. "Letter to the Editor---The Maximum Capacity Through a Network," Operations Research, INFORMS, vol. 8(5), pages 733-736, October.
    6. Vromans, Michiel J.C.M. & Dekker, Rommert & Kroon, Leo G., 2006. "Reliability and heterogeneity of railway services," European Journal of Operational Research, Elsevier, vol. 172(2), pages 647-665, July.
    7. Zhang, Jiamin, 2015. "Analysis on line capacity usage for China high speed railway with optimization approach," Transportation Research Part A: Policy and Practice, Elsevier, vol. 77(C), pages 336-349.
    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. Gao, Yuan & Kroon, Leo & Yang, Lixing & Gao, Ziyou, 2018. "Three-stage optimization method for the problem of scheduling additional trains on a high-speed rail corridor," Omega, Elsevier, vol. 80(C), pages 175-191.
    2. Zhang, Yongxiang & Peng, Qiyuan & Yao, Yu & Zhang, Xin & Zhou, Xuesong, 2019. "Solving cyclic train timetabling problem through model reformulation: Extended time-space network construct and Alternating Direction Method of Multipliers methods," Transportation Research Part B: Methodological, Elsevier, vol. 128(C), pages 344-379.
    3. Jiang, Feng & Cacchiani, Valentina & Toth, Paolo, 2017. "Train timetabling by skip-stop planning in highly congested lines," Transportation Research Part B: Methodological, Elsevier, vol. 104(C), pages 149-174.
    4. Krier, Betty & Liu, Chia-Mei & McNamara, Brian & Sharpe, Jerrod, 2014. "Individual freight effects, capacity utilization, and Amtrak service quality," Transportation Research Part A: Policy and Practice, Elsevier, vol. 64(C), pages 163-175.
    5. Lin, Zhiyuan & Kwan, Raymond S.K., 2016. "A branch-and-price approach for solving the train unit scheduling problem," Transportation Research Part B: Methodological, Elsevier, vol. 94(C), pages 97-120.
    6. Zhang, Chuntian & Gao, Yuan & Yang, Lixing & Gao, Ziyou & Qi, Jianguo, 2020. "Joint optimization of train scheduling and maintenance planning in a railway network: A heuristic algorithm using Lagrangian relaxation," Transportation Research Part B: Methodological, Elsevier, vol. 134(C), pages 64-92.
    7. Talebian, Ahmadreza & Zou, Bo, 2015. "Integrated modeling of high performance passenger and freight train planning on shared-use corridors in the US," Transportation Research Part B: Methodological, Elsevier, vol. 82(C), pages 114-140.
    8. Li, Wenqing & Ni, Shaoquan, 2022. "Train timetabling with the general learning environment and multi-agent deep reinforcement learning," Transportation Research Part B: Methodological, Elsevier, vol. 157(C), pages 230-251.
    9. David Canca & Eva Barrena & Gilbert Laporte & Francisco A. Ortega, 2016. "A short-turning policy for the management of demand disruptions in rapid transit systems," Annals of Operations Research, Springer, vol. 246(1), pages 145-166, November.
    10. Wu, Yinghui & Yang, Hai & Zhao, Shuo & Shang, Pan, 2021. "Mitigating unfairness in urban rail transit operation: A mixed-integer linear programming approach," Transportation Research Part B: Methodological, Elsevier, vol. 149(C), pages 418-442.
    11. Li, Zhujun & Shalaby, Amer & Roorda, Matthew J. & Mao, Baohua, 2021. "Urban rail service design for collaborative passenger and freight transport," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 147(C).
    12. 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.
    13. Liping Ge & Stefan Voß & Lin Xie, 2022. "Robustness and disturbances in public transport," Public Transport, Springer, vol. 14(1), pages 191-261, March.
    14. Chow, Andy H.F. & Pavlides, Aris, 2018. "Cost functions and multi-objective timetabling of mixed train services," Transportation Research Part A: Policy and Practice, Elsevier, vol. 113(C), pages 335-356.
    15. Shi, Jungang & Yang, Lixing & Yang, Jing & Gao, Ziyou, 2018. "Service-oriented train timetabling with collaborative passenger flow control on an oversaturated metro line: An integer linear optimization approach," Transportation Research Part B: Methodological, Elsevier, vol. 110(C), pages 26-59.
    16. 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.
    17. Sairong Peng & Xin Yang & Hongwei Wang & Hairong Dong & Bin Ning & Haichuan Tang & Zhipeng Ying & Ruijun Tang, 2019. "Dispatching High-Speed Rail Trains via Utilizing the Reverse Direction Track: Adaptive Rescheduling Strategies and Application," Sustainability, MDPI, vol. 11(8), pages 1-20, April.
    18. Vansteenwegen, Pieter & Dewilde, Thijs & Burggraeve, Sofie & Cattrysse, Dirk, 2016. "An iterative approach for reducing the impact of infrastructure maintenance on the performance of railway systems," European Journal of Operational Research, Elsevier, vol. 252(1), pages 39-53.
    19. 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.
    20. Yu-Jun Zheng, 2018. "Emergency Train Scheduling on Chinese High-Speed Railways," Transportation Science, INFORMS, vol. 52(5), pages 1077-1091, October.

    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:spr:pubtra:v:13:y:2021:i:3:d:10.1007_s12469-020-00253-x. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.