IDEAS home Printed from https://ideas.repec.org/a/taf/tjrtxx/v10y2022i5p562-580.html
   My bibliography  Save this article

Simultaneous schedule of trains and track maintenance according to stochastic blockage time

Author

Listed:
  • Mostafa Bababeik
  • Mohammad Farjadamin
  • Navid Khademi
  • Amir-Hossein Fani

Abstract

Regarding the railway infrastructures, planning for track maintenance is a challenging task given the coordination required between train traffic and maintenance operations. In this paper, using stochastic mathematical programming, we have investigated the simultaneous scheduling of trains and operations for a single-track line to minimise both the travel time of trains and maintenance duration. The uncertainty in the blockage duration of the track is considered in the model to reduce the impact of unexpected delays in maintenance operations. The proposed model also considers the practical aspects, which have been less addressed in previous studies regarding track maintenance. We reformulated the stochastic problem as its deterministic equivalent to facilitate solutions for realistic sizes. The computational result obtained for a real-world track shows that the model can efficiently find simultaneous scheduling of trains and operations and suggest optimal blockage duration at different confidence levels. The impact of timetable comparison on the blockage duration for a heavily utilised line has also been evaluated.

Suggested Citation

  • Mostafa Bababeik & Mohammad Farjadamin & Navid Khademi & Amir-Hossein Fani, 2022. "Simultaneous schedule of trains and track maintenance according to stochastic blockage time," International Journal of Rail Transportation, Taylor & Francis Journals, vol. 10(5), pages 562-580, September.
    • Handle: RePEc:taf:tjrtxx:v:10:y:2022:i:5:p:562-580
    DOI: 10.1080/23248378.2021.1978884
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/23248378.2021.1978884
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/23248378.2021.1978884?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.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Ji, Hangyu & Wang, Rui & Zhang, Chuntian & Yin, Jiateng & Ma, Lin & Yang, Lixing, 2024. "Optimization of train schedule with uncertain maintenance plans in high-speed railways: A stochastic programming approach," Omega, Elsevier, vol. 124(C).

    More about this item

    Statistics

    Access and download statistics

    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:taf:tjrtxx:v:10:y:2022:i:5:p:562-580. 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.

    We have no bibliographic references for this item. You can help adding them by using 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 Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/tjrt20 .

    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.