A cutting plane algorithm for the Capacitated Connected Facility Location Problem
- 509 Downloads
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.
KeywordsCapacitated network design Facility Location Connected Facility Location Mixed integer programming models Telecommunications
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.
- 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
- 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
- 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
- 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.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
- 23.IBM: CPLEX (November 22nd 2011). http://www.ilog.com/products/cplex/
- 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
- 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
- 35.Wassermann, B.: Operations Research in action: a project for designing telecommunication access networks. Ph.D. thesis, University of Vienna (2012) Google Scholar