Abstract
We consider a generalization of the Connected Facility Location Problem (ConFL), suitable to model real world network extension scenarios such as fiber-to-the-curb. In addition to choosing a set of facilities and connecting them by a Steiner tree as in ConFL, we aim to maximize the resulting profit by potentially supplying only a subset of all customers. Furthermore, capacity constraints on potential facilities need to be considered. We present two mixed integer programming based approaches which are solved using branch-and-cut and branch-and-cut-and-price, respectively. By studying the corresponding polyhedra we analyze both approaches theoretically and show their advantages over previously presented models. Furthermore, using a computational study we are able to additionally show significant advantages of our models over previously presented ones from a practical point of view.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Achterberg, T.: Constraint Integer Programming. Ph.D. thesis, Technische Universität Berlin (2007)
Ahuja, R.K., Orlin, J.B., Pallottino, S., Scaparra, M.P., Scutella, M.G.: A multi-exchange heuristic for the single-source capacitated facility location problem. Manage. Sci. 50(6), 749–760 (2004)
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)
Barnhart, C., Johnson, E.L., Nemhauser, G.L., Savelsbergh, M.W.P., Vance, P.H.: Branch-and-price: Column generation for solving huge integer programs. Oper. Res. 46(3), 316–329 (1998). doi:10.1287/opre.46.3.316
Cherkassky, B.V., Goldberg, A.V.: On implementing the push-relabel method for the maximum flow problem. Algorithmica 19(4), 290–410 (1997)
Cornuejols, G., Nemhauser, G.L., Wolsey, L.A.: The uncapacitated facility location problem. In: Mirchandani, P.B., Francis, R.L. (eds.) Discrete Location Theory, pp. 119–171. Wiley (1990)
Desaulniers, G., Desrosiers, J., Solomon, M.M. (eds.): Column Generation. Springer (2005)
Eisenbrand, F., Grandoni, F., Rothvoß, T., Schäfer, G.: Approximating connected facility location problems via random facility sampling and core detouring. In: ACM-SIAM Symposium on Discrete Algorithms, pp. 1174–1183 (2008)
Elias, P., Feinstein, A., Shannon, C.: A note on the maximum flow through a network. IRE Trans. Inf. Theory 2(4), 117–119 (1956)
Ferreira, C.E., Martin, A., Weismantel, R.: Facets for the Multiple Knapsack Polytope. Tech. Rep. SC 93-04, Konrad-Zuse Zentrum für Informationstechnik (1993)
Ferreira, C.E., Martin, A., Weismantel, R.: Solving multiple knapsack problems by cutting planes. SIAM J. Optim. 6, 858–877 (1996)
Gollowitzer, S., Ljubić, I.: MIP models for connected facility location: a theoretical and computational study. Comput. Oper. Res. 38(2), 435–449 (2011)
Gupta, A., Kleinberg, J., Kumar, A., Rastogi, R., Yener, B.: Provisioning a virtual private network: a network design problem for multicommodity flow. In: Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, pp. 389–398 (2001)
Hasan, M.K., Jung, H., Chwa, K.: Approximation algorithms for connected facility location problems. J. Comb. Optim. 16(2), 155–172 (2008)
IBM: CPLEX 12.1. http://www-01.ibm.com/software/integration/optimization/cplex-optimizer. Accessed 17 March 2011
Karger, D.R., Minkoff, M.: Building Steiner trees with incomplete global knowledge. In: Proceedings of the 41st Annual Symposium on Foundations of Computer Science, pp. 613–623. IEEE Computer Society (2000)
Karp, R.M.: Reducibility among combinatorial problems. In: Miller, E., Thatcher, J.W. (eds.) Complexity of Computer Computations, pp. 85–103. Plenum Press (1972)
Khuller, S., Zhu, A.: The general Steiner tree-star problem. Inf. Process. Lett. 84(4), 215–220 (2002)
Kratica, J., Tosic, D., Filipovic, V., Ljubić, I.: Solving the simple plant location problem by genetic algorithm. RAIRO Oper. Res. 35, 127–142 (2001)
Lee, Y., Chiu, S.Y., Ryan, J.: A branch and cut algorithm for a Steiner tree-star problem. INFORMS J. Comput. 8(3), 194–201 (1996)
Lee, Y., Lu, L., Qiu, Y., Glover, F.: Strong formulations and cutting planes for designing digital data service networks. Telecommun. Syst. 2(1), 261–274 (1993)
Leitner, M., Raidl, G.R.: Variable neighborhood search for a prize collecting capacity constrained connected facility location problem. In: Proceedings of the 2008 International Symposium on Applications and the Internet, pp. 233–236. IEEE Computer Society (2008)
Leitner, M., Raidl, G.R.: Combining Lagrangian Decomposition with Very Large Scale Neighborhood Search for Capacitated Connected Facility Location. Tech. Rep. TR 186–1–09–02, Institute of Computer Graphics and Algorithms, Vienna University of Technology (2009)
Leitner, M., Raidl, G.R.: A Lagrangian decomposition based heuristic for capacitated connected facility location. In: Voß, S., Caserta, M. (eds.) Proceedings of the 8th Metaheuristic International Conference (MIC 2009). Hamburg, Germany (2009)
Ljubić, I.: A hybrid VNS for connected facility location. In: Bartz-Beielstein, T., et al. (eds.) Hybrid Metaheuristics, 4th International Workshop, HM 2007. LNCS, vol. 4771, pp. 157–169. Springer (2007)
Ljubić, I., Gollowitzer, S.: Hop Constrained Connected Facility Location. Tech. Rep. 2009–09, University of Vienna (2009)
Ljubić, I., Gollowitzer, S.: Layered Graph Approaches to the Hop Constrained Connected Facility Location Problem. Tech. Rep. 2010-08, University of Vienna (2010, submitted)
Ljubić, I., Gollowitzer, S.: Modelling the hop constrained connected facility location problem on layered graphs. In: International Symposium on Combinatorial Optimization (ISCO 2010), Electronic Notes in Discrete Mathematics, vol. 36, pp. 207–214. Hammamet, Tunisia (2010)
Magnanti, T.L., Wolsey, L.A.: Optimal trees. In: Ball, M.O., Magnanti, T.L., Monma, C.L., Nemhauser, G.L. (eds.) Handbooks in Operations Research and Management Science, vol. 7, pp. 503–615. Elsevier (1995)
Martello, S., Pisinger, D., Toth, P.: Dynamic programming and strong bounds for the 0-1 knapsack problem. Manage. Sci. 45(3), 414–424 (1999)
Raghavan, S., Bardossy, M.G.: Dual based heuristics for the connected facility location problem. In: Scutellà, M.G., et al. (eds.) Proceedings of the International Network Optimization Conference 2009 (2009)
Swamy, C., Kumar, A.: Primal-dual algorithms for connected facility location problems. Algorithmica 40(4), 245–269 (2004)
Tomazic, A., Ljubić, I.: A GRASP algorithm for the connected facility location problem. In: Proceedings of the 2008 International Symposium on Applications and the Internet, pp. 257–260. IEEE Computer Society (2008)
Winter, P.: Steiner problem in networks: a survey. Networks 17(2), 129–167 (1987)
Xu, J., Chiu, S.Y., Glover, F.: Tabu search for dynamic routing communications network design. Telecommun. Syst. 8(1), 55–77 (1997)
ZIB: SCIP 1.2.0. http://scip.zib.de. Accessed 17 March 2011
Author information
Authors and Affiliations
Corresponding author
Additional information
This work is supported by the Austrian Science Fund (FWF) under contract P20342-N13
Rights and permissions
About this article
Cite this article
Leitner, M., Raidl, G.R. Branch-and-Cut-and-Price for Capacitated Connected Facility Location. J Math Model Algor 10, 245–267 (2011). https://doi.org/10.1007/s10852-011-9153-5
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10852-011-9153-5
Keywords
- Connected facility location
- Network design
- Branch-and-cut
- Branch-and-cut-and-price
- Mixed integer programming