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

Modeling and Heuristically Solving Group Train Operation Scheduling for Heavy-Haul Railway Transportation

Author

Listed:
  • 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)

  • 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)

  • Lu Zhang

    (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

In light of the improvements to the capacity and timeliness of heavy-haul railway transportation that can be organized through group trains originating at a technical station, we address a group train operation scheduling problem with freight demand importance via a newly proposed mixed integer programming model and a simulated annealing algorithm. The optimization objective of the mixed integer programming model is to minimize the weighted sum of the transportation cost and the total cargo travel time under the condition of matching freight supply and demand within the optimization period. The main constraints are extracted from the supply and demand relations, the cargo delivery time commitment, the maintenance time, and the number of locomotives. A simulated annealing algorithm was constructed to generate the grouping scheme, the stopping scheme and the running schedule of group trains. A numerical experiment based on a real heavy-haul railway configuration was employed to verify the efficacy of the proposed model and heuristics algorithm. The results show that the proposed methodology can achieve high-quality solutions. The case results reveal that the freight volume increased by 2.03%, the departure cost decreased by CNY 337,000, the transportation cost which results from the difference in the supply and demand matching increased by CNY 27,764, and the total cargo travel time decreased by 40.9%, indicating that group train operation can create benefits for both railway enterprises and customers.

Suggested Citation

  • Weiya Chen & Qinyu Zhuo & Lu Zhang, 2023. "Modeling and Heuristically Solving Group Train Operation Scheduling for Heavy-Haul Railway Transportation," Mathematics, MDPI, vol. 11(11), pages 1-15, May.
    • Handle: RePEc:gam:jmathe:v:11:y:2023:i:11:p:2489-:d:1158086
    as

    Download full text from publisher

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

    References listed on IDEAS

    as
    1. Pan, Hanchuan & Yang, Lixing & Liang, Zhe, 2023. "Demand-oriented integration optimization of train timetabling and rolling stock circulation planning with flexible train compositions: A column-generation-based approach," European Journal of Operational Research, Elsevier, vol. 305(1), pages 184-206.
    2. Samà, Marcella & Pellegrini, Paola & D’Ariano, Andrea & Rodriguez, Joaquin & Pacciarelli, Dario, 2016. "Ant colony optimization for the real-time train routing selection problem," Transportation Research Part B: Methodological, Elsevier, vol. 85(C), pages 89-108.
    3. Xiao, Jie & Pachl, Joern & Lin, Boliang & Wang, Jiaxi, 2018. "Solving the block-to-train assignment problem using the heuristic approach based on the genetic algorithm and tabu search," Transportation Research Part B: Methodological, Elsevier, vol. 108(C), pages 148-171.
    4. Taslimi, Bijan & Babaie Sarijaloo, Farnaz & Liu, Hongcheng & Pardalos, Panos M., 2022. "A novel mixed integer programming model for freight train travel time estimation," European Journal of Operational Research, Elsevier, vol. 300(2), pages 676-688.
    5. Meng, Lingyun & Zhou, Xuesong, 2019. "An integrated train service plan optimization model with variable demand: A team-based scheduling approach with dual cost information in a layered network," Transportation Research Part B: Methodological, Elsevier, vol. 125(C), pages 1-28.
    6. Schwerdfeger, Stefan & Otto, Alena & Boysen, Nils, 2021. "Rail platooning: Scheduling trains along a rail corridor with rapid-shunting facilities," European Journal of Operational Research, Elsevier, vol. 294(2), pages 760-778.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Tian, Ai-Qing & Wang, Xiao-Yang & Xu, Heying & Pan, Jeng-Shyang & Snášel, Václav & Lv, Hong-Xia, 2024. "Multi-objective optimization model for railway heavy-haul traffic: Addressing carbon emissions reduction and transport efficiency improvement," Energy, Elsevier, vol. 294(C).
    2. Igor Kabashkin, 2023. "Model of Multi Criteria Decision-Making for Selection of Transportation Alternatives on the Base of Transport Needs Hierarchy Framework and Application of Petri Net," Sustainability, MDPI, vol. 15(16), pages 1-26, August.

    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. Chai, Simin & Yin, Jiateng & D’Ariano, Andrea & Liu, Ronghui & Yang, Lixing & Tang, Tao, 2024. "A branch-and-cut algorithm for scheduling train platoons in urban rail networks," Transportation Research Part B: Methodological, Elsevier, vol. 181(C).
    2. Zhang, Yongxiang & D'Ariano, Andrea & He, Bisheng & Peng, Qiyuan, 2019. "Microscopic optimization model and algorithm for integrating train timetabling and track maintenance task scheduling," Transportation Research Part B: Methodological, Elsevier, vol. 127(C), pages 237-278.
    3. Liu, Baoli & Li, Zhi-Chun & Sheng, Dian & Wang, Yadong, 2021. "Integrated planning of berth allocation and vessel sequencing in a seaport with one-way navigation channel," Transportation Research Part B: Methodological, Elsevier, vol. 143(C), pages 23-47.
    4. M. Shakibayifar & A. Sheikholeslami & F. Corman & E. Hassannayebi, 2020. "An integrated rescheduling model for minimizing train delays in the case of line blockage," Operational Research, Springer, vol. 20(1), pages 59-87, March.
    5. Wenxing Wu & Jing Xun & Jiateng Yin & Shibo He & Haifeng Song & Zicong Zhao & Shicong Hao, 2023. "An Integrated Method for Reducing Arrival Interval by Optimizing Train Operation and Route Setting," Mathematics, MDPI, vol. 11(20), pages 1-20, October.
    6. Zhang, Yongxiang & Peng, Qiyuan & Yao, Yu & Zhang, Xin & Zhou, Xuesong, 2019. "Solving cyclic train timetabling problem through model reformulation: Extended time-space network construct and Alternating Direction Method of Multipliers methods," Transportation Research Part B: Methodological, Elsevier, vol. 128(C), pages 344-379.
    7. Ruf, Moritz & Cordeau, Jean-François, 2021. "Adaptive large neighborhood search for integrated planning in railroad classification yards," Transportation Research Part B: Methodological, Elsevier, vol. 150(C), pages 26-51.
    8. Chen, Chongshuang & Dollevoet, Twan & Zhao, Jun, 2018. "One-block train formation in large-scale railway networks: An exact model and a tree-based decomposition algorithm," Transportation Research Part B: Methodological, Elsevier, vol. 118(C), pages 1-30.
    9. Pellegrini, Paola & Pesenti, Raffaele & Rodriguez, Joaquin, 2019. "Efficient train re-routing and rescheduling: Valid inequalities and reformulation of RECIFE-MILP," Transportation Research Part B: Methodological, Elsevier, vol. 120(C), pages 33-48.
    10. Li, Siqiao & Zhu, Xiaoning & Shang, Pan & Li, Tianqi & Liu, Wenqian, 2023. "Optimizing a shared freight and passenger high-speed railway system: A multi-commodity flow formulation with Benders decomposition solution approach," Transportation Research Part B: Methodological, Elsevier, vol. 172(C), pages 1-31.
    11. Xiaoming Xu & Keping Li & Lixing Yang & Ziyou Gao, 2019. "An efficient train scheduling algorithm on a single-track railway system," Journal of Scheduling, Springer, vol. 22(1), pages 85-105, February.
    12. Chen, Zhiwei & Li, Xiaopeng, 2021. "Designing corridor systems with modular autonomous vehicles enabling station-wise docking: Discrete modeling method," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 152(C).
    13. Van Thielen, Sofie & Corman, Francesco & Vansteenwegen, Pieter, 2018. "Considering a dynamic impact zone for real-time railway traffic management," Transportation Research Part B: Methodological, Elsevier, vol. 111(C), pages 39-59.
    14. Xiao, Jie & Pachl, Joern & Lin, Boliang & Wang, Jiaxi, 2018. "Solving the block-to-train assignment problem using the heuristic approach based on the genetic algorithm and tabu search," Transportation Research Part B: Methodological, Elsevier, vol. 108(C), pages 148-171.
    15. Wang, Yihui & Tang, Tao & Ning, Bin & Meng, Lingyun, 2017. "Integrated optimization of regular train schedule and train circulation plan for urban rail transit lines," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 105(C), pages 83-104.
    16. Yan, Fei & Goverde, Rob M.P., 2019. "Combined line planning and train timetabling for strongly heterogeneous railway lines with direct connections," Transportation Research Part B: Methodological, Elsevier, vol. 127(C), pages 20-46.
    17. Zhan, Shuguang & Xie, Jiemin & Wong, S.C. & Zhu, Yongqiu & Corman, Francesco, 2024. "Handling uncertainty in train timetable rescheduling: A review of the literature and future research directions," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 183(C).
    18. Chen, Zebin & Li, Shukai & D’Ariano, Andrea & Yang, Lixing, 2022. "Real-time optimization for train regulation and stop-skipping adjustment strategy of urban rail transit lines," Omega, Elsevier, vol. 110(C).
    19. Xu, Peijuan & Corman, Francesco & Peng, Qiyuan & Luan, Xiaojie, 2017. "A train rescheduling model integrating speed management during disruptions of high-speed traffic under a quasi-moving block system," Transportation Research Part B: Methodological, Elsevier, vol. 104(C), pages 638-666.
    20. Boliang Lin & Jingsong Duan & Jiaxi Wang & Min Sun & Wengao Peng & Chang Liu & Jie Xiao & Siqi Liu & Jianping Wu, 2018. "A study of the car-to-train assignment problem for rail express cargos in the scheduled and unscheduled train services network," PLOS ONE, Public Library of Science, vol. 13(10), pages 1-18, October.

    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:11:p:2489-:d:1158086. 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.