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

Robust Optimization of High-Speed Railway Train Plan Based on Multiple Demand Scenarios

Author

Listed:
  • Wenliang Zhou

    (School of Traffic and Transportation Engineering, Central South University, Changsha 410075, China)

  • Jing Kang

    (School of Traffic and Transportation Engineering, Central South University, Changsha 410075, China)

  • Jin Qin

    (School of Traffic and Transportation Engineering, Central South University, Changsha 410075, China)

  • Sha Li

    (School of Traffic and Transportation Engineering, Central South University, Changsha 410075, China)

  • Yu Huang

    (School of Traffic and Transportation Engineering, Central South University, Changsha 410075, China)

Abstract

The optimization of train plans is highly dependent on the space–time distribution of passenger demand in high-speed railway systems. A train plan usually needs to be implemented on multiple operation days, and obviously the amount and space–time distribution of demand over these days has noteworthy differences. To ensure the same train plan is able to be implemented on multiple operation days while effectively satisfying the different levels of demand on those days, a novel robust optimization of a high-speed railway train plan based on multiple demand scenarios is performed in this research. Firstly, the passenger demand of each operation day is described as a demand scenario, and a candidate train set is generated that is able to satisfy the multiple demand scenarios. Then, a regret value corresponding to the total cost, including the train operation cost and passenger travel expense, is proposed to measure the deviation in the costs generated between the robust and the optimal train plan under each demand scenario. Then a robust optimization model for a high-speed railway train plan is constructed to minimize the maximum regret value. Moreover, a simulated annealing algorithm for solving the model is designed by constructing some neighborhood solution search strategies for multiple demand scenarios. Finally, the validity and feasibility of the proposed robust optimization method for train planning are verified on the Shijiazhuang–Jinandong high-speed railway line in China.

Suggested Citation

  • Wenliang Zhou & Jing Kang & Jin Qin & Sha Li & Yu Huang, 2022. "Robust Optimization of High-Speed Railway Train Plan Based on Multiple Demand Scenarios," Mathematics, MDPI, vol. 10(8), pages 1-26, April.
    • Handle: RePEc:gam:jmathe:v:10:y:2022:i:8:p:1278-:d:792109
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/10/8/1278/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/10/8/1278/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Bum Hwan Park & Yong-Il Seo & Sung-Pil Hong & Hag-Lae Rho, 2013. "Column Generation Approach To Line Planning With Various Halting Patterns — Application To The Korean High-Speed Railway," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 30(04), pages 1-19.
    2. Zhou, Li & Yang, Xin & Wang, Huan & Wu, Jianjun & Chen, Lei & Yin, Haodong & Qu, Yunchao, 2020. "A robust train timetable optimization approach for reducing the number of waiting passengers in metro systems," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 558(C).
    3. 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.
    4. T. Assavapokee & M. J. Realff & J. C. Ammons, 2008. "Min-Max Regret Robust Optimization Approach on Interval Data Uncertainty," Journal of Optimization Theory and Applications, Springer, vol. 137(2), pages 297-316, May.
    5. Barrena, Eva & Canca, David & Coelho, Leandro C. & Laporte, Gilbert, 2014. "Single-line rail rapid transit timetabling under dynamic passenger demand," Transportation Research Part B: Methodological, Elsevier, vol. 70(C), pages 134-150.
    6. Claessens, M. T. & van Dijk, N. M. & Zwaneveld, P. J., 1998. "Cost optimal allocation of rail passenger lines," European Journal of Operational Research, Elsevier, vol. 110(3), pages 474-489, November.
    7. Cacchiani, Valentina & Qi, Jianguo & Yang, Lixing, 2020. "Robust optimization models for integrated train stop planning and timetabling with passenger demand uncertainty," Transportation Research Part B: Methodological, Elsevier, vol. 136(C), pages 1-29.
    8. Jiang, Feng & Cacchiani, Valentina & Toth, Paolo, 2017. "Train timetabling by skip-stop planning in highly congested lines," Transportation Research Part B: Methodological, Elsevier, vol. 104(C), pages 149-174.
    9. Fu, Huiling & Nie, Lei & Meng, Lingyun & Sperry, Benjamin R. & He, Zhenhuan, 2015. "A hierarchical line planning approach for a large-scale high speed rail network: The China case," Transportation Research Part A: Policy and Practice, Elsevier, vol. 75(C), pages 61-83.
    10. David E. Bell, 1982. "Regret in Decision Making under Uncertainty," Operations Research, INFORMS, vol. 30(5), pages 961-981, October.
    11. Huanyin Su & Wencong Tao & Xinlei Hu, 2019. "A Line Planning Approach for High-Speed Rail Networks with Time-Dependent Demand and Capacity Constraints," Mathematical Problems in Engineering, Hindawi, vol. 2019, pages 1-18, March.
    12. John M. Mulvey & Robert J. Vanderbei & Stavros A. Zenios, 1995. "Robust Optimization of Large-Scale Systems," Operations Research, INFORMS, vol. 43(2), pages 264-281, April.
    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. Pu, Song & Zhan, Shuguang, 2021. "Two-stage robust railway line-planning approach with passenger demand uncertainty," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 152(C).
    2. Zhang, Yongxiang & Peng, Qiyuan & Lu, Gongyuan & Zhong, Qingwei & Yan, Xu & Zhou, Xuesong, 2022. "Integrated line planning and train timetabling through price-based cross-resolution feedback mechanism," Transportation Research Part B: Methodological, Elsevier, vol. 155(C), pages 240-277.
    3. Xu, Xiaoming & Li, Chung-Lun & Xu, Zhou, 2021. "Train timetabling with stop-skipping, passenger flow, and platform choice considerations," Transportation Research Part B: Methodological, Elsevier, vol. 150(C), pages 52-74.
    4. 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.
    5. Huang, Kang & Wu, Jianjun & Sun, Huijun & Yang, Xin & Gao, Ziyou & Feng, Xujie, 2022. "Timetable synchronization optimization in a subway–bus network," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 608(P1).
    6. Tatsuki Yamauchi & Mizuyo Takamatsu & Shinji Imahori, 2023. "Optimizing train stopping patterns for congestion management," Public Transport, Springer, vol. 15(1), pages 1-29, March.
    7. Wu, Yinghui & Yang, Hai & Zhao, Shuo & Shang, Pan, 2021. "Mitigating unfairness in urban rail transit operation: A mixed-integer linear programming approach," Transportation Research Part B: Methodological, Elsevier, vol. 149(C), pages 418-442.
    8. Zhou, Wenliang & Tian, Junli & Xue, Lijuan & Jiang, Min & Deng, Lianbo & Qin, Jin, 2017. "Multi-periodic train timetabling using a period-type-based Lagrangian relaxation decomposition," Transportation Research Part B: Methodological, Elsevier, vol. 105(C), pages 144-173.
    9. Tian, Xiaopeng & Niu, Huimin, 2020. "Optimization of demand-oriented train timetables under overtaking operations: A surrogate-dual-variable column generation for eliminating indivisibility," Transportation Research Part B: Methodological, Elsevier, vol. 142(C), pages 143-173.
    10. Wenliang Zhou & Yujun Huang & Naijie Chai & Bo Li & Xiang Li, 2022. "A Line Planning Optimization Model for High-Speed Railway Network Merging Newly-Built Railway Lines," Mathematics, MDPI, vol. 10(17), pages 1-34, September.
    11. Jinfei Wu & Xinghua Shan & Jingxia Sun & Shengyuan Weng & Shuo Zhao, 2023. "Daily Line Planning Optimization for High-Speed Railway Lines," Sustainability, MDPI, vol. 15(4), pages 1-20, February.
    12. Canca, David & Barrena, Eva & De-Los-Santos, Alicia & Andrade-Pineda, José Luis, 2016. "Setting lines frequency and capacity in dense railway rapid transit networks with simultaneous passenger assignment," Transportation Research Part B: Methodological, Elsevier, vol. 93(PA), pages 251-267.
    13. Xue, Hongjiao & Jia, Limin & Li, Jian & Guo, Jianyuan, 2022. "Jointly optimized demand-oriented train timetable and passenger flow control strategy for a congested subway line under a short-turning operation pattern," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 593(C).
    14. 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).
    15. Mausser, Helmut E. & Laguna, Manuel, 1999. "A heuristic to minimax absolute regret for linear programs with interval objective function coefficients," European Journal of Operational Research, Elsevier, vol. 117(1), pages 157-174, August.
    16. Henao, Felipe & Rodriguez, Yeny & Viteri, Juan Pablo & Dyner, Isaac, 2019. "Optimising the insertion of renewables in the Colombian power sector," Renewable Energy, Elsevier, vol. 132(C), pages 81-92.
    17. Zhang, Quan & Li, Xuan & Yan, Tao & Lu, Lili & Shi, Yang, 2022. "Last train timetabling optimization for minimizing passenger transfer failures in urban rail transit networks: A time period based approach," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 605(C).
    18. Wenliang Zhou & Mehdi Oldache, 2021. "Integrated Optimization of Line Planning, Timetabling and Rolling Stock Allocation for Urban Railway Lines," Sustainability, MDPI, vol. 13(23), pages 1-32, November.
    19. Kuo, Yong-Hong & Leung, Janny M.Y. & Yan, Yimo, 2023. "Public transport for smart cities: Recent innovations and future challenges," European Journal of Operational Research, Elsevier, vol. 306(3), pages 1001-1026.
    20. Polinder, Gert-Jaap & Schmidt, Marie & Huisman, Dennis, 2021. "Timetabling for strategic passenger railway planning," Transportation Research Part B: Methodological, Elsevier, vol. 146(C), pages 111-135.

    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:10:y:2022:i:8:p:1278-:d:792109. 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.