Mathematical formulations for multi-period network design with modular capacity adjustments

References

• Alumur SA, Nickel S, Saldanha-da-Gama F, Verter V. 2012. Multi-period reverse logistics network design. Eur J Oper Res. 220(1):67–78. doi: 10.1016/j.ejor.2011.12.045.
   Web of Science ®Google Scholar
• Alumur SA, Nickel S, Saldanha-da-Gama F, Seçerdin Y. 2016. Multi-period hub network design problems with modular capacities. Ann Oper Res. 246(1–2):289–312. doi: 10.1007/s10479-015-1805-9.
   Web of Science ®Google Scholar
• Atamtürk A, Rajan D. 2002. On splittable and unsplittable flow capacitated network design arc-set polyhedra. Math Progr. 92(2):315–333.
   Web of Science ®Google Scholar
• Balakrishnan A, Magnanti TL, Wong RT. 1995. A decomposition algorithm for local access telecommunications network expansion planning. Oper Res. 43(1):58–76. doi: 10.1287/opre.43.1.58.
   Web of Science ®Google Scholar
• Bärmann A, Martin A, Schülldorf H. 2017. A decomposition method for multiperiod railway network expansion-with a case study for Germany. Transp Sci. 51(4):1102–1121. doi: 10.1287/trsc.2017.0747.
   Web of Science ®Google Scholar
• Benhamiche A, Mahjoub AR, Perrot N, Uchoa E. 2016. Unsplittable non-additive capacitated network design using set functions polyhedra. Comput Oper Res. 66:105–115. doi: 10.1016/j.cor.2015.08.009.
   Web of Science ®Google Scholar
• Boland N, Hewitt M, Marshall L, Savelsbergh M. 2017. The continuous-time service network design problem. Oper Res. 65(5):1303–1321. doi: 10.1287/opre.2017.1624.
   Web of Science ®Google Scholar
• Borraz-Sánchez C, Bent R, Backhaus S, Hijazi H, Hentenryck PV. 2016. Convex relaxations for gas expansion planning. INFORMS J Comput. 28(4):645–656. doi: 10.1287/ijoc.2016.0697.
   Web of Science ®Google Scholar
• Chang SG, Gavish B. 1993. Telecommunications network topological design and capacity expansion: formulations and algorithms. Telecommun Syst. 1(1):99–131. doi: 10.1007/BF02136157.
   Google Scholar
• Chang SG, Gavish B. 1995. Lower bounding procedures for multiperiod telecommunications network expansion problems. Oper Res. 43(1):43–57. doi: 10.1287/opre.43.1.43.
   Web of Science ®Google Scholar
• Chouman M, Crainic TG, Gendron B. 2017. Commodity representations and cut-set-based inequalities for multicommodity capacitated fixed-charge network design. Transp Sci. 51(2):650–667. doi: 10.1287/trsc.2015.0665.
   Web of Science ®Google Scholar
• Chouman M, Crainic TG. 2021. Freight railroad service network design. In Crainic TG, Gendreau M, Gendron B, editors. Network design with applications to transportation and logistics. Cham: Springer. p. 383–426.
   Google Scholar
• Crainic TG. 2000. Service network design in freight transportation. Eur J Oper Res. 122(2):272–288. doi: 10.1016/S0377-2217(99)00233-7.
   Web of Science ®Google Scholar
• Crainic TG, Frangioni A, Gendron B. 2001. Bundle-based relaxation methods for multicommodity capacitated fixed charge network design. Discrete Appl Math. 112(1-3):73–99. doi: 10.1016/S0166-218X(00)00310-3.
   Web of Science ®Google Scholar
• Crainic, TG, Gendreau M, Gendron B, eds. 2021. Network design with applications to transportation and logistics. Cham, Switzerland: Springer.
   Google Scholar
• Christiansen M, Hellsten E, Pisinger D, Sacramento D, Vilhelmsen C. 2020. Liner shipping network design. Eur J Oper Res. 286(1):1–20. doi: 10.1016/j.ejor.2019.09.057.
   Web of Science ®Google Scholar
• Suhl UH, Hilbert H, Jans R. 1998. A branch-and-cut algorithm for solving generalized multiperiod Steiner problems in graphs. Networks: Int J. 31(4):273–282. doi: 10.1002/(SICI)1097-0037(199807)31:4<273::AID-NET7>3.0.CO;2-A.
   Web of Science ®Google Scholar
• Fragkos I, Cordeau JF, Jans R. 2021. Decomposition methods for large-scale network expansion problems. Transp Res Part B: Methodol. 144:60–80. doi: 10.1016/j.trb.2020.12.002.
   Web of Science ®Google Scholar
• Jena SD, Cordeau JF, Gendron B. 2015. Dynamic facility location with generalized modular capacities. Transp Sci. 49(3):484–499. doi: 10.1287/trsc.2014.0575.
   Web of Science ®Google Scholar
• Jena SD, Cordeau JF, Gendron B. 2016. Solving a dynamic facility location problem with partial closing and reopening. Comput Oper Res. 67:143–154. doi: 10.1016/j.cor.2015.10.011.
   Web of Science ®Google Scholar
• Hooghiemstra JS, Kroon LG, Odijk MA, Salomon M, Zwaneveld PJ. 1999. Decision support systems support the search for win-win solutions in railway network design. Interfaces. 29(2):15–32. doi: 10.1287/inte.29.2.15.
   Web of Science ®Google Scholar
• Kubat P, Smith JM. 2001. A multi-period network design problem for cellular telecommunication systems. Eur J Oper Res. 134(2):439–456. doi: 10.1016/S0377-2217(00)00271-X.
   Web of Science ®Google Scholar
• Lai YC, Shih MC. 2013. A stochastic multi-period investment selection model to optimize strategic railway capacity planning. J Adv Transp. 47(3):281–296. doi: 10.1002/atr.209.
   Web of Science ®Google Scholar
• Lardeux B, Nace D, Geffard J. 2007. Multiperiod network design with incremental routing. Networks: Int J. 50(1):109–117. doi: 10.1002/net.20171.
   Web of Science ®Google Scholar
• Luss H. 1982. Operations research and capacity expansion problems: a survey. Oper Res. 30(5):907–947. doi: 10.1287/opre.30.5.907.
   Web of Science ®Google Scholar
• Magnanti TL, Wong RT. 1984. Network design and transportation planning: models and algorithms. Transp Sci. 18(1):1–55. doi: 10.1287/trsc.18.1.1.
   Web of Science ®Google Scholar
• Marín A, Jaramillo P. 2008. Urban rapid transit network capacity expansion. Eur J Oper Res. 191(1):45–60. doi: 10.1016/j.ejor.2007.08.010.
   Web of Science ®Google Scholar
• Mauttone A, Cancela H, Urquhart ME. 2021. Public transportation. In Crainic TG, Gendreau M, Gendron B, editors. Network design with applications to transportation and logistics. Cham: Springer. p. 539–565.
   Google Scholar
• Melián B, Laguna M, Moreno-Pérez JA. 2004. Capacity expansion of fiber optic networks with WDM systems: problem formulation and comparative analysis. Comput Oper Res. 31(3):461–472. doi: 10.1016/S0305-0548(03)00011-X.
   Web of Science ®Google Scholar
• Minoux M. 1989. Networks synthesis and optimum network design problems: models, solution methods and applications. Networks. 19(3):313–360. doi: 10.1002/net.3230190305.
   Web of Science ®Google Scholar
• Ordóñez F, Zhao J. 2007. Robust capacity expansion of network flows. Networks: Int J. 50(2):136–145. doi: 10.1002/net.20183.
   Web of Science ®Google Scholar
• Papadimitriou D, Fortz B. 2014. Time-dependent combined network design and routing optimization. In: 2014 IEEE International Conference on Communications, ICC 2014, p. 1124–1130.
   Google Scholar
• Pazour J. 2008. A model to design a national high-speed network for freight distribution [master’s thesis]. Fayetteville: University of Arkansas.
   Google Scholar
• Pazour JA, Meller RD, Pohl LM. 2010. A model to design a national high-speed rail network for freight distribution. Transp Res Part A: Policy Pract. 44(3):119–135. doi: 10.1016/j.tra.2009.11.006.
   Web of Science ®Google Scholar
• Middleton RS, Bielicki JM. 2009. A scalable infrastructure model for carbon capture and storage: simCCS. Energy Policy. 37(3):1052–1060. doi: 10.1016/j.enpol.2008.09.049.
   Web of Science ®Google Scholar
• Richards FJ. 1959. A flexible growth function for empirical use. J Exp Bot. 10(2):290–301. doi: 10.1093/jxb/10.2.290.
   Web of Science ®Google Scholar
• Ukkusuri SV, Patil G. 2009. Multi-period transportation network design under demand uncertainty. Transp Res Part B: Methodol. 43(6):625–642. doi: 10.1016/j.trb.2009.01.004.
   Web of Science ®Google Scholar
• Yang H, Bell MG. 1998. Models and algorithms for road network design: a review and some new developments. Transp Rev. 18(3):257–278. doi: 10.1080/01441649808717016.
   Web of Science ®Google Scholar
• Yaghini M, Kazemzadeh MRA. 2012. A simulated annealing algorithm for unsplittable capacitated network design. Int J Ind Eng Prod Res. 23(2):91–100.
   Google Scholar