IDEAS home Printed from https://ideas.repec.org/a/plo/pone00/0351229.html

Research on optimization of train routing problem for railway hubs considering passenger demand

Author

Listed:
  • Yidong Wang

Abstract

The railway hub with multiple stations has been more common with the expansion of the railway network. It is imperative to investigate the utilization of multiple stations to meet the travel demand of urban residents. This paper focuses on railway hubs and abstracts the division of labor among multiple stations as an optimization of train routing problem. A mixed integer linear programming model is constructed to minimize the total cost of trains and passengers, with the number of stops, capacity of railway lines and station tracks, and passenger demand of traffic zones considered as constraints. A case study based on a multi-station railway hub is implemented to evaluate the effectiveness of the optimization model. Compared with the other two scenarios, the total cost of the optimization results is reduced by 0.1% and 2.7%. Meanwhile, the proposed optimization scheme also achieves a more balanced and efficient utilization of railway line and station track capacity. Furthermore, the research also proposes several operationally feasible recommendations for railway department to support making division of labor scheme for railway hubs.

Suggested Citation

  • Yidong Wang, 2026. "Research on optimization of train routing problem for railway hubs considering passenger demand," PLOS ONE, Public Library of Science, vol. 21(6), pages 1-18, June.
    • Handle: RePEc:plo:pone00:0351229
    DOI: 10.1371/journal.pone.0351229
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0351229
    Download Restriction: no
    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0351229&type=printable
    Download Restriction: no
    File URL: https://libkey.io/10.1371/journal.pone.0351229?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
    ---><---

    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:plo:pone00:0351229. 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: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .

    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.