A Decomposition Method for Multiperiod Railway Network Expansion—With a Case Study for Germany

References

• Baxter M, Elgindy T, Ernst AT, Kalinowski T, Savelsbergh MWP (2014) Incremental network design with shortest paths. Eur. J. Oper. Res. 238(3):675–684.Crossref, Google Scholar
• Beck MJ (2013) Kapazitätsmanagement und Netzentwicklung: Erfahrungen mit Kompromissen zum Fahrplan 2018. Presentation by DB Netz AG, http://www.deutschland-takt.de/wp-content/uploads/2017/03/2013-08-15-Beck-Fahrplanbasierte-Infrastrukturentwicklung.pdf.Google Scholar
• Bienstock D, Raskina O, Saniee I, Wang Q (2006) Combined network design and multiperiod pricing: Modeling, solution techniques, and computation. Oper. Res. 54(2):261–276.Link, Google Scholar
• Blanco V, Puerto J, Ramos AB (2011) Expanding the Spanish high-speed railway network. Omega 39(2):138–150.Crossref, Google Scholar
• Costa AM (2005) A survey on Benders decomposition applied to fixed-charge network design problems. Comput. Oper. Res. 32(6):1429–1450.Crossref, Google Scholar
• DB Netz AG (2013) Netzkonzeption 2030: Zielnetz der DB Netz AG für die Schieneninfrastruktur im Jahr 2030. Information booklet.Google Scholar
• Dezső B, Jüttner A, Kovácsa P (2011) Lemon—An open source C++ graph template library. Electronic Notes Theoret. Comput. Sci. 264(5):23–45.Crossref, Google Scholar
• Engel K, Kalinowski T, Savelsbergh MWP (2013) Incremental network design with minimum spanning trees. Technical report, Universität Rostock, Rostock, Germany and University of Newcastle, Callaghan, Australia.Google Scholar
• Garcia B-L, Mahey P, LeBlanc LJ (1998) Iterative improvement methods for a multiperiod network design problem. Eur. J. Oper. Res. 110(1):150–165.Crossref, Google Scholar
• Gendreau M, Potvin J-Y, Smires A, Soriano P (2006) Multi-period capacity expansion for a local access telecommunications network. Eur. J. Oper. Res. 172(3):1051–1066.Crossref, Google Scholar
• Gendron B, Larose M (2014) Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design. Eur. J. Comput. Optim. 2(1–2):55–75.Crossref, Google Scholar
• Gendron B, Crainic TG, Frangioni A (2001) Bundle-based relaxation methods for multicommodity capacitated fixed charge network design. Discrete Appl. Math. 112(1–3):73–99.Crossref, Google Scholar
• Gupta A, Könemann J (2011) Approximation algorithms for network design: A survey. Surveys Oper. Res. Management Sci. 16(1):3–20.Google Scholar
• Gurobi Optimization (2014) Gurobi optimizer reference manual. http://www.gurobi.com.Google Scholar
• Holzhey M (2010) Schienennetz 2025/2030—Ausbaukonzeption für einen leistungsfähigen Schienengüterverkehr in Deutschland. Study of the KCW GmbH commissioned by the German Federal Office for the Environment, http://www.umweltbundesamt.de/sites/default/files/medien/461/publikationen/4005.pdf.Google Scholar
• Kalinowski T, Matsypurab D, Savelsbergh MW (2015) Incremental network design with maximum flows. Eur. J. Oper. Res. 242(1):51–62.Crossref, Google Scholar
• Kim BJ, Kim W, Song BH (2008) Sequencing and scheduling highway network expansion using a discrete network design model. Ann. Regional Sci. 42(3):621–642.Crossref, Google Scholar
• Kouassi R, Gendreau M, Potvin J-Y, Soriano P (2009) Heuristics for multi-period capacity expansion in local telecommunications networks. J. Heuristics 15(4):381–402.Crossref, Google Scholar
• Kuby M, Xu Z, Xie X (2001) Railway network design with multiple project stages and time sequencing. J. Geographical Systems 3(1):25–47.Crossref, Google Scholar
• Lai Y-C, Shih M-C (2013) A stochastic multi-period investment selection model to optimize strategic railway capacity planning. J. Adv. Transportation 47(3):281–296.Crossref, Google Scholar
• Marín Á, Jaramillo P (2008) Urban rapid transit network capacity expansion. Eur. J. Oper. Res. 191(1):45–60.Crossref, Google Scholar
• Minoux M (1987) Network synthesis and dynamic network optimization. Ann. Discrete Math. 31:283–324.Google Scholar
• Petersen ER, Taylor AJ (2001) An investment planning model for a new north-central railway in Brazil. Transportation Res. Part A: Policy Practice 35(9):847–862.Crossref, Google Scholar
• Pickavet M, Demeester P (1999) Long-term planning of WDM networks: A comparison between single-period and multi-period techniques. Photonic Network Comm. 1(4):331–346.Crossref, Google Scholar
• Repolho HM, Antunes AP, Church RL (2013) Optimal location of railway stations: The Lisbon–Porto high-speed rail line. Transportation Sci. 47(3):330–343.Link, Google Scholar
• Ridley TM (1968) An investment policy to reduce the travel time in a transportation network. Transportation Res. 2(4):409–424.Crossref, Google Scholar
• Scott AJ (1969) The optimal network problem: Some computational procedures. Transportation Res. 3(2):201–210.Crossref, Google Scholar
• Shulman A, Vachani R (1993) An algorithm for capacity expansion of local access networks. IEEE Trans. Comm. 41(7):1063–1073.Crossref, Google Scholar
• Spönemann JC (2013) Network design for railway infrastructure by means of linear programming. Unpublished doctoral thesis, RWTH Aachen, Aachen, Germany.Google Scholar
• Stairs S (1968) Selecting an optimal traffic network. J. Transport Econom. Policy 2(2):218–231.Google Scholar
• Statistisches Bundesamt (2016) Homepage of the Statistische Bundesamt (German Federal Statistical Office). http://www.destatis.de.Google Scholar
• Toriello A, Nemhauser G, Savelsbergh M (2010) Decomposing inventory routing problems with approximate value functions. Naval Res. Logist. 57(8):718–727.Crossref, Google Scholar