MIP Modeling of Incremental Connected Facility Location
We consider the incremental connected facility location problem, in which we are given a set of potential facilities, a set of interconnection nodes, a set of customers with demands, and a planning horizon. For each time period, we have to select a set of facilities to open, a set of customers to be served, the assignment of these customers to the open facilities, and a network that connects the open facilities. Once a customer is served, it must also be served in subsequent periods. Furthermore, in each time period the total demand of all customers served must be at least equal to a given minimum coverage requirement for that period. The objective is to maximize the net present value of the network, which is given by the discounted revenues of serving the customers and by the discounted investments and maintenance costs for the facilities and the network. We study different MIP models for this problem, discuss some valid inequalities to strengthen these formulations, and present a branch and cut algorithm for finding its solution. Finally, we report (preliminary) computational results of our implementation of this algorithm.
KeywordsFacility Location Valid Inequality Greedy Randomize Adaptive Search Procedure Facility Location Problem Steiner Tree Problem
Unable to display preview. Download preview PDF.
- 4.Beasley, J.E.: OR-library, http://people.brunel.ac.uk/~mastjjb/jeb/orlib/steininfo.html
- 11.Lardeux, B., Nace, D.: Multi-period network design of optical transmission networks. In: 12th IEEE Symposium on Computers and Communications, ISCC 2007, pp. 935–940 (2007)Google Scholar
- 15.Tomazic, A., Ljubić, I.: A GRASP algorithm for the connected facility location problem. In: Proceedings of 2008 International Symposium on Applications and the Internet (SAINT), pp. 257–260 (2008)Google Scholar