IDEAS home Printed from https://ideas.repec.org/a/eee/transb/v108y2018icp148-171.html
   My bibliography  Save this article

Solving the block-to-train assignment problem using the heuristic approach based on the genetic algorithm and tabu search

Author

Listed:
  • Xiao, Jie
  • Pachl, Joern
  • Lin, Boliang
  • Wang, Jiaxi

Abstract

After the railroad blocking plan is generated, the block-to-train assignment problem determines which train services to be offered, how many trains of each service to be dispatched (service frequency) and which blocks to be carried by which train services. An integer programming optimization model is defined to solve the block-to-train assignment problem. The model aims to maximize the total cost savings of the whole railroad network compared to the single-block train service plan, where each block is allocated to a direct train service. The objective function includes the service design cost savings, the train operation cost savings, the car-hour consumption savings in the accumulation process, the car-hour consumption savings in the attachment and detachment operations and the waiting car-hour consumption savings. Furthermore, the model is improved to a path-based formulation, which has far fewer decision variables and is easier to solve for real-world problems. A heuristic approach based on the genetic algorithm and tabu search is developed to solve the path-based formulation. The model and approach are tested first in a small network to compare with the optimal solution obtained through the enumeration method and the solution obtained from commercial optimization software. Then the model and approach are applied to a real larger railroad sub-network in China.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:transb:v:108:y:2018:i:c:p:148-171
    DOI: 10.1016/j.trb.2017.12.014
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0191261517306227
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.trb.2017.12.014?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. Lin, Bo-Liang & Wang, Zhi-Mei & Ji, Li-Jun & Tian, Ya-Ming & Zhou, Guo-Qing, 2012. "Optimizing the freight train connection service network of a large-scale rail system," Transportation Research Part B: Methodological, Elsevier, vol. 46(5), pages 649-667.
    2. Haghani, Ali E., 1989. "Formulation and solution of a combined train routing and makeup, and empty car distribution model," Transportation Research Part B: Methodological, Elsevier, vol. 23(6), pages 433-452, December.
    3. Endong Zhu & Teodor Gabriel Crainic & Michel Gendreau, 2014. "Scheduled Service Network Design for Freight Rail Transportation," Operations Research, INFORMS, vol. 62(2), pages 383-400, April.
    4. Michael Francis Gorman, 1998. "An application of genetic and tabu searches to the freight railroad operating plan problem," Annals of Operations Research, Springer, vol. 78(0), pages 51-69, January.
    5. Fang, Kan & Ke, Ginger Y. & Verma, Manish, 2017. "A routing and scheduling approach to rail transportation of hazardous materials with demand due dates," European Journal of Operational Research, Elsevier, vol. 261(1), pages 154-168.
    6. Jean-François Cordeau & Paolo Toth & Daniele Vigo, 1998. "A Survey of Optimization Models for Train Routing and Scheduling," Transportation Science, INFORMS, vol. 32(4), pages 380-404, November.
    7. 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.
    8. Teodor Crainic & Jacques-A. Ferland & Jean-Marc Rousseau, 1984. "A Tactical Planning Model for Rail Freight Transportation," Transportation Science, INFORMS, vol. 18(2), pages 165-184, May.
    9. Alberto Caprara & Matteo Fischetti & Paolo Toth, 2002. "Modeling and Solving the Train Timetabling Problem," Operations Research, INFORMS, vol. 50(5), pages 851-861, October.
    10. Cynthia Barnhart & Hong Jin & Pamela H. Vance, 2000. "Railroad Blocking: A Network Design Application," Operations Research, INFORMS, vol. 48(4), pages 603-614, August.
    11. Keaton, Mark H., 1989. "Designing optimal railroad operating plans: Lagrangian relaxation and heuristic approaches," Transportation Research Part B: Methodological, Elsevier, vol. 23(6), pages 415-431, December.
    12. Kwon, Oh Kyoung & Martland, Carl D. & Sussman, Joseph M., 1998. "Routing and scheduling temporal and heterogeneous freight car traffic on rail networks," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 34(2), pages 101-115, June.
    13. Nozick, Linda K. & Morlok, Edward K., 1997. "A model for medium-term operations planning in an intermodal rail-truck service," Transportation Research Part A: Policy and Practice, Elsevier, vol. 31(2), pages 91-107, March.
    14. Ravindra K. Ahuja & Krishna C. Jha & Jian Liu, 2007. "Solving Real-Life Railroad Blocking Problems," Interfaces, INFORMS, vol. 37(5), pages 404-419, October.
    15. Bodin, Lawrence D. & Golden, Bruce L. & Schuster, Allan D. & Romig, William, 1980. "A model for the blocking of trains," Transportation Research Part B: Methodological, Elsevier, vol. 14(1-2), pages 115-120.
    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. 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.
    2. 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.
    3. 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.
    4. 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.
    5. Boliang Lin & Xingkui Li & Zexi Zhang & Yinan Zhao, 2019. "Optimizing Transport Scheme of High Value-Added Shipments in Regions without Express Train Services," Sustainability, MDPI, vol. 11(21), pages 1-21, November.
    6. 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.
    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.

    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. 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.
    2. Chen, C. & Dollevoet, T.A.B. & Zhao, J., 2017. "One-block train formation in large-scale railway networks: An exact model and a tree-based decomposition algorithm," Econometric Institute Research Papers EI-2017-32, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    3. 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.
    4. Endong Zhu & Teodor Gabriel Crainic & Michel Gendreau, 2014. "Scheduled Service Network Design for Freight Rail Transportation," Operations Research, INFORMS, vol. 62(2), pages 383-400, April.
    5. Boliang Lin & Xingkui Li & Zexi Zhang & Yinan Zhao, 2019. "Optimizing Transport Scheme of High Value-Added Shipments in Regions without Express Train Services," Sustainability, MDPI, vol. 11(21), pages 1-21, November.
    6. Jin, Jian Gang & Zhao, Jun & Lee, Der-Horng, 2013. "A column generation based approach for the Train Network Design Optimization problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 50(C), pages 1-17.
    7. 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.
    8. Zhimei Wang & Avishai Ceder, 2017. "Efficient design of freight train operation with double-hump yards," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(12), pages 1600-1619, December.
    9. Alena Otto & Erwin Pesch, 2017. "Operation of shunting yards: train-to-yard assignment problem," Journal of Business Economics, Springer, vol. 87(4), pages 465-486, May.
    10. Sarah Frisch & Philipp Hungerländer & Anna Jellen & Manuel Lackenbucher & Bernhard Primas & Sebastian Steininger, 2023. "Integrated freight car routing and train scheduling," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 31(2), pages 417-443, June.
    11. Khaled, Abdullah A. & Jin, Mingzhou & Clarke, David B. & Hoque, Mohammad A., 2015. "Train design and routing optimization for evaluating criticality of freight railroad infrastructures," Transportation Research Part B: Methodological, Elsevier, vol. 71(C), pages 71-84.
    12. Xin Wang & Teodor Gabriel Crainic & Stein W. Wallace, 2019. "Stochastic Network Design for Planning Scheduled Transportation Services: The Value of Deterministic Solutions," INFORMS Journal on Computing, INFORMS, vol. 31(1), pages 153-170, February.
    13. Lin, Bo-Liang & Wang, Zhi-Mei & Ji, Li-Jun & Tian, Ya-Ming & Zhou, Guo-Qing, 2012. "Optimizing the freight train connection service network of a large-scale rail system," Transportation Research Part B: Methodological, Elsevier, vol. 46(5), pages 649-667.
    14. Alena Otto & Erwin Pesch, 2019. "The train-to-yard assignment problem," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 41(2), pages 549-580, June.
    15. J Liu & R K Ahuja & G Şahin, 2008. "Optimal network configuration and capacity expansion of railroads," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(7), pages 911-920, July.
    16. Crainic, Teodor Gabriel, 2000. "Service network design in freight transportation," European Journal of Operational Research, Elsevier, vol. 122(2), pages 272-288, April.
    17. Armin Fügenschuh & Henning Homfeld & Hanno Schülldorf, 2015. "Single-Car Routing in Rail Freight Transport," Transportation Science, INFORMS, vol. 49(1), pages 130-148, February.
    18. 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.
    19. G Lulli & U Pietropaoli & N Ricciardi, 2011. "Service network design for freight railway transportation: the Italian case," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(12), pages 2107-2119, December.
    20. Scheffler, Martin & Neufeld, Janis S. & Hölscher, Michael, 2020. "An MIP-based heuristic solution approach for the locomotive assignment problem focussing on (dis-)connecting processes," Transportation Research Part B: Methodological, Elsevier, vol. 139(C), pages 64-80.

    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:transb:v:108:y:2018:i:c:p:148-171. 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/548/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.