Optimization Methods for Multistage Freight Train Formation

References

• Achterberg T (2009) SCIP: Solving constraint integer programs. Math. Programming Comput. 1(1):1–41.Crossref, Google Scholar
• Ahuja RK, Jha KC, Liu J (2007) Solving real-life railroad blocking problems. Interfaces 37(5):404–419.Link, Google Scholar
• Ahuja RK, Magnanti TL, Orlin JB (1993) Network Flows: Theory, Algorithms, and Applications (Prentice Hall, Englewood Cliffs, NJ).Google Scholar
• Assad AA (1983) Analysis of rail classification policies. INFOR 21(4):293–314.Google Scholar
• Averstad KÅ (2006a) Handbok BRÖH 313.00700: Trafikeringsplan Hallsberg rangerbangård. Banverket, Sweden.Google Scholar
• Averstad KÅ (2006b) Handbok BRÖH 313.00001: Anlaggnings beskrivning Hallsberg rangerbangård. Banverket, Sweden.Google Scholar
• Barnhart C, Jin H, Vance PH (2000) Railroad blocking: A network design application. Oper. Res. 48(4):603–614.Link, Google Scholar
• Barnhart C, Johnson EL, Nemhauser GL, Savelsbergh MWP, Vance PH (1998) Branch-and-price: Column generation for solving huge integer programs. Oper. Res. 46(3):316–329.Link, Google Scholar
• Bodin LD, Golden BL, Schuster AD, Romig W (1980) A model for the blocking of trains. Transportation Res. Part B 14(1):115–120.Crossref, Google Scholar
• Bohlin M, Dahms F, Flier H, Gestrelius S (2012) Optimal freight train classification using column generation. Delling D, Liberti L, eds. Proc. 12th Workshop on Algorithmic Approaches for Transportation Modelling, Optim., Systems, Vol. 25 (Schloss Dagstuhl–Leibniz-Zentrum für Informatik, Dagstuhl, Germany), 10–22.Google Scholar
• Bohlin M, Flier H, Maue J, Mihalák M (2010) Hump yard track allocation with temporary car storage. Technical Report T2010:09, Swedish Institute of Computer Science (SICS), Sweden.Google Scholar
• Bohlin M, Flier H, Maue J, Mihalák M (2011) Track allocation in freight-train classification with mixed tracks. Caprara A, Kontogiannis S, eds. Proc. 11th Workshop on Algorithmic Approaches for Transportation Modelling, Optim., Systems, Vol. 20 (Schloss Dagstuhl–Leibniz-Zentrum für Informatik, Dagstuhl, Germany), 38–51.Google Scholar
• Bohlin M, Gestrelius S, Dahms F, Mihalak M, Flier H (2013) Optimized shunting with mixed-usage tracks. Technical Report T2013:06, Swedish Institute of Computer Science (SICS), Sweden.Google Scholar
• Bonomo F, Cecowski M (2005) Between coloring and list-coloring: μ-coloring. Electronic Notes Discrete Math. 19:117–123.Crossref, Google Scholar
• Bonomo F, Durán G, Marenco J (2009) Exploring the complexity boundary between coloring and list-coloring. Ann. Oper. Res. 169(1):3–16.Crossref, Google Scholar
• Boysen N, Fliedner M, Jaehn F, Pesch E (2012) Shunting yard operations: Theoretical aspects and applications. Eur. J. Oper. Res. 220(1):1–14.Crossref, Google Scholar
• Büsing C, Maue J (2010) Robust algorithms for sorting railway cars. de Berg M, Meyer U, eds. Proc. 18th Annual Eur. Conf. Algorithms: Part I (Springer-Verlag, Berlin), 350–361.Crossref, Google Scholar
• Cicerone S, D’Angelo G, Di Stefano G, Frigioni D, Navarra A (2009) Recoverable robustness for train shunting problems. Algorithmic Oper. Res. 4(2):102–116.Google Scholar
• Daganzo CF, Dowling RG, Hall RW (1983) Railroad classification yard throughput: The case of multistage triangular sorting. Transportation Res. Part A 17(2):95–106.Crossref, Google Scholar
• Dahlhaus E, Horák P, Miller M, Ryan JF (2000a) The train marshalling problem. Discrete Appl. Math. 103(1–3):41–54.Crossref, Google Scholar
• Dahlhaus E, Manne F, Miller M, Ryan JF (2000b) Algorithms for combinatorial problems related to train marshalling. Branlovic L, Ryan J, eds. Proc. 11th Australasian Workshop on Combinatorial Algorithms, (University of Newcastle, Callaghan, Australia)7–16.Google Scholar
• Desaulniers G, Desrosiers J, Solomon MM (2005) Column Generation. (Springer, New York).Crossref, Google Scholar
• Desrosiers J, Lübbecke ME (2005) A primer in column generation. Desaulniers G, Desrosiers J, Solomon MM, eds. Column Generation (Springer, Berlin), 1–32.Crossref, Google Scholar
• Desrosiers J, Dumas Y, Solomon MM, Soumis F (1995) Time constrained routing and scheduling. Ball MO, Magnanti TL, Nemhauser GL, eds. Network Routing, Handbooks in Operations Research and Management Science, Vol. 8 (Elsevier, Amsterdam), 35–139.Google Scholar
• Gatto M, Maue J, Mihalák M, Widmayer P (2009) Shunting for dummies: An introductory algorithmic survey. Ahuja RK, Möhring RF, Zaroliagis CD, eds. Robust and Online Large-Scale Optimization. Lecture Notes Comput. Sci., Vol. 5868 (Springer, Berlin), 310–337.Crossref, Google Scholar
• Gilmore PC, Gomory RE (1965) Multistage cutting stock problems of two and more dimensions. Oper. Res. 13(1):94–120.Link, Google Scholar
• Golumbic MC (2004) Algorithmic Graph Theory and Perfect Graphs. Annals of Discrete Mathematics, 2nd ed. (Elsevier Science, Amsterdam).Google Scholar
• Gorman MF (1998) An application of genetic and tabu searches to the freight railroad operating plan problem. Ann. Oper. Res. 78:51–69.Crossref, Google Scholar
• Güçlü T (2012) Ein Spaltengenerierungsansatz für die Zuordnung von Güterzügen. Master’s thesis, Chair of Operations Research, RWTH Aachen University, Aachen, Germany.Google Scholar
• Hall P (1935) On representatives of subsets. J. London Math. Soc. 10(1):26–30.Crossref, Google Scholar
• Huntley CL, Brown DE, Sappington DE, Markowicz BP (1995) Freight routing and scheduling at CSX transportation. Interfaces 25(3):58–71.Link, Google Scholar
• Jacob R, Márton P, Maue J, Nunkesser M (2011) Multistage methods for freight train classification. Networks 57(1):87–105.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
• Krell K (1962) Grundgedanken des Simultanverfahrens. Rangiertechnik 22:15–23.Google Scholar
• Liebchen C, Lübbecke M, Möhring R, Stiller S (2009) The concept of recoverable robustness, linear programming recovery, and railway applications. Ahuja RK, Möhring RH, Zaroliagis CD, eds. Robust and Online Large-Scale Optimization. Lecture Notes Comput. Sci., Vol. 5868 (Springer, Berlin), 1–27.Crossref, Google Scholar
• Maue J, Nunkesser M (2009) Evaluation of computational methods for freight train classification schedules. Technical Report TR-0184, ARRIVAL Project, CTI, Patra.Google Scholar
• McKee TA, McMorris FR (1999) Topics in Intersection Graph Theory. Monographs on Discrete Mathematics and Applications, Vol. 2 (SIAM, Philadelphia).Crossref, Google Scholar
• Nemani AK, Ahuja RK (2011) OR models in freight railroad industry. Cochran JJ, Cox LA, Keskinocak P, Kharoufeh JP, Smith JC, eds. Wiley Encyclopedia of Operations Research and Management Science (John Wiley & Sons, Inc., New York).Crossref, 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
• Ryan DM, Foster BA (1981) An integer programming approach to scheduling. Wren A, ed. Computer Scheduling of Public Transport: Urban Passenger Vehicle and Crew Scheduling (North Holland, Amsterdam), 269–280.Google Scholar
• Siddiqee MW (1972) Investigation of sorting and train formation schemes for a railroad hump yard. Newell GF, ed. Proc. 5th Internat. Symp. Theory of Traffic Flow and Transportation (Elsevier, New York), 377–387.Google Scholar
• Van Dyke CD (1986) The automated blocking model: A practical approach to freight railroad blocking plan development. Transportation Res. Forum 27:116–121.Google Scholar