Network Migration Problem: A Hybrid Logic-Based Benders Decomposition Approach

References

• Almughaless AA, Alsaih AM (2010) Optimum migration scenario from PSTN to NGN. Luo Q, ed. Proc. IEEE Internat. Conf. Comm. Systems Networks Appl. (IEEE, Pisacataway, NJ), vol. 1, 227–231.Google Scholar
• Angulo G, Ahmed S, Dey SS (2016) Improving the integer L-shaped method. INFORMS J. Comput. 28(3):483–499.Link, Google Scholar
• Benders JF (1962) Partitioning procedures for solving mixed-variables programming problems. Numerische Mathematik 4(1):238–252.Crossref, Google Scholar
• Bley A, D’Andreagiovanni F, Karch D (2013) Scheduling technology migration in WDM networks. ITG Sympos. Photonic Networks, 1–5.Google Scholar
• Bredstrom D, Rönnqvist M (2007) A branch and price algorithm for the combined vehicle routing and scheduling problem with synchronization constraints. Technical report, Department of Finance and Management Science, Norwegian School of Economics and Business Administration, Bergen.Google Scholar
• Chvatal V (1983) Linear Programming (Macmillan, New York).Google Scholar
• Ciena (2013) The network modernization imperative. Accessed March 2, 2023, https://media.ciena.com/documents/The-Network-Modernization-Imperative_page1.pdf.Google Scholar
• Ciré AA, Coban E, Hooker JN (2016) Logic-based Benders decomposition for planning and scheduling: A computational analysis. Knowledge Engrg. Rev. 31(5):440–451.Crossref, Google Scholar
• Dawadi BR, Rawat DB, Joshi SR, Manzoni P, Keitsch MM (2021) Migration cost optimization for service provider legacy network migration to software-defined IPv6 network. Internat. J. Network Management 31(4):e2145.Crossref, Google Scholar
• Drexl M (2012) Synchronization in vehicle routing—A survey of VRPs with multiple synchronization constraints. Transportation Sci. 46(3):297–316.Link, Google Scholar
• Eksioglu B, Vural AV, Reisman A (2009) The vehicle routing problem: A taxonomic review. Comput. Indust. Engrg. 57(4):1472–1483.Crossref, Google Scholar
• Elci O, Hooker J (2020) Stochastic planning and scheduling with logic-based Benders decomposition. Preprint, submitted December 28, https://arxiv.org/abs/2012.14074.Google Scholar
• Fawaz W, Daheb B, Audouin O, Du-Pond M, Pujolle G (2004) Service level agreement and provisioning in optical networks. IEEE Comm. Magazine 42(1):36–43.Crossref, Google Scholar
• Gurobi Optimization LLC (2021) Gurobi optimizer reference manual. Accessed March 2, 2023, https://www.gurobi.com.Google Scholar
• Hashemi Doulabi H, Pesant G, Rousseau LM (2020) Vehicle routing problems with synchronized visits and stochastic travel and service times: Applications in healthcare. Transportation Sci. 54(4):1053–1072.Link, Google Scholar
• Hojabri H, Gendreau M, Potvin JY, Rousseau LM (2018) Large neighborhood search with constraint programming for a vehicle routing problem with synchronization constraints. Comput. Oper. Res. 92:87–97.Crossref, Google Scholar
• Hooker J, Ottosson G, Thorsteinsson ES, Kim HJ (2000) A scheme for unifying optimization and constraint satisfaction methods. Knowledge Engrg. Rev. 15(1):11–30.Crossref, Google Scholar
• Hooker JN (2012) Integrated Methods for Optimization, vol. 170 (Springer, Berlin).Crossref, Google Scholar
• Hooker JN, Ottosson G (2003) Logic-based Benders decomposition. Math. Programming 96(1):33–60.Crossref, Google Scholar
• Hooker JN, van Hoeve WJ (2018) Constraint programming and operations research. Constraints 23(2):172–195.Crossref, Google Scholar
• IBM® ILOG® CP® Optimizer (2021) CPLEX CP Optimizer users manual. Accessed March 2, 2023, https://www.ibm.com/analytics/cplex-cp-optimizer.Google Scholar
• Jain V, Grossmann IE (2001) Algorithms for hybrid MILP/CP models for a class of optimization problems. INFORMS J. Comput. 13(4):258–276.Link, Google Scholar
• Jaumard B, Pouya H (2018) Migration plan with minimum overall migration time or cost. J. Optical Commun. Networking 10(1):1–13.Crossref, Google Scholar
• Jaumard B, Pouya H, Fahim R, Barrios A (2016) Planning network migration. IEEE Internat. Conf. Comm. (IEEE, Piscataway, NJ), 1–6.Google Scholar
• Javad-Kalbasi M, Valaee S (2021) Efficient migration to the next generation of networks based on Digital Annealing. IEEE Internat. Conf. Acoustics Speech Signal Processing (IEEE, Piscataway, NJ), 4740–4744.Google Scholar
• Knight S, Nguyen H, Falkner N, Bowden R, Roughan M (2011) The internet topology zoo. IEEE J. Selected Areas Comm. 29(9):1765–1775.Crossref, Google Scholar
• Labadie N, Prins C, Yang Y (2014) Iterated local search for a vehicle routing problem with synchronization constraints. Vitoriano B, Pinson E, Valente F, eds. Internat. Conf. Oper. Res. Enterprise Systems (SCITEPRESS - Science and Technology Publications, Setúbal, Portugal), 257–263.Google Scholar
• Laborie P, Rogerie J, Shaw P, Vilím P (2018) IBM ILOG CP Optimizer for scheduling. Constraints 23(2):210–250.Crossref, Google Scholar
• Laporte G, Louveaux FV (1993) The integer L-shaped method for stochastic integer programs with complete recourse. Oper. Res. Lett. 13(3):133–142.Crossref, Google Scholar
• Li J, Qin H, Baldacci R, Zhu W (2020) Branch-and-price-and-cut for the synchronized vehicle routing problem with split delivery, proportional service time and multiple time windows. Transportation Res. Part E Logist. Transportation Rev. 140:101955.Crossref, Google Scholar
• Loken C, Gruner D, Groer L, Peltier R, Bunn N, Craig M, Henriques T, et al. (2010) SciNet: Lessons learned from building a power-efficient top-20 system and data centre. J. Phys. Conf. Ser. 256:012026.Crossref, Google Scholar
• Matousek J, Gärtner B (2007) Understanding and Using Linear Programming (Springer Science & Business Media, Berlin).Google Scholar
• Perron L, Furnon V (2019) OR-Tools. Accessed March 2, 2023, https://developers.google.com/optimization/.Google Scholar
• Podhradsky P (2004) Migration scenarios and convergence processes toward NGN (present state and future trends). Kos T, Grgić M, eds. IEEE Internat. Sympos. Electronics Marine (IEEE, Pisacataway, NJ), 39–46.Google Scholar
• Ponce M, van Zon R, Northrup S, Gruner D, Chen J, Ertinaz F, Fedoseev A, et al. (2019) Deploying a top-100 supercomputer for large parallel workloads: The Niagara supercomputer. Proc. Practice Experience Adv. Res. Comput. Rise Machines (Learn.) (Association for Computing Machinery, New York), 1–8.Google Scholar
• Poularakis K, Iosifidis G, Smaragdakis G, Tassiulas L (2019) Optimizing gradual SDN upgrades in ISP networks. IEEE/ACM Trans. Networking 27(1):288–301.Crossref, Google Scholar
• Pouya H (2018) New models and algorithms in telecommunication networks. Unpublished PhD thesis, Concordia University, Montreal.Google Scholar
• Pouya H, Jaumard B (2017) Efficient network migration planning. 19th Internat. Conf. Transparent Optical Networks (IEEE, Pisacataway, NJ), 1–4.Google Scholar
• Pouya H, Jaumard B, Preston-Thomas C (2017) Minimum network migration cost and duration. IEEE Sarnoff Sympos., 1–6.Google Scholar
• Reinhardt LB, Clausen T, Pisinger D (2013) Synchronized dial-a-ride transportation of disabled passengers at airports. Eur. J. Oper. Res. 225(1):106–117.Crossref, Google Scholar
• Roshanaei V, Luong C, Aleman DM, Urbach D (2017) Propagating logic-based Benders decomposition approaches for distributed operating room scheduling. Eur. J. Oper. Res. 257(2):439–455.Crossref, Google Scholar
• Rousseau LM, Gendreau M, Pesant G, Focacci F (2004) Solving VRPTWs with constraint programming based column generation. Ann. Oper. Res. 130(1–4):199–216.Crossref, Google Scholar
• Salazar-Aguilar MA, Langevin A, Laporte G (2013) The synchronized arc and node routing problem: Application to road marking. Comput. Oper. Res. 40(7):1708–1715.Crossref, Google Scholar
• Türk S, Liu Y, Radeke R, Lehnert R (2012) Network migration optimization using genetic algorithms. Information and Communication Technologies, vol. 7479, 112–123.Google Scholar
• Vance PH (1998) Branch-and-price algorithms for the one-dimensional cutting stock problem. Comput. Optim. Appl. 9(3):211–228.Crossref, Google Scholar
• Vanderbeck F (2011) Branching in branch-and-price: A generic scheme. Math. Programming 130(2):249–294.Crossref, Google Scholar