IDEAS home Printed from https://ideas.repec.org/a/eee/jomega/v92y2020ics0305048319302464.html
   My bibliography  Save this article

A branch-and-price approach for trip sequence planning of high-speed train units

Author

Listed:
  • Gao, Yuan
  • Schmidt, Marie
  • Yang, Lixing
  • Gao, Ziyou

Abstract

In high-speed railway operations, a trip sequence plan is made once the timetable is determined, and serves as a reference in the subsequent operations of train units scheduling. In light of the maintenance requirements of train units and periodicity characteristics of trip sequences, we introduce a trip sequence graph to describe the train units’ movement and coupling/splitting in a railway network. Based on the trip sequence graph, two integer linear programming models are then formulated, namely a path-based model and an arc-based model. Integrated with the characteristics of the trip sequence graph, a customized branch-and-price algorithm is developed to solve the path-based model. The two models are applied to the high-speed railway network in eastern China, and through numerical experiments, the effectiveness and applicability of the models are discussed.

Suggested Citation

  • Gao, Yuan & Schmidt, Marie & Yang, Lixing & Gao, Ziyou, 2020. "A branch-and-price approach for trip sequence planning of high-speed train units," Omega, Elsevier, vol. 92(C).
    • Handle: RePEc:eee:jomega:v:92:y:2020:i:c:s0305048319302464
    DOI: 10.1016/j.omega.2019.102150
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0305048319302464
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.omega.2019.102150?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Valentina Cacchiani & Alberto Caprara & Laura Galli & Leo Kroon & Gábor Maróti & Paolo Toth, 2012. "Railway Rolling Stock Planning: Robustness Against Large Disruptions," Transportation Science, INFORMS, vol. 46(2), pages 217-232, May.
    2. Koorush Ziarati & François Soumis & Jacques Desrosiers & Marius M. Solomon, 1999. "A Branch-First, Cut-Second Approach for Locomotive Assignment," Management Science, INFORMS, vol. 45(8), pages 1156-1168, August.
    3. Haouari, Mohamed & Aissaoui, Najla & Mansour, Farah Zeghal, 2009. "Network flow-based approaches for integrated aircraft fleeting and routing," European Journal of Operational Research, Elsevier, vol. 193(2), pages 591-599, March.
    4. Wang, Yihui & D’Ariano, Andrea & Yin, Jiateng & Meng, Lingyun & Tang, Tao & Ning, Bin, 2018. "Passenger demand oriented train scheduling and rolling stock circulation planning for an urban rail transit line," Transportation Research Part B: Methodological, Elsevier, vol. 118(C), pages 193-227.
    5. Cynthia Barnhart & Ellis L. Johnson & George L. Nemhauser & Martin W. P. Savelsbergh & Pamela H. Vance, 1998. "Branch-and-Price: Column Generation for Solving Huge Integer Programs," Operations Research, INFORMS, vol. 46(3), pages 316-329, June.
    6. Arianna Alfieri & Rutger Groot & Leo Kroon & Alexander Schrijver, 2006. "Efficient Circulation of Railway Rolling Stock," Transportation Science, INFORMS, vol. 40(3), pages 378-391, August.
    7. Zhe Liang & Wanpracha Art Chaovalitwongse, 2013. "A Network-Based Model for the Integrated Weekly Aircraft Maintenance Routing and Fleet Assignment Problem," Transportation Science, INFORMS, vol. 47(4), pages 493-507, November.
    8. Jean-François Cordeau & François Soumis & Jacques Desrosiers, 2000. "A Benders Decomposition Approach for the Locomotive and Car Assignment Problem," Transportation Science, INFORMS, vol. 34(2), pages 133-149, May.
    9. Lingaya, Norbert & Cordeau, Jean-Françcois & Desaulniers, Guy & Desrosiers, Jacques & Soumis, Françcois, 2002. "Operational car assignment at VIA Rail Canada," Transportation Research Part B: Methodological, Elsevier, vol. 36(9), pages 755-778, November.
    10. Lin, Zhiyuan & Kwan, Raymond S.K., 2016. "A branch-and-price approach for solving the train unit scheduling problem," Transportation Research Part B: Methodological, Elsevier, vol. 94(C), pages 97-120.
    11. Lloyd Clarke & Ellis Johnson & George Nemhauser & Zhongxi Zhu, 1997. "The aircraft rotation problem," Annals of Operations Research, Springer, vol. 69(0), pages 33-46, January.
    12. Valentina Cacchiani & Alberto Caprara & Paolo Toth, 2019. "An Effective Peak Period Heuristic for Railway Rolling Stock Planning," Transportation Science, INFORMS, vol. 53(3), pages 746-762, May.
    13. Jean-François Cordeau & François Soumis & Jacques Desrosiers, 2001. "Simultaneous Assignment of Locomotives and Cars to Passenger Trains," Operations Research, INFORMS, vol. 49(4), pages 531-548, August.
    14. Zhe Liang & Wanpracha Art Chaovalitwongse & Huei Chuen Huang & Ellis L. Johnson, 2011. "On a New Rotation Tour Network Model for Aircraft Maintenance Routing Problem," Transportation Science, INFORMS, vol. 45(1), pages 109-120, February.
    15. Gábor Maróti & Leo Kroon, 2005. "Maintenance Routing for Train Units: The Transition Model," Transportation Science, INFORMS, vol. 39(4), pages 518-525, November.
    16. Hong, Sung-Pil & Kim, Kyung Min & Lee, Kyungsik & Hwan Park, Bum, 2009. "A pragmatic algorithm for the train-set routing: The case of Korea high-speed railway," Omega, Elsevier, vol. 37(3), pages 637-645, June.
    17. Ralf Borndörfer & Markus Reuther & Thomas Schlechte & Kerstin Waas & Steffen Weider, 2016. "Integrated Optimization of Rolling Stock Rotations for Intercity Railways," Transportation Science, INFORMS, vol. 50(3), pages 863-877, August.
    18. Cynthia Barnhart & Natashia L. Boland & Lloyd W. Clarke & Ellis L. Johnson & George L. Nemhauser & Rajesh G. Shenoi, 1998. "Flight String Models for Aircraft Fleeting and Routing," Transportation Science, INFORMS, vol. 32(3), pages 208-220, August.
    19. Fioole, Pieter-Jan & Kroon, Leo & Maroti, Gabor & Schrijver, Alexander, 2006. "A rolling stock circulation model for combining and splitting of passenger trains," European Journal of Operational Research, Elsevier, vol. 174(2), pages 1281-1297, October.
    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. Park, Jongyoon & Han, Jinil & Lee, Kyungsik, 2022. "Integer Optimization Model and Algorithm for the Stem Cell Culturing Problem," Omega, Elsevier, vol. 108(C).
    2. Zhao, Yaqiong & Li, Dewei & Yin, Yonghao & Zhao, Xiaoli, 2023. "Integrated optimization of demand-driven timetable, train formation plan and rolling stock circulation with variable running times and dwell times," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 171(C).
    3. Peng Zhao & Yawei Li & Baoming Han & Ruixia Yang & Zhiping Liu, 2022. "Integrated Optimization of Rolling Stock Scheduling and Flexible Train Formation Based on Passenger Demand for an Intercity High-Speed Railway," Sustainability, MDPI, vol. 14(9), pages 1-22, May.

    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. Gao, Yuan & Xia, Jun & D’Ariano, Andrea & Yang, Lixing, 2022. "Weekly rolling stock planning in Chinese high-speed rail networks," Transportation Research Part B: Methodological, Elsevier, vol. 158(C), pages 295-322.
    2. Canca, David & Barrena, Eva, 2018. "The integrated rolling stock circulation and depot location problem in railway rapid transit systems," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 109(C), pages 115-138.
    3. Lusby, Richard M. & Haahr, Jørgen Thorlund & Larsen, Jesper & Pisinger, David, 2017. "A Branch-and-Price algorithm for railway rolling stock rescheduling," Transportation Research Part B: Methodological, Elsevier, vol. 99(C), pages 228-250.
    4. Lin, Boliang & Zhao, Yinan, 2021. "Synchronized optimization of EMU train assignment and second-level preventive maintenance scheduling," Reliability Engineering and System Safety, Elsevier, vol. 215(C).
    5. Lin, Zhiyuan & Kwan, Raymond S.K., 2016. "A branch-and-price approach for solving the train unit scheduling problem," Transportation Research Part B: Methodological, Elsevier, vol. 94(C), pages 97-120.
    6. Yu Zhou & Leishan Zhou & Yun Wang & Zhuo Yang & Jiawei Wu, 2017. "Application of Multiple-Population Genetic Algorithm in Optimizing the Train-Set Circulation Plan Problem," Complexity, Hindawi, vol. 2017, pages 1-14, July.
    7. Frisch, Sarah & Hungerländer, Philipp & Jellen, Anna & Primas, Bernhard & Steininger, Sebastian & Weinberger, Dominic, 2021. "Solving a real-world Locomotive Scheduling Problem with Maintenance Constraints," Transportation Research Part B: Methodological, Elsevier, vol. 150(C), pages 386-409.
    8. Zhong, Qingwei & Lusby, Richard M. & Larsen, Jesper & Zhang, Yongxiang & Peng, Qiyuan, 2019. "Rolling stock scheduling with maintenance requirements at the Chinese High-Speed Railway," Transportation Research Part B: Methodological, Elsevier, vol. 126(C), pages 24-44.
    9. Joris C. Wagenaar & Leo G. Kroon & Marie Schmidt, 2017. "Maintenance Appointments in Railway Rolling Stock Rescheduling," Transportation Science, INFORMS, vol. 51(4), pages 1138-1160, November.
    10. Camilo Ortiz-Astorquiza & Jean-François Cordeau & Emma Frejinger, 2021. "The Locomotive Assignment Problem with Distributed Power at the Canadian National Railway Company," Transportation Science, INFORMS, vol. 55(2), pages 510-531, March.
    11. Zhiyuan Lin & Raymond S. K. Kwan, 2016. "Local convex hulls for a special class of integer multicommodity flow problems," Computational Optimization and Applications, Springer, vol. 64(3), pages 881-919, July.
    12. Wagenaar, J.C. & Kroon, L.G. & Schmidt, M.E., 2016. "Maintenance Appointments in Railway Rolling Stock Rescheduling," ERIM Report Series Research in Management ERS-2016-001-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.
    13. Zhao, Yaqiong & Li, Dewei & Yin, Yonghao & Zhao, Xiaoli, 2023. "Integrated optimization of demand-driven timetable, train formation plan and rolling stock circulation with variable running times and dwell times," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 171(C).
    14. 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.
    15. Hoogervorst, R. & Dollevoet, T.A.B. & Maróti, G. & Huisman, D., 2018. "Reducing Passenger Delays by Rolling Stock Rescheduling," Econometric Institute Research Papers EI2018-29, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    16. Liang, Zhe & Feng, Yuan & Zhang, Xiaoning & Wu, Tao & Chaovalitwongse, Wanpracha Art, 2015. "Robust weekly aircraft maintenance routing problem and the extension to the tail assignment problem," Transportation Research Part B: Methodological, Elsevier, vol. 78(C), pages 238-259.
    17. Haahr, J.T. & Wagenaar, J.C. & Veelenturf, L.P. & Kroon, L.G., 2015. "A Comparison of Two Exact Methods for Passenger Railway Rolling Stock (Re)Scheduling," ERIM Report Series Research in Management ERS-2015-007-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.
    18. Dakic, Igor & Yang, Kaidi & Menendez, Monica & Chow, Joseph Y.J., 2021. "On the design of an optimal flexible bus dispatching system with modular bus units: Using the three-dimensional macroscopic fundamental diagram," Transportation Research Part B: Methodological, Elsevier, vol. 148(C), pages 38-59.
    19. Balachandran Vaidyanathan & Ravindra K. Ahuja & James B. Orlin, 2008. "The Locomotive Routing Problem," Transportation Science, INFORMS, vol. 42(4), pages 492-507, November.
    20. Wen, Xin & Sun, Xuting & Ma, Hoi-Lam & Sun, Yige, 2022. "A column generation approach for operational flight scheduling and aircraft maintenance routing," Journal of Air Transport Management, Elsevier, vol. 105(C).

    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:eee:jomega:v:92:y:2020:i:c:s0305048319302464. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/375/description#description .

    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.