IDEAS home Printed from https://ideas.repec.org/a/gam/jsusta/v14y2022i4p2365-d753129.html
   My bibliography  Save this article

Train Operations Organization in High-Speed Railway Station Considering Variable Configuration

Author

Listed:
  • Jingliu Xu

    (Traffic and Transportation School, Beijing Jiaotong University, Beijing 100044, China)

  • Zhimei Wang

    (Traffic and Transportation School, Beijing Jiaotong University, Beijing 100044, China)

  • Shangjun Yao

    (Traffic and Transportation School, Beijing Jiaotong University, Beijing 100044, China)

  • Jiarong Xue

    (Traffic and Transportation School, Beijing Jiaotong University, Beijing 100044, China)

Abstract

The train operation problem at the railway station is one of the basic scheduling problems for railway companies, and the decomposition and combination of trains in station platform tracks is an important trend in the railway operation, which further increase the complexity of train routing problem in the high-speed railway station. A reasonable train routing plan is critical for ensuring the safety and efficiency of train operations within the stations. Considering the combination and decomposition process of trains at the station, a multi-objective model is constructed, which determines the receiving routes and departure routes of trains at the railway station with the limited infrastructure capacity, given the station yard layouts, train diagram and relevant technical operation time of the station. A solution framework based on the “constraint method” is designed, and software Gurobi is used to solve the problem. The Pareto optimal solution set is obtained. The results show that when making 1.9% concessions to the minimum route cost, the occupancy balance of platform tracks can be improved by 66.2%, which is taken as the comprehensive application scheme. Compared with the feasible scheme, the comprehensive operation scheme reduces the route cost by 1.9% and improves the occupation balance of platform tracks by 15.4%.

Suggested Citation

  • Jingliu Xu & Zhimei Wang & Shangjun Yao & Jiarong Xue, 2022. "Train Operations Organization in High-Speed Railway Station Considering Variable Configuration," Sustainability, MDPI, vol. 14(4), pages 1-17, February.
    • Handle: RePEc:gam:jsusta:v:14:y:2022:i:4:p:2365-:d:753129
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2071-1050/14/4/2365/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2071-1050/14/4/2365/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Carey, Malachy & Crawford, Ivan, 2007. "Scheduling trains on a network of busy complex stations," Transportation Research Part B: Methodological, Elsevier, vol. 41(2), pages 159-178, February.
    2. Wei Liu & Xiaoning Zhu & Liujiang Kang, 2015. "Real-Time Track Reallocation for Emergency Incidents at Large Railway Stations," Mathematical Problems in Engineering, Hindawi, vol. 2015, pages 1-11, November.
    3. Kroon, Leo G. & Edwin Romeijn, H. & Zwaneveld, Peter J., 1997. "Routing trains through railway stations: complexity issues," European Journal of Operational Research, Elsevier, vol. 98(3), pages 485-498, May.
    4. Corman, Francesco & D'Ariano, Andrea & Pacciarelli, Dario & Pranzo, Marco, 2010. "A tabu search algorithm for rerouting trains during rail operations," Transportation Research Part B: Methodological, Elsevier, vol. 44(1), pages 175-192, January.
    5. Zwaneveld, Peter J. & Kroon, Leo G. & van Hoesel, Stan P. M., 2001. "Routing trains through a railway station based on a node packing model," European Journal of Operational Research, Elsevier, vol. 128(1), pages 14-33, January.
    6. Zwaneveld, P.J. & Kroon, L.G. & van Hoesel, C.P.M., 1997. "Routing trains through a railway station based on a Node Packing model," Research Memorandum 030, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
    7. Carey, Malachy & Carville, Sinead, 2003. "Scheduling and platforming trains at busy complex stations," Transportation Research Part A: Policy and Practice, Elsevier, vol. 37(3), pages 195-224, March.
    8. Peter J. Zwaneveld & Leo G. Kroon & H. Edwin Romeijn & Marc Salomon & Stéphane Dauzère-Pérès & Stan P. M. Van Hoesel & Harrie W. Ambergen, 1996. "Routing Trains Through Railway Stations: Model Formulation and Algorithms," Transportation Science, INFORMS, vol. 30(3), pages 181-194, August.
    9. Chakroborty, Partha & Vikram, Durgesh, 2008. "Optimum assignment of trains to platforms under partial schedule compliance," Transportation Research Part B: Methodological, Elsevier, vol. 42(2), pages 169-184, February.
    10. Richard Lusby & Jesper Larsen & David Ryan & Matthias Ehrgott, 2011. "Routing Trains Through Railway Junctions: A New Set-Packing Approach," Transportation Science, INFORMS, vol. 45(2), pages 228-245, May.
    11. Alain Billionnet, 2003. "Using Integer Programming to Solve the Train-Platforming Problem," Transportation Science, INFORMS, vol. 37(2), pages 213-222, May.
    12. Alberto Caprara & Laura Galli & Paolo Toth, 2011. "Solution of the Train Platforming Problem," Transportation Science, INFORMS, vol. 45(2), pages 246-257, May.
    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. Lu, Gongyuan & Ning, Jia & Liu, Xiaobo & Nie, Yu (Marco), 2022. "Train platforming and rescheduling with flexible interlocking mechanisms: An aggregate approach," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 159(C).
    2. Lu, Gongyuan & Nie, Yu(Marco) & Liu, Xiaobo & Li, Denghui, 2019. "Trajectory-based traffic management inside an autonomous vehicle zone," Transportation Research Part B: Methodological, Elsevier, vol. 120(C), pages 76-98.
    3. Sels, P. & Vansteenwegen, P. & Dewilde, T. & Cattrysse, D. & Waquet, B. & Joubert, A., 2014. "The train platforming problem: The infrastructure management company perspective," Transportation Research Part B: Methodological, Elsevier, vol. 61(C), pages 55-72.
    4. Matthew E. H. Petering & Mojtaba Heydar & Dietrich R. Bergmann, 2016. "Mixed-Integer Programming for Railway Capacity Analysis and Cyclic, Combined Train Timetabling and Platforming," Transportation Science, INFORMS, vol. 50(3), pages 892-909, August.
    5. Yidong Wang & Rui Song & Shiwei He & Zilong Song, 2022. "Train Routing and Track Allocation Optimization Model of Multi-Station High-Speed Railway Hub," Sustainability, MDPI, vol. 14(12), pages 1-21, June.
    6. Richard Lusby & Jesper Larsen & David Ryan & Matthias Ehrgott, 2011. "Routing Trains Through Railway Junctions: A New Set-Packing Approach," Transportation Science, INFORMS, vol. 45(2), pages 228-245, May.
    7. Burdett, R.L. & Kozan, E., 2010. "A disjunctive graph model and framework for constructing new train schedules," European Journal of Operational Research, Elsevier, vol. 200(1), pages 85-98, January.
    8. Alberto Caprara & Laura Galli & Paolo Toth, 2011. "Solution of the Train Platforming Problem," Transportation Science, INFORMS, vol. 45(2), pages 246-257, May.
    9. Dewilde, Thijs & Sels, Peter & Cattrysse, Dirk & Vansteenwegen, Pieter, 2014. "Improving the robustness in railway station areas," European Journal of Operational Research, Elsevier, vol. 235(1), pages 276-286.
    10. Bhatia, Vinod & Sharma, Seema, 2021. "Expense based performance analysis and resource rationalization: Case of Indian Railways," Socio-Economic Planning Sciences, Elsevier, vol. 76(C).
    11. G. Caimi & F. Chudak & M. Fuchsberger & M. Laumanns & R. Zenklusen, 2011. "A New Resource-Constrained Multicommodity Flow Model for Conflict-Free Train Routing and Scheduling," Transportation Science, INFORMS, vol. 45(2), pages 212-227, May.
    12. 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.
    13. Lee, Yusin & Chen, Chuen-Yih, 2009. "A heuristic for the train pathing and timetabling problem," Transportation Research Part B: Methodological, Elsevier, vol. 43(8-9), pages 837-851, September.
    14. Vansteenwegen, Pieter & Dewilde, Thijs & Burggraeve, Sofie & Cattrysse, Dirk, 2016. "An iterative approach for reducing the impact of infrastructure maintenance on the performance of railway systems," European Journal of Operational Research, Elsevier, vol. 252(1), pages 39-53.
    15. 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.
    16. Lu Yang & Leishan Zhou & Hanxiao Zhou & Chang Han & Wenqiang Zhao, 2023. "A Lagrangian Method for Calculation of Passing Capacity on a Railway Hub Station," Mathematics, MDPI, vol. 11(6), pages 1-20, March.
    17. E. Ursavas & Stuart X. Zhu, 2018. "Integrated Passenger and Freight Train Planning on Shared-Use Corridors," Service Science, INFORMS, vol. 52(6), pages 1376-1390, December.
    18. Nikola Bešinović & Rob M. P. Goverde, 2019. "Stable and robust train routing in station areas with balanced infrastructure capacity occupation," Public Transport, Springer, vol. 11(2), pages 211-236, August.
    19. Twan Dollevoet & Dennis Huisman & Leo Kroon & Marie Schmidt & Anita Schöbel, 2015. "Delay Management Including Capacities of Stations," Transportation Science, INFORMS, vol. 49(2), pages 185-203, May.
    20. Pellegrini, Paola & Rodriguez, Joaquin, 2013. "Single European Sky and Single European Railway Area: A system level analysis of air and rail transportation," Transportation Research Part A: Policy and Practice, Elsevier, vol. 57(C), pages 64-86.

    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:jsusta:v:14:y:2022:i:4:p:2365-:d:753129. 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.