Advertisement

Computational Optimization and Applications

, Volume 55, Issue 3, pp 647–674 | Cite as

A cutting plane algorithm for the Capacitated Connected Facility Location Problem

  • Stefan GollowitzerEmail author
  • Bernard Gendron
  • Ivana Ljubić
Article

Abstract

We consider a network design problem that arises in the cost-optimal design of last mile telecommunication networks. It extends the Connected Facility Location problem by introducing capacities on the facilities and links of the networks. It combines aspects of the capacitated network design problem and the single-source capacitated facility location problem. We refer to it as the Capacitated Connected Facility Location Problem. We develop a basic integer programming model based on single-commodity flows. Based on valid inequalities for the capacitated network design problem and the single-source capacitated facility location problem we derive several (new) classes of valid inequalities for the Capacitated Connected Facility Location Problem including cut set inequalities, cover inequalities and combinations thereof. We use them in a branch-and-cut framework and show their applicability and efficacy on a set of real-world instances.

Keywords

Capacitated network design Facility Location Connected Facility Location Mixed integer programming models Telecommunications 

Notes

Acknowledgements

The authors thank the two anonymous referees for their valuable comments and suggestions to improve the paper.

Stefan Gollowitzer was supported by the Fonds de recherche du Québec—Nature et technologies under grant 163879 within the Programme de Stages Internationaux. Ivana Ljubić was supported by an APART Fellowship of the Austrian Academy of Sciences (OEAW). This support is gratefully acknowledged.

References

  1. 1.
    Aardal, K., Pochet, Y., Wolsey, L.A.: Capacitated facility location: valid inequalities and facets. Math. Oper. Res. 20(3), 562–582 (1995) MathSciNetzbMATHCrossRefGoogle Scholar
  2. 2.
    Arulselvan, A., Bley, A., Gollowitzer, S., Ljubic, I., Maurer, O.: MIP modeling of incremental connected facility location. In: Pahl, J., Reiners, T., Voß, S. (eds.) INOC. Lecture Notes in Computer Science, vol. 6701, pp. 490–502. Springer, Berlin (2011) Google Scholar
  3. 3.
    Bardossy, M.G., Raghavan, S.: Dual-based local search for the connected facility location and related problems. INFORMS J. Comput. 22(4), 584–602 (2010) MathSciNetzbMATHCrossRefGoogle Scholar
  4. 4.
    Ceselli, A., Liberatore, F., Righini, G.: A computational evaluation of a general branch-and-price framework for capacitated network location problems. Ann. Oper. Res. 167(1), 209–251 (2009) MathSciNetCrossRefGoogle Scholar
  5. 5.
    Chouman, M., Crainic, T.G., Gendron, B.: Commodity representations and cutset-based inequalities for multicommodity capacitated fixed-charge network design. Tech. rep. CIRRELT-2011-56, Interuniversity Research Centre on Enterprise Networks, Logistics and Transportation (CIRRELT), CIRRELT (2011) Google Scholar
  6. 6.
    Contreras, I.A., Díaz, J.A.: Scatter search for the single source capacitated facility location problem. Ann. Oper. Res. 157(1), 73–89 (2008) MathSciNetzbMATHCrossRefGoogle Scholar
  7. 7.
    Costa, A.M., Cordeau, J.F., Gendron, B.: Benders, metric and cutset inequalities for multicommodity capacitated network design. Comput. Optim. Appl. 42, 371–392 (2009) MathSciNetzbMATHCrossRefGoogle Scholar
  8. 8.
    Crainic, T.G., Gendreau, M.: Cooperative parallel tabu search for capacitated network design. J. Heuristics 8(6), 601–627 (2002) CrossRefGoogle Scholar
  9. 9.
    Crainic, T.G., Gendreau, M., Farvolden, J.M.: A simplex-based tabu search method for capacitated network design. INFORMS J. Comput. 12(3), 223–236 (2000) MathSciNetzbMATHCrossRefGoogle Scholar
  10. 10.
    Crainic, T.G., Frangioni, A., Gendron, B.: Bundle-based relaxation methods for multicommodity capacitated fixed charge network design. Discrete Appl. Math. 112(1–3), 73–99 (2001) MathSciNetzbMATHCrossRefGoogle Scholar
  11. 11.
    Crainic, T.G., Gendron, B., Hernu, G.: A slope scaling/Lagrangean perturbation heuristic with long-term memory for multicommodity capacitated fixed-charge network design. J. Heuristics 10(5), 525–545 (2004) zbMATHCrossRefGoogle Scholar
  12. 12.
    Deng, Q., Simchi-Levi, D.: Valid inequalities, facets and computational results for the capacitated concentrator location problem. Tech. rep., Department of Industrial Engineering and Operations Research, Columbia University, New York (1992) Google Scholar
  13. 13.
    Diaz, J.A., Fernández, E.: A branch-and-price algorithm for the single source capacitated plant location problem. J. Oper. Res. Soc. 53, 728–740 (2002) zbMATHCrossRefGoogle Scholar
  14. 14.
    Eisenbrand, F., Grandoni, F., Rothvoß, T., Schäfer, G.: Connected facility location via random facility sampling and core detouring. J. Comput. Syst. Sci. 76, 709–726 (2010) zbMATHCrossRefGoogle Scholar
  15. 15.
    Gendron, B., Larose, M.: Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design. Tech. rep. CIRRELT-2012-74, Interuniversity Research Centre on Enterprise Networks, Logistics and Transportation (CIRRELT), CIRRELT (2012) Google Scholar
  16. 16.
    Gendron, B., Crainic, T.G., Frangioni, A.: Multicommodity capacitated network design. In: Sanso, B., Soriano, P. (eds.) Telecommunications Network Planning, pp. 1–19. Kluwer Academics, Norwell (1998) Google Scholar
  17. 17.
    Ghamlouche, I., Crainic, T.G., Gendreau, M.: Cycle-based neighbourhoods for fixed-charge capacitated multicommodity network design. Oper. Res. 51(4), 655–667 (2003) MathSciNetzbMATHCrossRefGoogle Scholar
  18. 18.
    Ghamlouche, I., Crainic, T.G., Gendreau, M.: Path relinking, cycle-based neighbourhoods and capacitated multicommodity network design. Ann. Oper. Res. 131(1–4), 109–133 (2004) MathSciNetzbMATHCrossRefGoogle Scholar
  19. 19.
    Gollowitzer, S., Ljubić, I.: MIP models for connected facility location: a theoretical and computational study. Comput. Oper. Res. 38(2), 435–449 (2011) MathSciNetzbMATHCrossRefGoogle Scholar
  20. 20.
    Hewitt, M., Nemhauser, G.L., Savelsbergh, M.W.P.: Combining exact and heuristic approaches for the capacitated fixed-charge network flow problem. INFORMS J. Comput. 22(2), 314–325 (2010) MathSciNetzbMATHCrossRefGoogle Scholar
  21. 21.
    Holmberg, K., Yuan, D.: A Lagrangian heuristic based branch-and-bound approach for the capacitated network design problem. Oper. Res. 48, 461–481 (2000) MathSciNetzbMATHCrossRefGoogle Scholar
  22. 22.
    Holmberg, K., Rönnqvist, M., Yuan, D.: An exact algorithm for the capacitated facility location problems with single sourcing. Eur. J. Oper. Res. 113(3), 544–559 (1999) zbMATHCrossRefGoogle Scholar
  23. 23.
    IBM: CPLEX (November 22nd 2011). http://www.ilog.com/products/cplex/
  24. 24.
    Kaparis, K., Letchford, A.N.: Separation algorithms for 0–1 knapsack polytopes. Math. Program. 124(1–2), 69–91 (2010) MathSciNetzbMATHCrossRefGoogle Scholar
  25. 25.
    Katayama, N., Chen, M., Kubo, M.: A capacity scaling heuristic for the multicommodity capacitated network design problem. J. Comput. Appl. Math. 232(1), 90–101 (2009) MathSciNetzbMATHCrossRefGoogle Scholar
  26. 26.
    Kliewer, G., Timajev, L.: Relax-and-cut for capacitated network design. In: Brodal, G.S., Leonardi, S. (eds.) ESA. Lecture Notes in Computer Science, vol. 3669, pp. 47–58. Springer, Berlin (2005) Google Scholar
  27. 27.
    Leitner, M., Raidl, G.R.: Branch-and-cut-and-price for capacitated connected facility location. J. Math. Model. Algorithms 10(3), 245–267 (2011) MathSciNetzbMATHCrossRefGoogle Scholar
  28. 28.
    Ljubić, I.: A hybrid VNS for connected facility location. In: Bartz-Beielstein, T., Aguilera, M.J.B., Blum, C., Naujoks, B., Roli, A., Rudolph, G., Sampels, M. (eds.) Hybrid Metaheuristics. Lecture Notes in Computer Science, vol. 4771, pp. 157–169. Springer, Berlin (2007) CrossRefGoogle Scholar
  29. 29.
    Ljubić, I., Putz, P., Salazar-González, J.: Exact approaches to the single-source network loading problem. Networks 59(1), 89–106 (2012) MathSciNetzbMATHCrossRefGoogle Scholar
  30. 30.
    Putz, P.: Fiber to the home, cost optimal design of last-mile broadband telecommunication networks. Ph.D. thesis, University of Vienna (2012) Google Scholar
  31. 31.
    Raghavan, S., Stanojević, D.: A note on search by objective relaxation. In: Telecommunications Planning: Innovations in Pricing, Network Design and Management. Operations Research/Computer Science Interfaces Series, vol. 33, pp. 181–201. Springer, Berlin (2006) CrossRefGoogle Scholar
  32. 32.
    Rodríguez-Martín, I., Salazar-González, J.J.: A local branching heuristic for the capacitated fixed-charge network design problem. Comput. Oper. Res. 37(3), 575–581 (2010) MathSciNetzbMATHCrossRefGoogle Scholar
  33. 33.
    Salman, F.S., Ravi, R., Hooker, J.N.: Solving the capacitated local access network design problem. INFORMS J. Comput. 20(2), 243–254 (2008) MathSciNetzbMATHCrossRefGoogle Scholar
  34. 34.
    Sellmann, M., Kliewer, G., Koberstein, A.: Lagrangian cardinality cuts and variable fixing for capacitated network design. In: Möhring, R., Raman, R. (eds.) Algorithms—ESA 2002. Lecture Notes in Computer Science, vol. 2461, pp. 845–858. Springer, Berlin (2002) CrossRefGoogle Scholar
  35. 35.
    Wassermann, B.: Operations Research in action: a project for designing telecommunication access networks. Ph.D. thesis, University of Vienna (2012) Google Scholar

Copyright information

© Springer Science+Business Media New York 2013

Authors and Affiliations

  • Stefan Gollowitzer
    • 1
    Email author
  • Bernard Gendron
    • 2
  • Ivana Ljubić
    • 1
  1. 1.Department of Statistics and Operations Research, Faculty of Business, Economics, and StatisticsUniversity of ViennaViennaAustria
  2. 2.Interuniversity Research Centre on Enterprise Networks, Logistics and Transportation (CIRRELT), and Department of Computer Science and Operations ResearchUniversité de MontréalMontrealCanada

Personalised recommendations