Abstract
The train-to-yard assignment problem (TYAP) pertains to freight consolidation in a large rail transshipment yard—also called a multiple yard—that consists of two sub-yards. Inbound and outbound trains need to be assigned to one or the other sub-yard in a way that minimizes the total railcar switching costs. Each inbound and outbound train is processed in one of the two sub-yards, and time-consuming maneuvers may be necessary for railcars that are supposed to be part of an outbound train leaving from the other sub-yard. A lower number of railcar reassignments between the sub-yards reduce train dwell times and avoid train delays that affect the whole rail network. We develop a matheuristic algorithm with a learning mechanism, which we call MuSt, as well as a branch-and-bound procedure that incorporates elements of constraint propagation. We examine the performance of the developed algorithms through extensive computational experiments. Effective optimization approaches for the TYAP have high practical significance since they may reduce the number of avoidable railcar reassignments, which are resource-blocking, traffic-generating, and expensive, by about 20% compared to current practice, as we illustrate in our computational experiments. Our branch-and-bound algorithm solves problem instances for small or medium railyards in less than a minute or within several hours run time, respectively. The heuristic procedure MuSt finds optimal or nearly optimal solutions within just a couple of minutes, even for large railyards.
Similar content being viewed by others
References
Ahuja RK, Jha KC, Liu J (2007) Solving real-life railroad blocking problems. Interfaces 37:404–419
Assad AA (1980) Models for rail transportation. Transp Res A Pol 14:205–220. https://doi.org/10.1016/0191-2607(80)90017-5
Bohlin M, Dahms F, Flier H, Gestrelius S (2012a) Optimal freight train classification using column generation. In: Delling D, Liberti L (eds) 12th workshop on algorithmic approaches for transportation modelling, optimization, and systems (ATMOS’12). https://doi.org/10.1016/0191-2607(80)90017-5
Bohlin M, Gestrelius S, Khoshniyat F (2012b) Evaluation of planning policies for marshalling track allocation using simulation. Technical report, ID 5304. Sweden Institute of Computer Science. Kista, Sweden
Boysen N, Fliedner M, Jaehn F, Pesch E (2012) Shunting yard operations. Theoretical aspects and applications. Eur J Oper Res 220:1–14. https://doi.org/10.1016/j.ejor.2012.01.043
Burkard RE, Zimmermann UT (2012) Einführung in die mathematische Optimierung [Introduction to mathematical optimization]. Springer, Berlin
Cordeau JF, Toth P, Vigo D (1998) A survey of optimization models for train routing and scheduling. Transp Sci 32:380–404. https://doi.org/10.1287/trsc.32.4.380
Crainic TG, Rousseau JM (1986) Multicommodity, multimode freight transportation: a general modeling and algorithmic framework for the service network design problem. Transp Res B Meth 20:225–242. https://doi.org/10.1016/0191-2615(86)90019-6
Crainic T, Ferland JA, Rousseau JM (1984) A tactical planning model for rail freight transportation. Transp Sci 18:165–184. https://doi.org/10.1287/trsc.18.2.165
Di Stefano G, Koči ML (2004) A graph theoretical approach to the shunting problem. Electron Notes Theor Comput Sci 92:16–33. https://doi.org/10.1016/j.entcs.2003.12.020
Di Stefano G, Zimmermann UT (2005) Short note on complexity and approximability of unimodal partitions of permutations. Technical report 05/01, preprint of the Mathematical Institutes, TU Braunschweig
EU Commission (2007) Mitteilung der Kommission an den Rat und das Europäische Parlament: Über die Überwachung der Entwicklung des Schienenverkehrsmarkts [Communication from the commission to the council and the european parliament: on the supervision of the development of the rail transportation market]. Technical report SEK(2007)1323. https://www.jurion.de/gesetze/eu/52007dc0609/. Accessed 6 Feb 2017
EU Commission (2011) Impact assessment: roadmap to a single European transport area—towards a competitive and resource efficient transport system. White paper. EU Commission Staff Working Paper. https://ec.europa.eu/transport/themes/strategies/2011_white_paper_en. Accessed 6 Feb 2017
Gatto M, Maue J, Mihalák M, Widmayer P (2009) Shunting for dummies: an introductory algorithmic survey. In: Ahuja RK, Möhring RH, Zaroliagis CD (eds) Robust and online large-scale optimization. Springer, Berlin
Haahr JT, Lusby RM (2016) A matheuristic approach to integrate humping and pullout sequencing operations at railroad hump yards. Networks 67:126–138. https://doi.org/10.1002/net.21665
Haghani AE (1989) Formulation and solution of a combined train routing and makeup, and empty car distribution model. Transp Res B Meth 23:433–452. https://doi.org/10.1016/0191-2615(89)90043-X
Hansmann RS, Zimmermann UT (2008) Optimal sorting of rolling stock. In: Krebs HJ, Jäger W (eds) Mathematics—key technology for the future. Springer, Berlin
Hitchcock FL (1941) The distribution of a product from several sources to numerous localities. J Math Phys 20:224–230. https://doi.org/10.1002/sapm1941201224
Ingram TL (2003) TOP: field implementation. Special securities analyst meeting in Brosnan forest. http://www.sec.gov/Archives/edgar/data/702165/000070216503000087/tli_022703.htm. Accessed 6 Feb 2017
Jacob R, Márton P, Maue J, Nunkesser M (2011) Multistage methods for freight train classification. Networks 57:87–105. https://doi.org/10.1002/net.20385
Jaehn F, Michaelis S (2016) Shunting of trains in succeeding yards. Comput Ind Eng 102:1–9. https://doi.org/10.1016/j.cie.2016.10.006
Jaehn F, Rieder J, Wiehl A (2015a) Minimizing delays in a shunting yard. OR Spectr 37:407–429. https://doi.org/10.1007/s00291-015-0391-1
Jaehn F, Rieder J, Wiehl A (2015b) Single-stage shunting minimizing weighted departure times. Omega 52:133–141. https://doi.org/10.1016/j.omega.2014.11.001
Jin JG, Zhao J, Lee DH (2013) A column generation based approach for the train network design optimization problem. Transp Res E Log 50:1–17. https://doi.org/10.1016/j.tre.2012.11.004
Keaton MH (1989) Designing optimal railroad operating plans: Lagrangian relaxation and heuristic approaches. Transp Res B Meth 23:415–431. https://doi.org/10.1016/0191-2615(89)90042-8
Keaton MH (1992) Designing railroad operating plans: a dual adjustment method for implementing Langrangian relaxation. Transp Sci 26:263–279. https://doi.org/10.1287/trsc.26.4.263
Lawson J (2007) The environmental footprint of surface freight transportation. Transportation Research Board Special Report, June (No. 291). http://onlinepubs.trb.org/onlinepubs/sr/sr291_lawson.pdf. Accessed 31 Jan 2019
Maue J, Nunkesser M (2009) Evaluation of computational methods for freight train classification schedules. Technical report, ARRIVAL Project
Niu H, Hu A (1998) Optimization model and algorithm for system operation division of labor at two-way marshalling station. Sci China Ser E Technol Sci 41:511–518. https://doi.org/10.1007/BF02917026
Otto C, Otto A (2014) How to design effective priority rules: example of simple assembly line balancing. Comput Ind Eng 69:43–52. https://doi.org/10.1016/j.cie.2013.12.013
Otto A, Pesch E (2017) Operation of shunting yards: train-to-yard assignment problem. J Bus Econ 87:465–486. https://doi.org/10.1007/s11573-016-0827-3
Rail operations (1970) Rail operations. Yard (Trans subcourse 636). In: Correspondence course of the U.S. Army Transportation School, Edition 7. Fort Eustis, Virginia. www.dtic.mil/cgi-bin/GetTRDoc?AD=ADA402745. Accessed 31 Jan 2019
Rhodes M (2003) North American railyards. MBI Publishing Company, St. Paul
UP (2015) Bailey yard. http://www.up.com/aboutup/facilities/bailey_yard. Official website of the Union Pacific Corporation. Accessed 6 Feb 2017
Zhu E, Crainic TG, Gendreau M (2014) Scheduled service network design for freight rail transportation. Oper Res 62:383–400. https://doi.org/10.1287/opre.2013.1254
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Otto, A., Pesch, E. The train-to-yard assignment problem. OR Spectrum 41, 549–580 (2019). https://doi.org/10.1007/s00291-019-00547-y
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00291-019-00547-y