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

Conflict resolving – A local search algorithm for solving large scale conflict graphs in freight railway timetabling

Author

Listed:
  • Reisch, Julian
  • Großmann, Peter
  • Pöhle, Daniel
  • Kliewer, Natalia

Abstract

We consider the problem of planning the annual timetable for all freight trains in Germany simultaneously. That is, for each train, construct a slot through the network such that no two slots of different trains have a conflict. We denote this task by the Train Path Assignment Problem (TPAP) and present a column generation approach where iteratively, the set of possible slots grows. In each iteration, we look for a maximum subset without any conflicts. Modelling the slots as vertices joint by an edge if they have a conflict, this problem is the Maximum Independent Set problem (MIS). Due to the many slots that are constructed, hence variables that are generated, we deal with large scale MIS instances. Therefore, the MIS is solved heuristically with a local search algorithm called Conflict Resolving (CR) that is tailored to the specially structured instances from the application. CR iteratively perturbs the current solution in order to leave local optima and then repeatedly improves the solution by replacing k−1 solution vertices by k non-solution vertices. These steps are embedded in a simulated annealing framework. In this paper, we present the column generation approach and numerically compare three MIS solution methods, CR, a MIP solver and Iterated Local Search (ILS), a state-of-the-art MIS heuristics. It turns out that CR performs best for the instances from real-world timetabling, and is also comparable to the ILS on MIS benchmark instances. With this approach, we can solve the TPAP for more than 5000 freight trains.

Suggested Citation

  • Reisch, Julian & Großmann, Peter & Pöhle, Daniel & Kliewer, Natalia, 2021. "Conflict resolving – A local search algorithm for solving large scale conflict graphs in freight railway timetabling," European Journal of Operational Research, Elsevier, vol. 293(3), pages 1143-1154.
  • Handle: RePEc:eee:ejores:v:293:y:2021:i:3:p:1143-1154
    DOI: 10.1016/j.ejor.2021.01.006
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221721000084
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.ejor.2021.01.006?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. Peter J. Zwaneveld & Leo G. Kroon & H. Edwin Romeijn & Marc Salomon & Stéphane Dauzère-Pérès & Stan P. M. Van Hoesel & Harrie W. Ambergen, 1996. "Routing Trains Through Railway Stations: Model Formulation and Algorithms," Transportation Science, INFORMS, vol. 30(3), pages 181-194, August.
    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. Alberto Caprara & Matteo Fischetti & Paolo Toth, 2002. "Modeling and Solving the Train Timetabling Problem," Operations Research, INFORMS, vol. 50(5), pages 851-861, October.
    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. Taslimi, Bijan & Babaie Sarijaloo, Farnaz & Liu, Hongcheng & Pardalos, Panos M., 2022. "A novel mixed integer programming model for freight train travel time estimation," European Journal of Operational Research, Elsevier, vol. 300(2), pages 676-688.

    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. Wang, Dian & D’Ariano, Andrea & Zhao, Jun & Zhong, Qingwei & Peng, Qiyuan, 2022. "Integrated rolling stock deadhead routing and timetabling in urban rail transit lines," European Journal of Operational Research, Elsevier, vol. 298(2), pages 526-559.
    2. Wang, Dian & D’Ariano, Andrea & Zhao, Jun & Zhan, Shuguang & Peng, Qiyuan, 2024. "Joint rolling stock rotation planning and depot deadhead scheduling in complicated urban rail transit lines," European Journal of Operational Research, Elsevier, vol. 314(2), pages 665-684.
    3. Aliakbari, Mina & Geunes, Joseph & Ghahari, Amir & Prince, Mike, 2024. "Freight railcar-to-train assignment and departure scheduling in a railyard," European Journal of Operational Research, Elsevier, vol. 314(3), pages 950-962.
    4. Mina Aliakbari & Joseph Geunes, 2022. "Multiple Train Repositioning Operations in a Railyard Network," SN Operations Research Forum, Springer, vol. 3(4), pages 1-31, December.
    5. Zhang, Qin & Lusby, Richard Martin & Shang, Pan & Zhu, Xiaoning, 2022. "A heuristic approach to integrate train timetabling, platforming, and railway network maintenance scheduling decisions," Transportation Research Part B: Methodological, Elsevier, vol. 158(C), pages 210-238.
    6. Han Zheng & Junhua Chen & Zhaocha Huang & Jianhao Zhu, 2022. "Joint Optimization of Multi-Cycle Timetable Considering Supply-to-Demand Relationship and Energy Consumption for Rail Express," Mathematics, MDPI, vol. 10(21), pages 1-29, November.
    7. 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.
    8. 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.
    9. Mo, Pengli & D’Ariano, Andrea & Yang, Lixing & Veelenturf, Lucas P. & Gao, Ziyou, 2021. "An exact method for the integrated optimization of subway lines operation strategies with asymmetric passenger demand and operating costs," Transportation Research Part B: Methodological, Elsevier, vol. 149(C), pages 283-321.
    10. Carlo Mannino & Alessandro Mascis, 2009. "Optimal Real-Time Traffic Control in Metro Stations," Operations Research, INFORMS, vol. 57(4), pages 1026-1039, August.
    11. Zhan, Shuguang & Wong, S.C. & Shang, Pan & Peng, Qiyuan & Xie, Jiemin & Lo, S.M., 2021. "Integrated railway timetable rescheduling and dynamic passenger routing during a complete blockage," Transportation Research Part B: Methodological, Elsevier, vol. 143(C), pages 86-123.
    12. Steven Harrod, 2011. "Modeling Network Transition Constraints with Hypergraphs," Transportation Science, INFORMS, vol. 45(1), pages 81-97, February.
    13. Zhang, Chuntian & Gao, Yuan & Cacchiani, Valentina & Yang, Lixing & Gao, Ziyou, 2023. "Train rescheduling for large-scale disruptions in a large-scale railway network," Transportation Research Part B: Methodological, Elsevier, vol. 174(C).
    14. Martin-Iradi, Bernardo & Ropke, Stefan, 2022. "A column-generation-based matheuristic for periodic and symmetric train timetabling with integrated passenger routing," European Journal of Operational Research, Elsevier, vol. 297(2), pages 511-531.
    15. Cacchiani, Valentina & Qi, Jianguo & Yang, Lixing, 2020. "Robust optimization models for integrated train stop planning and timetabling with passenger demand uncertainty," Transportation Research Part B: Methodological, Elsevier, vol. 136(C), pages 1-29.
    16. Ralf Borndörfer & Berkan Erol & Thomas Graffagnino & Thomas Schlechte & Elmar Swarat, 2014. "Optimizing the Simplon railway corridor," Annals of Operations Research, Springer, vol. 218(1), pages 93-106, July.
    17. Pellegrini, Paola & Rodriguez, Joaquin, 2013. "Single European Sky and Single European Railway Area: A system level analysis of air and rail transportation," Transportation Research Part A: Policy and Practice, Elsevier, vol. 57(C), pages 64-86.
    18. Yidong Wang & Rui Song & Shiwei He & Zilong Song, 2022. "Train Routing and Track Allocation Optimization Model of Multi-Station High-Speed Railway Hub," Sustainability, MDPI, vol. 14(12), pages 1-21, June.
    19. de Lima, Vinícius L. & Alves, Cláudio & Clautiaux, François & Iori, Manuel & Valério de Carvalho, José M., 2022. "Arc flow formulations based on dynamic programming: Theoretical foundations and applications," European Journal of Operational Research, Elsevier, vol. 296(1), pages 3-21.
    20. Li, Jiajie & Bai, Yun & Chen, Yao & Yang, Lingling & Wang, Qian, 2022. "A two-stage stochastic optimization model for integrated tram timetable and speed control with uncertain dwell times," Energy, Elsevier, vol. 260(C).

    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:293:y:2021:i:3:p:1143-1154. 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.