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

Integrated train routing and timetabling problem in a multi-station high-speed railway hub

Author

Listed:
  • Yidong Wang
  • Rui Song
  • Shiwei He
  • Zilong Song
  • Jushang Chi

Abstract

With multiple stations being built in the high-speed railway hub, how to schedule trains among stations is of great significance. This paper studies the integrated train routing and timetabling problem in a multi-station high-speed railway hub. Based on a specific bi-level network, a binary integer programming model using cumulative flow variables is proposed to minimize the total cost of trains and passengers. An extended Alternating Direction Method of Multipliers (ADMM) algorithm is developed to decompose the model into train and passenger subproblems. The performance of the algorithm is investigated on small-scale and large-scale networks. Compared with the commonly used Lagrangian Relaxation (LR) algorithm, the results indicate that the extended ADMM obtain better solutions with less iterations, where the lower bound decreases by 3.79% and iterations are reduced by 83.54%. Another comparative experiment shows the total cost of the optimization scheme is 16.22% lower than that of the current fixed scheme.

Suggested Citation

  • Yidong Wang & Rui Song & Shiwei He & Zilong Song & Jushang Chi, 2023. "Integrated train routing and timetabling problem in a multi-station high-speed railway hub," International Journal of Rail Transportation, Taylor & Francis Journals, vol. 11(4), pages 598-637, July.
    • Handle: RePEc:taf:tjrtxx:v:11:y:2023:i:4:p:598-637
    DOI: 10.1080/23248378.2022.2093280
    as

    Download full text from publisher

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

    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:11:y:2023:i:4:p:598-637. 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.