Exactly solving a two-level location problem with modular node capacities

Networks

Volumn 59, Issue 1, 2012, Pages 161-180

  Addis, Bernardetta ^a   Carello, Giuliana ^b   Ceselli, Alberto ^c  

^a UNIVERSITY OF TURIN   (Italy)

^b POLITECNICO DI MILANO   (Italy)

^c UNIVERSITY OF MILAN   (Italy)

Author keywords

branch and price; column generation; discretization; location; telecommunications

Indexed keywords

BRANCH AND PRICE; COLUMN GENERATION; COMPACT FORMULATIONS; DESIGN PHASE; DIFFERENT SERVICES; DISCRETIZATIONS; FACILITY LOCATIONS; LOCATION PROBLEMS; NETWORK TOPOLOGY; NODE CAPACITY; OPTIMIZATION ALGORITHMS;

ALGORITHMS; ELECTRIC NETWORK TOPOLOGY; OPTIMIZATION; TELECOMMUNICATION; TELECOMMUNICATION NETWORKS; TELECOMMUNICATION SERVICES;

LOCATION;

EID: 83555163658     PISSN: 00283045     EISSN: 10970037     Source Type: Journal    
DOI: 10.1002/net.20486     Document Type: Article

References (33)

1. T. Achterberg, Constraint integer programming, PhD Thesis, Technische Universität Berlin, 2007 (available online).
2. B. Addis, G. Carello, and, A. Ceselli, A computational study of a two-level location problem with modular node capacitaties, Technical report, D.T.I. - Università degli Studi di Milano, 2011.
3. R. K. Ahuja, J. B. Orlin, S. Pallottino, M. P. Scaparra, and, M. G. Scutellà, A multi-exchange heuristic for the single source capacitated facility location problem, Manage Sci 50 (2004), 749-760.
4. A. Amiri, Designing a distribution network in a supply chain system: Formulation and efficient solution procedure, Eur J Oper Res 171 (2006), 567-576. (Pubitemid 41706214)
5. S. Bregni, Synchronization of digital telecommunications networks, Wiley, Chichester, UK, 2002.
6. A. Ceselli, F. Liberatore, and, G. Righini, A computational evaluation of a general branch-and-price framework for capacitated network location problems, Ann Oper Res 167 (2008), 209-252.
7. S. Chamberland, An efficient algorithm for designing reliable IP networks with an Access/Edge/Core hierarchical structure, Networks 2008, Conference Presentation, Budapest (2008).
8. P. Chardaire, J.-L. Lutton, and, A. Sutter, Upper and lower bounds for the two-level simple plant location problem, Ann Oper Res 86 (1999), 117-140.
9. I. Correia, and, M. E. Captivo, A lagrangean heuristic for a modular capacitated location problem, Ann Oper Res 122 (2003), 141-161. (Pubitemid 38103395)
10. I. Correia, L. Gouveia, and, F. Saldanha-da-Gama, Discretized formulations for capacitated location problems with modular distribution costs, Eur J Oper Res 204 (2010), 237-244.
11. G. Desaulniers, J. Desrosiers, and, M. M. Solomon, editors, Column generation, Springer-Verlag, New York, USA, 2005.
12. Z. Drezner, and, H. W. Hamacher, editors, Facility location: Applications and theory, Springer-Verlag, Berlin, 2004.
13. D. Du, X. Wang, and, D. Xu, An approximation algorithm for the k-level capacitated facility location problem, J Comb Optim 20 (2010), 361-368.
14. S. Elhedhli, and, F. Gzara, Integrated design of supply chain networks with three echelons, multiple commodities and technology selection, IIE Trans 40 (2008), 31-44. (Pubitemid 350110974)
15. A. F. Gabor, and, J. K. C. W. van Ommeren, A new approximation algorithm for the multilevel facility location problem, Discr Appl Math 158 (2010), 453-460.
16. B. Gendron, and, F. Semet, Formulations and relaxations for a multi-echelon capacitated location-distribution problem, Comput Oper Res 36 (2009), 1335-1355.
17. L. Gouveia, A 2n constraint formulation for the capacitated minimal spanning tree problem, Oper Res 43 (1995), 130-141.
18. L. Gouveia, and, F. Saldanha-da-Gama, On the capacitated concentrator location problem: A reformulation by discretization, Comput Oper Res 33 (2006), 1242-1258. (Pubitemid 41428289)
19. K. Holmberg, M. Ronnqvist, and, D. Yuan, An exact algorithm for the capacitated facility location problem with single sourcing, Eur J Oper Res 113 (1999), 544-559.
20. A. A. V. Ignacio, V. J. M. F. Filho, and, R. D. Galvao, Lower and upper bounds for a two-level hierarchical location problem in computer networks, Comput Oper Res 35 (2008), 1982-1998. (Pubitemid 47616270)
21. ILOG CPLEX 11.0 Users Manual, ILOG Inc., Paris, France, 2007.
22. H. Kellerer, U. Pferschy, and, D. Pisinger, editors, Knapsack problems, Springer-Verlag, Berlin, Germany, 2004.
23. A. Klose, and, A. Drexl, Facility location models for distribution system design, Eur J Oper Res 162 (2005), 4-29.
24. M. Landete, and, A. Marin, New facets for the two-stage uncapacitated facility location polytope, Comput Optim Appl 44 (2009), 487-519.
25. M. Maric, An efficient genetic algorithm for solving the multi-level uncapacitated facility location problem, Comput Inform 29 (2010), 183-201.
26. M. T. Melo, S. Nickel, and, F. Saldanha da Gama, Dynamic multi-commodity capacitated facility location: A mathematical modeling framework for strategic supply chain planning, Comput Oper Res 33 (2006), 181-208. (Pubitemid 40915206)
27. A. Pessoa, E. Uchoa, and, M. Poggi de Aragao, A new stabilization method for column generation, Column Generation Workshop, Conference Presentation, Aussois (2008).
28. D. Pisinger, A minimal algorithm for the 0-1 knapsack problem, Oper Res 45 (1997), 758-767. (Pubitemid 127684747)
29. G. Sahin, and, H. Süral, A review of hierarchical facility location models, Comput Oper Res 34 (2007), 2310-2331. (Pubitemid 46073424)
30. D. Tcha, and, B. Lee, A branch-and-bound algorithm for the multi-level uncapacitated location problem, Eur J Oper Res 18 (1984), 35-43. (Pubitemid 15460529)
31. S. Tragantalerngsak, J. Holt, and, M. Ronnqvist, An exact method for the two-echelon, single-source, capacitated facility location problem, Eur J Oper Res 123 (2000), 473-489.
32. M. Trampont, C. Destr, and, A. Faye, Solving a hierarchical network design problem with two stabilized column generation approaches, INOC 2009-International Network Optimization Conference, Pisa (2009).
33. J. M. Valerio de Carvalho, Using extra dual cuts to accelerate column generation, INFORMS J Comput 17 (2005), 175-182. (Pubitemid 40891127)