The Locomotive Assignment Problem with Distributed Power at the Canadian National Railway Company

References

• Adulyasak Y, Cordeau JF, Jans R (2015) Benders decomposition for production routing under demand uncertainty. Oper. Res. 63(4):851–867.Link, Google Scholar
• Ahuja RK, Magnanti TL, Orlin JB (1993) Network Flows: Theory, Algorithms, and Applications (Prentice-Hall, Englewood Cliffs, NJ).Google Scholar
• Ahuja RK, Liu J, Orlin JB, Sharma D, Shughart LA (2005) Solving real-life locomotive-scheduling problems. Transportation Sci 39(4):503–517.Link, Google Scholar
• Benders JF (1962) Partitioning procedures for solving mixed-variables programming problems. Numerische Mathematik 4(1):238–252.Crossref, Google Scholar
• Bodur M, Luedtke JR (2016) Mixed-integer rounding enhanced Benders decomposition for multiclass service-system staffing and scheduling with arrival rate uncertainty. Management Sci. 63(7):2073–2091.Link, Google Scholar
• Bouzaiene-Ayari B, Cheng C, Das S, Fiorillo R, Powell WB (2016) From single commodity to multiattribute models for locomotive optimization: A comparison of optimal integer programming and approximate dynamic programming. Transportation Sci. 50(2):366–389.Link, Google Scholar
• Cacchiani V, Caprara A, Toth P (2010) Solving a real-world train-unit assignment problem. Math. Programming Ser. B. 124(1-2):207–231.Crossref, Google Scholar
• Cacchiani V, Caprara A, Toth P (2019) An effective peak period heuristic for railway rolling stock planning. Transportation Sci. 53(3):746–762.Abstract, Google Scholar
• Cordeau JF, Soumis F, Desrosiers J (2000) A Benders decomposition approach for the locomotive and car assignment problem. Transportation Sci. 34(2):133–149.Link, Google Scholar
• Cordeau JF, Soumis F, Desrosiers J (2001) Simultaneous assignment of locomotives and cars to passenger trains. Oper. Res. 49(4):531–548.Link, Google Scholar
• Cordeau JF, Toth P, Vigo D (1998) A survey of optimization models for train routing and scheduling. Transportation Sci. 32(4):380–404.Link, Google Scholar
• Deveau S (2011) How long can trains go? National Post. May 2019, http://www.nationalpost.com/long+trains/4348592/story.html.Google Scholar
• Fischetti M, Ljubić I, Sinnl M (2017) Redesigning Benders decomposition for large-scale facility location. Management Sci. 63(7):2146–2162.Link, Google Scholar
• Florian M, Bushell G, Ferland J, Guerin G, Nastansky L (1976) The engine scheduling problem in a railway network. INFOR Inform. Systems Oper. Res. 14(2):121–138.Crossref, Google Scholar
• Haahr J, Wagenaar J, Veelenturf L, Kroon L (2016) A comparison of two exact methods for passenger railway rolling stock (re)scheduling. Transportation Res. Part E: Logist. Transportation Rev. 91(1-2):15–32.Crossref, Google Scholar
• Jaumard B, Tian H (2016) Multi-column generation model for the locomotive assignment problem. Goerigk M, Werneck R, eds. OpenAccess Series in Informatics (OASIcs). 16th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany), 1–13.Google Scholar
• Lin Z, Kwan RS (2014) A two-phase approach for real-world train unit scheduling. Public Transport (Berlin) 6(1–2):35–65.Crossref, Google Scholar
• Lin Z, Kwan RS (2016) A branch-and-price approach for solving the train unit scheduling problem. Transportation Res. Part B: Methodological 94:97–120.Crossref, Google Scholar
• Magnanti TL, Wong RT (1981) Accelerating Benders decomposition: Algorithmic enhancement and model selection criteria. Oper. Res. 29(3):464–484.Link, Google Scholar
• Miranda PL, Cordeau JF, Frejinger E (2020) A time-space formulation for the locomotive routing problem at the Canadian National Railway. Technical Report CIRRELT 2020-19, University of Montreal, Montreal.Google Scholar
• Ortiz-Astorquiza C, Contreras I, Laporte G (2019) An exact algorithm for multi-level uncapacitated facility location,. Transportation Sci. 53(4):1085–1106.Link, Google Scholar
• Piu F, Speranza MG (2014) The locomotive assignment problem: A survey on optimization models. Internat. Trans. Oper. Res. 21(3):327–352.Crossref, Google Scholar
• Piu F, Kumar V, Speranza MG (2015) Introducing a preliminary consists selection in the locomotive assignment problem. Transportation Res. Part E: Logist. Transportation Rev 82:217–237.Crossref, Google Scholar
• Powell WB, Bouzaiene-Ayari B, Lawrence C, Cheng C, Das S, Fiorillo R (2014) Locomotive planning at Norfolk Southern: An optimizing simulator using approximate dynamic programming. Interfaces 44(6):567–578.Link, Google Scholar
• Rahmaniani R, Crainic TG, Gendreau M, Rei W (2017) The Benders decomposition algorithm: A literature review. Eur. J. Oper. Res. 259(3):801–817.Crossref, Google Scholar
• Railway Association of Canada (2020) Accessed June 8, 2020, https://www.railcan.ca/101/delivering-canadas-amazing-products-to-the-world/.Google Scholar
• Vaidyanathan B, Ahuja RK, Orlin JB (2008) The locomotive routing problem. Transportation Sci. 42(4):492–507.Link, Google Scholar
• Vaidyanathan B, Ahuja RK, Liu J, Shughart LA (2008) Real-life locomotive planning: New formulations and computational results. Transportation Res. Part B: Methodological 42(2):147–168.Crossref, Google Scholar
• Ziarati K, Soumis FF, Desrosiers J, Solomon MM (1999) A branch-first, cut-second approach for locomotive assignment. Management Sci 8(45):1156, 1168.Link, Google Scholar
• Ziarati K, Soumis FF, Desrosiers J, Gélinas S, Saintonge A (1997) Locomotive assignment with heterogeneous consists at CN North America. Eur. J. Oper. Res. 97(2):281–292.Crossref, Google Scholar