From Single Commodity to Multiattribute Models for Locomotive Optimization: A Comparison of Optimal Integer Programming and Approximate Dynamic Programming

References

• Ahuja R, Cunha C, Sahin G (2005) Network models in railroad planning and scheduling. TutORials in Operations Research (INFORMS, Catonsville, MD).Link, Google Scholar
• Ahuja R, Magnanti TL, Orlin J (1993) Network Flows: Theory, Algorithms, and Applications, Vol. 91 (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
• Cordeau J-F, 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 J-F, Soumis F, Desrosiers J (2001) Simultaneous assignment of locomotives and cars to passenger trains. Oper. Res. 49:(4)531–548.Link, Google Scholar
• Cordeau J-F, Toth P, Vigo D (1998) A survey of optimization models for train routing and scheduling. Transportation Sci. 32(4):380–404.Link, Google Scholar
• Crainic T, Rousseau J-M (1988) Multicommodity, multimode freight transportation: A general modeling and algorithmic framework for the service network design problem. Transportation Res. Part B 20(3):290–297.Google Scholar
• Crainic TG, Laporte G (1997) Planning models for freight transportation. Eur. J. Oper. Res. 97(3):409–439.Crossref, Google Scholar
• Dejax P, Crainic T (1987) A review of empty flows and fleet management models in freight transportation. Transportation Sci. 21(4):227–247.Link, Google Scholar
• Glickman T, Sherali H (1985) Large-scale network distribution of pooled empty freight cars over time, with limited substitution and equitable benefits. Transportation Res. Part B 19(2):85–94.Crossref, Google Scholar
• Glover F, Kochenberger G (2003) Handbook of Metaheuristics (Springer, Norwell, MA).Crossref, Google Scholar
• Godfrey G, Powell WB (2001) An adaptive, distribution-free algorithm for the newsvendor problem with censored demands, with applications to inventory and distribution. Management Sci. 47(8):1101–1112.Link, Google Scholar
• Godfrey G, Powell WB (2002) An adaptive, dynamic programming algorithm for stochastic resource allocation problems I: Single period travel times. Transportation Sci. 36(1):21–39.Link, Google Scholar
• Haghani A (1989) Formulation and solution of a combined train routing and makeup, and empty car distribution model. Transportation Res. Part B 23(6):433–452.Crossref, Google Scholar
• Herren H (1977) Computer controlled empty wagon distribution on the SSB. Rail Internat. 8(1):25–32.Google Scholar
• Holmberg K, Joborn M, Lundgren JT (1998) Improved empty freight car distribution. Transportation Sci. 32(2):163–173.Link, Google Scholar
• Joborn M (2001) Optimization of empty freight car distribution in scheduled railways. Ph.D. thesis, Department of Mathematics, Linkoping University, Linkoping, Sweden.Google Scholar
• Joborn M, Crainic TG, Gendreau M, Holmberg K, Lundgren JT (2004) Economies of scale in empty freight car distribution in scheduled railways. Transportation Sci. 38(2):121–134.Link, Google Scholar
• Jordan W, Turnquist M (1983) A stochastic dynamic network model for railroad car distribution. Transportation Sci. 17(2):123–145.Link, Google Scholar
• Lingaya N, Cordeau J-F, Desaulniers G, Desrosiers J, Soumis F (2002) Operational car assignment at via Rail Canada. Transportation Res. Part B 36(9):755–778.Crossref, Google Scholar
• Mendiratta VB, Turnquist MA (1982) A model for the management of empty freight cars. Transportation Res. Record 838:50–55.Google Scholar
• Nemani A, Ahuja R (2011) OR models in freight railroad industry. Wiley Encyclopedia of Operations Research and Management Science (John Wiley & Sons, Hoboken, NJ).Crossref, Google Scholar
• Powell WB (2007) Approximate Dynamic Programming: Solving the Curses of Dimensionality (John Wiley & Sons, New York).Crossref, Google Scholar
• Powell WB (2011) Approximate Dynamic Programming: Solving the Curses of Dimensionality, 2nd ed. (John Wiley & Sons, Hoboken, NJ).Crossref, Google Scholar
• Powell WB, Bouzaiene-Ayari B, Simão H (2006) Dynamic models for freight transportation. Laporte G, Barnhart C, eds. Handbooks in Operation Research and Management Science: Transportation, Vol. 14 (North-Holland, Amsterdam), 285–366.Google Scholar
• Powell WB, Jaillet P, Odoni A (1995) Stochastic and dynamic networks and routing. Monma C, Magnanti T, Ball M, eds. Handbook in Operations Research and Management Science, Volume on Networks (North-Holland, Amsterdam), 141–295.Google Scholar
• Powell WB, Shapiro JA, Simão HP (2001) A representational paradigm for dynamic resource transformation problems. Coullard RFC, Owens JH, eds. Annals of Operations Research (J.C. Baltzer AG, Basel, Switzerland), 231–279.Google Scholar
• Powell WB, Shapiro JA, Simão HP (2002) An adaptive dynamic programming algorithm for the heterogeneous resource allocation problem. Transportation Sci. 36(2):231–249.Link, Google Scholar
• Simão HP, Day J, George A, Gifford T, Powell WB, Nienow J (2009) An approximate dynamic programming algorithm for large-scale fleet management: A case application. Transportation Sci. 43(2):178–197.Link, Google Scholar
• Topaloglu H, Powell WB (2006) Dynamic programming approximations for stochastic, time-staged integer multicommodity flow problems. INFORMS J. Comput. 18(1):31–42.Link, Google Scholar
• Vaidyanathan B, Ahuja R (2008) Real-life locomotive planning: New formulations and computational results. Transportation Res. Part B 42(2):147–168.Crossref, Google Scholar
• Vaidyanathan B, Ahuja R, Orlin JB (2008) The locomotive routing problem. Transportation Sci. 42(4):492–507.Link, Google Scholar
• White W (1972) Dynamic transshipment networks: An algorithm and its application to the distribution of empty containers. Networks 2(3):211–236.Crossref, Google Scholar
• Ziarati K, Soumis F, Desrosiers J, Solomon M (1999) A branch-first, cut-second approach for locomotive assignment. Management Sci. 45(8):1156–1168.Link, Google Scholar
• Ziarati K, Soumis F, Desrosiers J, Gelinas S, Saintonge A (1997) Locomotive assignment with heterogeneous consists at CN North America. Eur. J. Oper. Res. 97(2):281–292.Crossref, Google Scholar