IDEAS home Printed from https://ideas.repec.org/a/inm/ortrsc/v50y2016i3p823-840.html
   My bibliography  Save this article

Optimization Methods for Multistage Freight Train Formation

Author

Listed:
  • Markus Bohlin

    (SICS Swedish ICT AB, 16440 Kista, Sweden)

  • Sara Gestrelius

    (SICS Swedish ICT AB, 16440 Kista, Sweden)

  • Florian Dahms

    (RWTH Aachen University, 52072 Aachen, Germany)

  • Matúš Mihalák

    (ETH Zürich, 8092 Zürich, Switzerland)

  • Holger Flier

    (ETH Zürich, 8092 Zürich, Switzerland)

Abstract

This paper considers mathematical optimization for the multistage train formation problem, which at the core is the allocation of classification yard formation tracks to outbound freight trains, subject to realistic constraints on train scheduling, arrival and departure timeliness, and track capacity. The problem formulation allows the temporary storage of freight cars on a dedicated mixed-usage track. This real-world practice increases the capacity of the yard, measured in the number of simultaneous trains that can be successfully handled. Two optimization models are proposed and evaluated for the multistage train formation problem. The first one is a column-based integer programming model, which is solved using branch and price. The second model is a simplified reformulation of the first model as an arc-indexed integer linear program, which has the same linear programming relaxation as the first model. Both models are adapted for rolling horizon planning and evaluated on a five-month historical data set from the largest freight yard in Scandinavia. From this data set, 784 instances of different types and lengths, spanning from two to five days, were created. In contrast to earlier approaches, all instances could be solved to optimality using the two models. In the experiments, the arc-indexed model proved optimality on average twice as fast as the column-based model for the independent instances, and three times faster for the rolling horizon instances. For the arc-indexed model, the average solution time for a reasonably sized planning horizon of three days was 16 seconds. Regardless of size, no instance took longer than eight minutes to be solved. The results indicate that optimization approaches are suitable alternatives for scheduling and track allocation at classification yards.

Suggested Citation

  • Markus Bohlin & Sara Gestrelius & Florian Dahms & Matúš Mihalák & Holger Flier, 2016. "Optimization Methods for Multistage Freight Train Formation," Transportation Science, INFORMS, vol. 50(3), pages 823-840, August.
  • Handle: RePEc:inm:ortrsc:v:50:y:2016:i:3:p:823-840
    DOI: 10.1287/trsc.2014.0580
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.2014.0580
    Download Restriction: no

    File URL: https://libkey.io/10.1287/trsc.2014.0580?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
    ---><---

    References listed on IDEAS

    as
    1. Flavia Bonomo & Guillermo Durán & Javier Marenco, 2009. "Exploring the complexity boundary between coloring and list-coloring," Annals of Operations Research, Springer, vol. 169(1), pages 3-16, July.
    2. Boysen, Nils & Fliedner, Malte & Jaehn, Florian & Pesch, Erwin, 2012. "Shunting yard operations: Theoretical aspects and applications," European Journal of Operational Research, Elsevier, vol. 220(1), pages 1-14.
    3. 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.
    4. Cynthia Barnhart & Hong Jin & Pamela H. Vance, 2000. "Railroad Blocking: A Network Design Application," Operations Research, INFORMS, vol. 48(4), pages 603-614, August.
    5. Harry N. Newton & Cynthia Barnhart & Pamela H. Vance, 1998. "Constructing Railroad Blocking Plans to Minimize Handling Costs," Transportation Science, INFORMS, vol. 32(4), pages 330-345, November.
    6. Mark H. Keaton, 1992. "Designing Railroad Operating Plans: A Dual Adjustment Method for Implementing Lagrangian Relaxation," Transportation Science, INFORMS, vol. 26(4), pages 263-279, November.
    7. Christopher L. Huntley & Donald E. Brown & David E. Sappington & Bernard P. Markowicz, 1995. "Freight Routing and Scheduling at CSX Transportation," Interfaces, INFORMS, vol. 25(3), pages 58-71, June.
    8. P. C. Gilmore & R. E. Gomory, 1965. "Multistage Cutting Stock Problems of Two and More Dimensions," Operations Research, INFORMS, vol. 13(1), pages 94-120, February.
    9. 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.
    10. Ravindra K. Ahuja & Krishna C. Jha & Jian Liu, 2007. "Solving Real-Life Railroad Blocking Problems," Interfaces, INFORMS, vol. 37(5), pages 404-419, October.
    11. 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. 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.
    2. Wang, Dian & Zhao, Jun & Peng, Qiyuan, 2022. "Optimizing the loaded train combination problem at a heavy-haul marshalling station," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 162(C).

    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. 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. 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.
    5. 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.
    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. 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.
    8. 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.
    9. 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.
    10. 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.
    11. Phil Ireland & Rod Case & John Fallis & Carl Van Dyke & Jason Kuehn & Marc Meketon, 2004. "The Canadian Pacific Railway Transforms Operations by Using Models to Develop Its Operating Plans," Interfaces, INFORMS, vol. 34(1), pages 5-14, February.
    12. Ravindra K. Ahuja & Krishna C. Jha & Jian Liu, 2007. "Solving Real-Life Railroad Blocking Problems," Interfaces, INFORMS, vol. 37(5), pages 404-419, October.
    13. 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.
    14. 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.
    15. 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.
    16. 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.
    17. 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.
    18. 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.
    19. 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.
    20. Crainic, Teodor Gabriel, 2000. "Service network design in freight transportation," European Journal of Operational Research, Elsevier, vol. 122(2), pages 272-288, April.

    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:inm:ortrsc:v:50:y:2016:i:3:p:823-840. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.