IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v11y2023i23p4712-d1284515.html
   My bibliography  Save this article

Optimizing Mixed Group Train Operation for Heavy-Haul Railway Transportation: A Case Study in China

Author

Listed:
  • Qinyu Zhuo

    (School of Traffic and Transportation Engineering, Central South University, Changsha 410075, China
    Rail Data Research and Application Key Laboratory of Hunan Province, Changsha 410075, China)

  • Weiya Chen

    (School of Traffic and Transportation Engineering, Central South University, Changsha 410075, China
    Rail Data Research and Application Key Laboratory of Hunan Province, Changsha 410075, China)

  • Ziyue Yuan

    (School of Traffic and Transportation Engineering, Central South University, Changsha 410075, China
    Rail Data Research and Application Key Laboratory of Hunan Province, Changsha 410075, China)

Abstract

Group train operation (GTO) applications have reduced the tracking intervals for overloaded trains, and can affect the efficiency of rail transport. In this paper, we first analyze the differences between GTO and traditional operation (TO). A new mathematical model and simulated annealing algorithm are then used to study the problem of mixed group train operation. The optimization objective of this model is to maximize the transportation volume of special heavy-haul railway lines within the optimization period. The main constraint conditions are extracted from the maintenance time, the minimum ratio of freight volume, and the committed arrival time at each station. A simulated annealing algorithm is constructed to generate the mixed GTO plan. Through numerical experiments conducted on actual heavy-haul railway structures, we validate the effectiveness of the proposed model and meta-heuristic algorithm. The results of the first contrastive experiment show that the freight volume for group trains is 37.5% higher than that of traditional trains, and the second experiment shows a 30.6% reduction in the time during which the line is occupied by trains in GTO. These findings provide compelling evidence that GTO can effectively enhance the capacity and reduce the transportation time cost of special heavy-haul railway lines.

Suggested Citation

  • Qinyu Zhuo & Weiya Chen & Ziyue Yuan, 2023. "Optimizing Mixed Group Train Operation for Heavy-Haul Railway Transportation: A Case Study in China," Mathematics, MDPI, vol. 11(23), pages 1-16, November.
    • Handle: RePEc:gam:jmathe:v:11:y:2023:i:23:p:4712-:d:1284515
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/11/23/4712/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/11/23/4712/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Sara Ceschia & Rosita Guido & Andrea Schaerf, 2020. "Solving the static INRC-II nurse rostering problem by simulated annealing based on large neighborhoods," Annals of Operations Research, Springer, vol. 288(1), pages 95-113, May.
    2. Wang, Dian & Zhao, Jun & Peng, Qiyuan, 2022. "Optimizing the loaded train combination problem at a heavy-haul marshalling station," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 162(C).
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Turhan, Aykut Melih & Bilgen, Bilge, 2022. "A mat-heuristic based solution approach for an extended nurse rostering problem with skills and units," Socio-Economic Planning Sciences, Elsevier, vol. 82(PB).

    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:gam:jmathe:v:11:y:2023:i:23:p:4712-:d:1284515. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.