IDEAS home Printed from https://ideas.repec.org/a/eee/jomega/v116y2023ics030504832200202x.html
   My bibliography  Save this article

Optimal Train Rescheduling in Oslo Central Station

Author

Listed:
  • Mannino, Carlo
  • Nakkerud, Andreas

Abstract

Real-time train dispatching (i.e., rescheduling and replatforming) in passenger railway stations is a very important and very challenging task. In most major stations, this task is carried out by hand by highly trained dispatchers who use their extensive experience to find near-optimal solutions under most conditions. With several simultaneous deviations from the timetable, however, the traffic situation may become too complex for any human to handle it far beyond finding feasible solutions. As part of a prototype for a dispatching support tool developed in collaboration with Bane NOR (Norwegian rail manager), we develop an approach for Optimal Train Rescheduling in large passenger stations. To allow for replatforming, we extend the standard job-shop scheduling approach to train-scheduling, and we develop and compare different MILP formulations for this extended approach. With this approach, we can find, in just a few seconds, optimal plans for our realistic instances from Oslo Central Station, the largest passenger train hub in Norway. The prototype will be tested by dispatchers in the greater Oslo area, starting from the fall of 2021.

Suggested Citation

  • Mannino, Carlo & Nakkerud, Andreas, 2023. "Optimal Train Rescheduling in Oslo Central Station," Omega, Elsevier, vol. 116(C).
    • Handle: RePEc:eee:jomega:v:116:y:2023:i:c:s030504832200202x
    DOI: 10.1016/j.omega.2022.102796
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S030504832200202X
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.omega.2022.102796?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. Zhang, Huimin & Li, Shukai & Wang, Yihui & Yang, Lixing & Gao, Ziyou, 2021. "Collaborative real-time optimization strategy for train rescheduling and track emergency maintenance of high-speed railway: A Lagrangian relaxation-based decomposition algorithm," Omega, Elsevier, vol. 102(C).
    2. Cynthia Barnhart & Christopher A. Hane & Pamela H. Vance, 2000. "Using Branch-and-Price-and-Cut to Solve Origin-Destination Integer Multicommodity Flow Problems," Operations Research, INFORMS, vol. 48(2), pages 318-326, April.
    3. Pellegrini, Paola & Marlière, Grégory & Rodriguez, Joaquin, 2014. "Optimal train routing and scheduling for managing traffic perturbations in complex junctions," Transportation Research Part B: Methodological, Elsevier, vol. 59(C), pages 58-80.
    4. Chen, Zebin & Li, Shukai & D’Ariano, Andrea & Yang, Lixing, 2022. "Real-time optimization for train regulation and stop-skipping adjustment strategy of urban rail transit lines," Omega, Elsevier, vol. 110(C).
    5. Lamorgese, Leonardo & Mannino, Carlo & Natvig, Erik, 2017. "An exact micro–macro approach to cyclic and non-cyclic train timetabling," Omega, Elsevier, vol. 72(C), pages 59-70.
    6. Steven Harrod, 2011. "Modeling Network Transition Constraints with Hypergraphs," Transportation Science, INFORMS, vol. 45(1), pages 81-97, February.
    7. Leonardo Lamorgese & Carlo Mannino, 2019. "A Noncompact Formulation for Job-Shop Scheduling Problems in Traffic Management," Operations Research, INFORMS, vol. 67(6), pages 1586-1609, November.
    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. Yuan, Yin & Li, Shukai & Yang, Lixing & Gao, Ziyou, 2022. "Real-time optimization of train regulation and passenger flow control for urban rail transit network under frequent disturbances," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 168(C).
    2. Oddvar Kloster & Bjørnar Luteberget & Carlo Mannino & Giorgio Sartor, 2023. "An Optimization-Based Decision Support Tool for Incremental Train Timetabling," SN Operations Research Forum, Springer, vol. 4(3), pages 1-20, September.
    3. Sartor, Giorgio & Mannino, Carlo & Nygreen, Thomas & Bach, Lukas, 2023. "A MILP model for quasi-periodic strategic train timetabling," Omega, Elsevier, vol. 116(C).
    4. Luan, Xiaojie & De Schutter, Bart & Meng, Lingyun & Corman, Francesco, 2020. "Decomposition and distributed optimization of real-time traffic management for large-scale railway networks," Transportation Research Part B: Methodological, Elsevier, vol. 141(C), pages 72-97.
    5. Leonardo Lamorgese & Carlo Mannino, 2015. "An Exact Decomposition Approach for the Real-Time Train Dispatching Problem," Operations Research, INFORMS, vol. 63(1), pages 48-64, February.
    6. Leonardo Lamorgese & Carlo Mannino & Mauro Piacentini, 2016. "Optimal Train Dispatching by Benders’-Like Reformulation," Transportation Science, INFORMS, vol. 50(3), pages 910-925, August.
    7. Tian, Xiaopeng & Niu, Huimin, 2020. "Optimization of demand-oriented train timetables under overtaking operations: A surrogate-dual-variable column generation for eliminating indivisibility," Transportation Research Part B: Methodological, Elsevier, vol. 142(C), pages 143-173.
    8. Limsawasd, Charinee & Athigakunagorn, Nathee & Khathawatcharakun, Phattadon & Boonmee, Atiwat, 2022. "Skip-Stop Strategy Patterns optimization to enhance mass transit operation under physical distancing policy due to COVID-19 pandemic outbreak," Transport Policy, Elsevier, vol. 126(C), pages 225-238.
    9. Schön, Cornelia & König, Eva, 2018. "A stochastic dynamic programming approach for delay management of a single train line," European Journal of Operational Research, Elsevier, vol. 271(2), pages 501-518.
    10. 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.
    11. Melchiori, Anna & Sgalambro, Antonino, 2020. "A branch and price algorithm to solve the Quickest Multicommodity k-splittable Flow Problem," European Journal of Operational Research, Elsevier, vol. 282(3), pages 846-857.
    12. Amy Cohn & Michael Magazine & George Polak, 2009. "Rank‐Cluster‐and‐Prune: An algorithm for generating clusters in complex set partitioning problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 56(3), pages 215-225, April.
    13. Albert H. Schrotenboer & Evrim Ursavas & Iris F. A. Vis, 2019. "A Branch-and-Price-and-Cut Algorithm for Resource-Constrained Pickup and Delivery Problems," Transportation Science, INFORMS, vol. 53(4), pages 1001-1022, July.
    14. Liang Chen & Wei-Kun Chen & Mu-Ming Yang & Yu-Hong Dai, 2021. "An exact separation algorithm for unsplittable flow capacitated network design arc-set polyhedron," Journal of Global Optimization, Springer, vol. 81(3), pages 659-689, November.
    15. Liu, Run-Ran & Chu, Changchang & Meng, Fanyuan, 2023. "Higher-order interdependent percolation on hypergraphs," Chaos, Solitons & Fractals, Elsevier, vol. 177(C).
    16. Li, Xiangyong & Ding, Yi & Pan, Kai & Jiang, Dapei & Aneja, Y.P., 2020. "Single-path service network design problem with resource constraints," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 140(C).
    17. Meng, Lingyun & Zhou, Xuesong, 2011. "Robust single-track train dispatching model under a dynamic and stochastic environment: A scenario-based rolling horizon solution approach," Transportation Research Part B: Methodological, Elsevier, vol. 45(7), pages 1080-1102, August.
    18. Ashwin Arulselvan & Mohsen Rezapour, 2017. "Exact Approaches for Designing Multifacility Buy-at-Bulk Networks," INFORMS Journal on Computing, INFORMS, vol. 29(4), pages 597-611, November.
    19. Hela Masri & Saoussen Krichen, 2018. "Exact and approximate approaches for the Pareto front generation of the single path multicommodity flow problem," Annals of Operations Research, Springer, vol. 267(1), pages 353-377, August.
    20. Kang, Jangha & Park, Kyungchul & Park, Sungsoo, 2009. "Optimal multicast route packing," European Journal of Operational Research, Elsevier, vol. 196(1), pages 351-359, July.

    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:jomega:v:116:y:2023:i:c:s030504832200202x. 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/wps/find/journaldescription.cws_home/375/description#description .

    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.