IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/7706556.html
   My bibliography  Save this article

A Genetic Simulated Annealing Algorithm for Real-Time Track Reallocation in Busy Complex Railway Station

Author

Listed:
  • Qiongfang Zeng
  • Ruihua Hu
  • Yinggui Zhang
  • Huanyin Su
  • Ya Liu
  • J. Santos Reyes

Abstract

Track failure at a railway station is a common disruption in the station area caused by abnormal weather or frequent use. This paper focuses on the real-time track reallocation problem to recover the affected track utilization plan and minimize the total train delays and passenger inconveniences. Train platforming operations in busy complex passenger stations are generally conducted according to fixed track utilization rules. In this paper, we presented a mixed-integer linear programming model for train platforming problems with constraints relevant to fixed track utilization rule and objectives of balanced usage of tracks. Furthermore, we proposed an improved genetic simulated annealing algorithm based on improved crossover and selection methods without breaking the fixed track utilization rule constraint. An experiment of Guanzhou East Station with fixed track utilization rules shows the effectiveness of the proposed model and algorithm. The model and algorithm provide efficient approaches for track reallocation problems based on fixed track utilization rules in busy complex passenger stations.

Suggested Citation

  • Qiongfang Zeng & Ruihua Hu & Yinggui Zhang & Huanyin Su & Ya Liu & J. Santos Reyes, 2022. "A Genetic Simulated Annealing Algorithm for Real-Time Track Reallocation in Busy Complex Railway Station," Mathematical Problems in Engineering, Hindawi, vol. 2022, pages 1-13, August.
  • Handle: RePEc:hin:jnlmpe:7706556
    DOI: 10.1155/2022/7706556
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/mpe/2022/7706556.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/mpe/2022/7706556.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2022/7706556?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
    ---><---

    Citations

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


    Cited by:

    1. Yinggui Zhang & Ruihua Hu & Qiongfang Zeng & Yuhang Wang & Ya Liu & Shan Huang, 2023. "Optimal Train Platforming with Shunting Operations for Multidirectional Passenger Stations: A Case Study of Guangzhou Station," Mathematics, MDPI, vol. 11(14), pages 1-19, July.

    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:hin:jnlmpe:7706556. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    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.