Single-Car Routing in Rail Freight Transport

References

• Ahuja RK, Jha KC, Liu J (2007) Solving real-life railroad blocking problems. Interfaces 37(5):404–419.Link, Google Scholar
• Assad AA (1981) Analytical models in rail transportation: An annotated bibliography. INFOR 19(1):59–80.Google Scholar
• Assad AA (1983) Analysis of rail classification policies. INFOR 21(4):293–314.Google Scholar
• Balakrishnan A, Magnanti TL, Mirchandani P (1997) Network design. Dell’Amico M, Maffioli F, Martello S, eds. Annotated Bibliographies in Combinatorial Optimization (John Wiley & Sons Inc., Hoboken, NJ), 311–334.Google Scholar
• Balas E, Ceria S, Cornuéjols G (1993) A lift-and-project cutting plane algorithm for mixed 0-1 programs. Math. Programming 58(1–3):295–324.Crossref, Google Scholar
• Barnhart C, Jin H, Vance PH (2000) Railroad blocking: A network design application. Oper. Res. 48(4):603–614.Link, Google Scholar
• Ben-Tal A, Nemirovski A (2001) On polyhedral approximations of the second-order cone. Math. Oper. Res. 26(2):193–205.Link, Google Scholar
• Berggren L, Borwein J, Borwein P (1997) Pi: A Source Book (Springer Verlag, New York).Crossref, Google Scholar
• Bley A (2007) Routing and Capacity Optimization for IP Networks (Cuvillier Verlag, Göttingen).Google Scholar
• Bodin LD, Golden BL, Schuster AD (1980) A model for the blocking of trains. Transportation Res. Part B 14(1–2):115–120.Crossref, Google Scholar
• Crainic T, Rousseau J-M (1986) Multicommodity, multimode freight transportation: A general modeling and algorithmic framework for the service network design problem. Transportation Res. Part B 20(3):225–242.Crossref, Google Scholar
• Crainic T, Ferland J-A, Rousseau J-M (1984) A tactical planning model for rail freight transportation. Transportation Sci. 18(2):165–184.Link, Google Scholar
• Destatis (2011) Verkehr aktuell. Statistisches Bundesamt Deutschland, Wiesbaden. http://www.destatis.de/.Google Scholar
• Deutsche Bahn AG (2010) Geschäftsbericht 2010. Accessed April 21, 2011, http://www.deutschebahn.com/ecm2-db-de/gb/.Google Scholar
• Eisenblätter A, Fledderus ER, Fügenschuh A, Geerdes H-F, Heideck B, Junglas D, Koch T, Kürner T, Martin A (2003) Mathematical methods for automatic optimization of UMTS radio networks. Technical report, Zuse Institut Berlin (ZIB), Berlin.Google Scholar
• Frangioni A, Gentile C (2006) Perspective cuts for a class of convex 0-1 mixed integer programs. Math. Programming A 106(2):225–236.Crossref, Google Scholar
• Frangioni A, Gentile C (2009) A computational comparison of reformulations of the perspective relaxation: SOCP vs. cutting planes. Oper. Res. Lett. 37(3):206–210.Crossref, Google Scholar
• Frangioni A, Gentile C, Lacalandra F (2009) Tighter approximated MILP formulations for unit commitment problems. IEEE Trans. Power Systems 24(1):105–113.Crossref, Google Scholar
• Frangioni A, Gentile C, Grande E, Pacifici A (2009) Projected perspective reformulations for nonlinear network design problems. Proc. INOC2009, MD3-1, Pisa, Italy.Google Scholar
• Fügenschuh A, Martin A (2005) Computational integer programming and cutting planes. Aardal K, Nemhauser G, Weismantel R, eds. Handbooks in Operations Research and Management Science, Vol. 12 (Elsevier, Amsterdam), 69–122.Crossref, Google Scholar
• Glineur F (2000) Computational experiments with a linear approximation of second-order cone optimization. Technical report, Image Technical Report 0001, Faculté Polytechnique de Mons, Mons, Belgium.Google Scholar
• Glineur F (2001) Topics in convex optimization: Interior-point methods, conic duality and approximations. Ph.D. thesis, Service de Mathématique et de Recherche Opérationnelle, Faculté Polytechnique de Mons, Mons, Belgium.Google Scholar
• Gu Z, Nemhauser GL, Savelsbergh MWP (1999) Lifted flow cover inequalities for mixed 0-1 integer programs. Math. Programming 85(3):439–468.Crossref, Google Scholar
• Günlük O, Linderoth J (2010) Perspective reformulations of mixed integer nonlinear programs with indicator variables. Math. Programming 124(1–2):183–205.Crossref, Google Scholar
• Günlük O, Linderoth J (2011) Perspective reformulation and applications. Lee J, Leyffer S, eds. Mixed Integer Nonlinear Programming, IMA Volumes in Mathematics and Its Applications, Vol. 154 (Springer Verlag, Luxembourg), 61–92.Google Scholar
• Jacob R (2007) On shunting over a hump. Technical Report 576, Department of Computer Science, ETH Zürich, Zürich.Google Scholar
• Jacob R, Marton P, Maue J, Nunkesser M (2010) Multistage methods for freight train classification. Networks 57(1):87–105.Crossref, Google Scholar
• Jarrah AI, Johnson E, Neubert LC (2009) Large-scale, less-than-truckload service network design. Oper. Res. 57(3):609–625.Link, Google Scholar
• Keaton MH (1989) Designing optimal railroad operating plans: Lagrangian relaxation and heuristic approaches. Transportation Res. Part B 23(6):415–431.Crossref, Google Scholar
• Keaton MH (1992) Designing railroad operating plans: A dual adjustment method for implementing Lagrangian relaxation. Transportation Sci. 26(4):263–279.Link, Google Scholar
• Lübbecke ME, Zimmermann UT (2005) Shunting minimal rail car allocation. Comput. Optim. Appl. 31(3):295–308.Crossref, Google Scholar
• Nemhauser G, Wolsey LA (1999) Integer and Combinatorial Optimization (Wiley Interscience, New York).Google Scholar
• Newton H (1997) Network design under budget constraints with application to the railroad blocking problem. Ph.D. thesis, Auburn University, Auburn, AL.Google Scholar
• Newton HN, Barnhart C, Vance PH (1998) Constructing railroad blocking plans to minimize handling costs. Transportation Sci. 32(4):330–345.Link, Google Scholar
• Thomet MA (1971) A combinatorial-search approach to the freight scheduling problem. Ph.D. thesis, Carnegie Mellon University, Pittsburgh.Google Scholar