IDEAS home Printed from https://ideas.repec.org/a/taf/tjorxx/v72y2021i8p1707-1725.html
   My bibliography  Save this article

Dynamic passenger demand-oriented train scheduling optimization considering flexible short-turning strategy

Author

Listed:
  • Liya Yang
  • Yu Yao
  • Hua Shi
  • Pan Shang

Abstract

In this study, we focus on improving the efficiency of an urban rail transit line under the circumstance of spatially unbalanced passenger demand. A flexible short-turning strategy is integrated into the train scheduling problem, aiming to obtain a train timetable and the corresponding circulation plan adapted to a time-dependent passenger demand. First, we formulate the dynamic passenger demand-oriented train scheduling problem as a multi-commodity network flow optimization model in a two-layer space-time network. The proposed model is then decomposed into train scheduling and passenger assignment sub-problems by relaxing the coupling constraint. Therefore, an optimal solution of the original model can be obtained by iteratively solving two easy-to-solve sub-problems in a Lagrangian relaxation solution framework. The effectiveness of the model is evaluated using a series of simple experiments and a real-world case study based on the Beijing Yizhuang Line.

Suggested Citation

  • Liya Yang & Yu Yao & Hua Shi & Pan Shang, 2021. "Dynamic passenger demand-oriented train scheduling optimization considering flexible short-turning strategy," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 72(8), pages 1707-1725, August.
    • Handle: RePEc:taf:tjorxx:v:72:y:2021:i:8:p:1707-1725
    DOI: 10.1080/01605682.2020.1806745
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/01605682.2020.1806745
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/01605682.2020.1806745?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. Seda Yanık & Salim Yılmaz, 2023. "Optimal design of a bus route with short-turn services," Public Transport, Springer, vol. 15(1), pages 169-197, March.
    2. Shuo Zhao & Jinfei Wu & Zhenyi Li & Ge Meng, 2022. "Train Operational Plan Optimization for Urban Rail Transit Lines Considering Circulation Balance," Sustainability, MDPI, vol. 14(9), pages 1-21, April.

    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:tjorxx:v:72:y:2021:i:8:p:1707-1725. 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/tjor .

    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.