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

A Line Planning Optimization Model for High-Speed Railway Network Merging Newly-Built Railway Lines

Author

Listed:
  • Wenliang Zhou

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

  • Yujun Huang

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

  • Naijie Chai

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

  • Bo Li

    (Transportation & Economics Research Institute, China Academy of Railway Sciences Corporation Limited, Beijing 100081, China)

  • Xiang Li

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

Abstract

This paper is devoted to developing a line-planning approach for high-speed railway networks merging newly built railway lines, which result in the change of the network’s original structure and some passengers’ travel routes. In order to exactly describe the choice of time-varying passengers and the operation of the trains, a passenger travel network with time information is constructed based on the pre-generated candidate train set. Following this, a line-planning optimization model for optimizing trains on both the existing railway network and the merged new railway line is established under the considered constraints, such as transportation resources on the network. It does not aim to only provide higher service level for passengers and increase revenue of railway enterprise, but also to ensure the continuity of the existing trains to facilitates passengers and train organization. A framework of the Simulated Annealing Algorithm is designed to solve the proposed model by combining the neighboring solution search strategies with evaluation method based on the allocation of passengers. The case of a partial high-speed railway network in China is studied to test the practicability and validity of the proposed approach.

Suggested Citation

  • 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.
    • Handle: RePEc:gam:jmathe:v:10:y:2022:i:17:p:3174-:d:905765
    as

    Download full text from publisher

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

    References listed on IDEAS

    as
    1. Szeto, W.Y. & Jiang, Y., 2014. "Transit route and frequency design: Bi-level modeling and hybrid artificial bee colony algorithm approach," Transportation Research Part B: Methodological, Elsevier, vol. 67(C), pages 235-263.
    2. Bussieck, Michael R. & Kreuzer, Peter & Zimmermann, Uwe T., 1997. "Optimal lines for railway systems," European Journal of Operational Research, Elsevier, vol. 96(1), pages 54-63, January.
    3. Goossens, Jan-Willem & van Hoesel, Stan & Kroon, Leo, 2006. "On solving multi-type railway line planning problems," European Journal of Operational Research, Elsevier, vol. 168(2), pages 403-424, January.
    4. Chang, Yu-Hern & Yeh, Chung-Hsing & Shen, Ching-Cheng, 2000. "A multiobjective model for passenger train services planning: application to Taiwan's high-speed rail line," Transportation Research Part B: Methodological, Elsevier, vol. 34(2), pages 91-106, February.
    5. Ralf Borndörfer & Martin Grötschel & Marc E. Pfetsch, 2007. "A Column-Generation Approach to Line Planning in Public Transport," Transportation Science, INFORMS, vol. 41(1), pages 123-132, February.
    6. Michael R. Bussieck & Thomas Lindner & Marco E. Lübbecke, 2004. "A fast algorithm for near cost optimal line plans," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 59(2), pages 205-220, June.
    7. Jan-Willem Goossens & Stan van Hoesel & Leo Kroon, 2004. "A Branch-and-Cut Approach for Solving Railway Line-Planning Problems," Transportation Science, INFORMS, vol. 38(3), pages 379-393, August.
    8. 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.
    9. Ghoseiri, Keivan & Szidarovszky, Ferenc & Asgharpour, Mohammad Jawad, 2004. "A multi-objective train scheduling model and solution," Transportation Research Part B: Methodological, Elsevier, vol. 38(10), pages 927-952, December.
    10. 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.
    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. Zhou, Xuesong & Zhong, Ming, 2005. "Bicriteria train scheduling for high-speed passenger railroad planning applications," European Journal of Operational Research, Elsevier, vol. 167(3), pages 752-771, December.
    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. 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.

    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. 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.
    2. 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.
    3. Hamid, Faiz & Agarwal, Yogesh K., 2024. "Train stop scheduling problem: An exact approach using valid inequalities and polar duality," European Journal of Operational Research, Elsevier, vol. 313(1), pages 207-224.
    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. Masing, Berenike & Lindner, Niels & Borndörfer, Ralf, 2022. "The price of symmetric line plans in the Parametric City," Transportation Research Part B: Methodological, Elsevier, vol. 166(C), pages 419-443.
    6. Schiewe, Alexander & Schiewe, Philine & Schmidt, Marie, 2019. "The line planning routing game," European Journal of Operational Research, Elsevier, vol. 274(2), pages 560-573.
    7. Wenliang Zhou & Xiang Li & Xin Shi, 2023. "Joint Optimization of Time-Dependent Line Planning and Differential Pricing with Passenger Train Choice in High-Speed Railway Networks," Mathematics, MDPI, vol. 11(6), pages 1-28, March.
    8. 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.
    9. Goerigk, Marc & Schmidt, Marie, 2017. "Line planning with user-optimal route choice," European Journal of Operational Research, Elsevier, vol. 259(2), pages 424-436.
    10. Guan, J.F. & Yang, Hai & Wirasinghe, S.C., 2006. "Simultaneous optimization of transit line configuration and passenger line assignment," Transportation Research Part B: Methodological, Elsevier, vol. 40(10), pages 885-902, December.
    11. 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).
    12. Canca, David & Andrade-Pineda, José Luis & De los Santos, Alicia & Calle, Marcos, 2018. "The Railway Rapid Transit frequency setting problem with speed-dependent operation costs," Transportation Research Part B: Methodological, Elsevier, vol. 117(PA), pages 494-519.
    13. Tatsuki Yamauchi & Mizuyo Takamatsu & Shinji Imahori, 2023. "Optimizing train stopping patterns for congestion management," Public Transport, Springer, vol. 15(1), pages 1-29, March.
    14. 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.
    15. Gattermann, P. & Schiewe, A. & Schmidt, M.E., 2014. "The line planning routing game," ERIM Report Series Research in Management ERS-2014-017-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    16. Mathias Michaelis & Anita Schöbel, 2009. "Integrating line planning, timetabling, and vehicle scheduling: a customer-oriented heuristic," Public Transport, Springer, vol. 1(3), pages 211-232, August.
    17. Xin Zhang & Lei Nie & Xin Wu & Yu Ke, 2020. "How to Optimize Train Stops under Diverse Passenger Demand: a New Line Planning Method for Large-Scale High-Speed Rail Networks," Networks and Spatial Economics, Springer, vol. 20(4), pages 963-988, December.
    18. Shuo Zhao & Xiwei Mi & Zhenyi Li, 2019. "A Stop-Probability Approach for O-D Service Frequency on High-Speed Railway Lines," Sustainability, MDPI, vol. 11(24), pages 1-21, December.
    19. Feng, Tao & Lusby, Richard M. & Zhang, Yongxiang & Peng, Qiyuan, 2024. "Integrating train service route design with passenger flow allocation for an urban rail transit line," European Journal of Operational Research, Elsevier, vol. 313(1), pages 146-170.
    20. Repolho, Hugo M. & Church, Richard L. & Antunes, António P., 2016. "Optimizing station location and fleet composition for a high-speed rail line," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 93(C), pages 437-452.

    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:17:p:3174-:d:905765. 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.