Advertisement

MIP Modeling of Incremental Connected Facility Location

  • Ashwin Arulselvan
  • Andreas Bley
  • Stefan Gollowitzer
  • Ivana Ljubić
  • Olaf Maurer
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6701)

Abstract

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.

Keywords

Facility Location Valid Inequality Greedy Randomize Adaptive Search Procedure Facility Location Problem Steiner Tree Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
  2. 2.
    Albareda-Sambola, M., Fernández, E., Hinojosa, Y., Puerto, J.: The multi-period incremental service facility location problem. Computers & Operations Research 36, 1356–1375 (2009)CrossRefzbMATHGoogle Scholar
  3. 3.
    Bardossy, M.G., Raghavan, S.: Dual-Based Local Search for the Connected Facility Location and Related Problems. INFORMS Journal on Computing 22(4), 584–602 (2010)MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
  5. 5.
    Bienstock, D., Raskina, O., Saniee, I., Wang, Q.: Combined network design and multiperiod pricing: Modeling, solution techniques, and computation. Operations Research 54(2), 261–276 (2006)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Christofides, N., Brooker, P.: Optimal expansion of an existing network. Mathematical Programming 6, 197–211 (1974)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Doulliez, P.J., Rao, M.R.: Optimal network capacity planning: A shortest-path scheme. Operations Research 23(4), 810–818 (1975)CrossRefzbMATHGoogle Scholar
  8. 8.
    Eisenbrand, F., Grandoni, F., Rothvoß, T., Schäfer, G.: Connected facility location via random facility sampling and core detouring. Journal of Computer and System Sciences 76, 709–726 (2010)MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    Gollowitzer, S., Ljubić, I.: MIP models for connected facility location: A theoretical and computational study. Computers & Operations Research 38(2), 435–449 (2011)MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    Koch, T., Martin, A.: Solving Steiner tree problems in graphs to optimality. Networks 32, 207–232 (1998)MathSciNetCrossRefzbMATHGoogle Scholar
  11. 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
  12. 12.
    Ljubić, I.: A hybrid VNS for connected facility location. In: Bartz-Beielstein, T., Blesa Aguilera, M.J., Blum, C., Naujoks, B., Roli, A., Rudolph, G., Sampels, M. (eds.) HCI/ICCV 2007. LNCS, vol. 4771, pp. 157–169. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  13. 13.
    Owen, S.H., Daskin, M.S.: Strategic facility location: A review. European Journal of Operational Research 111(3), 423–447 (1998)CrossRefzbMATHGoogle Scholar
  14. 14.
    Suhl, U.H., Hilbert, H.: A branch-and-cut algorithm for solving generalized multiperiod Steiner problems in graphs. Networks 31(4), 273–282 (1998)MathSciNetCrossRefzbMATHGoogle Scholar
  15. 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
  16. 16.
    Ukkusuri, S.V., Patil, G.: Multi-period transportation network design under demand uncertainty. Transportation Research Part B: Methodological 43(6), 625–642 (2009)CrossRefGoogle Scholar
  17. 17.
    Zadeh, N.: On building minimum cost communication networks over time. Networks 4(1), 19–34 (1974)MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Ashwin Arulselvan
    • 1
  • Andreas Bley
    • 1
  • Stefan Gollowitzer
    • 2
  • Ivana Ljubić
    • 3
  • Olaf Maurer
    • 1
  1. 1.MATHEONTechnische Universität BerlinBerlinGermany
  2. 2.Department of Statistics and Operations ResearchUniversity of ViennaAustria
  3. 3.Institute of Computer Graphics and AlgorithmsVienna University of TechnologyAustria

Personalised recommendations