Advertisement

An Approximative Lexicographic Min-Max Approach to the Discrete Facility Location Problem

  • Ľuboš Buzna
  • Michal Koháni
  • Jaroslav Janáček
Conference paper
Part of the Operations Research Proceedings book series (ORP)

Abstract

We propose a new approximative approach to the discrete facility location problem that provides solutions close to the lexicographic minimax optimum. The lexicographic minimax optimum is concept that allows to find equitable location of facilities. Our main contribution is the approximation approach, which is based on the rules allowing: (i) to take into account the multiplicities assigned to different customers; (ii) to detect whether for a given distance active customers can reach higher, equal or smaller distance to the closest located facility; and (iii) to use methods customized for solving the p-median problem. Customized methods can handle larger problems than state-of-the-art general purpose integer programming solvers. We use the resulting algorithm to perform extensive study using the well-known benchmarks and benchmarks derived from the real-world road network data. We demonstrate that our algorithm allows to solve larger problems than existing algorithms and provides high-quality solutions. The algorithm found the optimal solution for all tested benchmarks, where we could compare the results with the exact algorithm.

Notes

Acknowledgments

This work was supported by the research grants VEGA 1/0339/13 and VEGA 1/0463/16.

References

  1. 1.
    Ogryczak, W.: On the lexicographic minmax approach to location problems. Eur. J. Oper. Res. 100, 566–585 (1997)CrossRefGoogle Scholar
  2. 2.
    Ogryczak, W., Śliwiński, T.: On direct methods for lexicographic min-max optimization. In: Cigarillo, M., Gervasi, O., Kumar, V., Tan, C., Taniar, D., Laganá, A., Mun, Y., Choo, H. (eds.) Computational Science and Its Applications—ICCSA 2006, Lecture Notes in Computer Science, pp. 802–811. Springer, Berlin (2006)Google Scholar
  3. 3.
    Luss, H.: Equitable Resources Allocation: Models, Algorithms and Applications, Wiley (2012). ISBN: 978-1-118-05468-0Google Scholar
  4. 4.
    Buzna, Ľ., Koháni, M., Janáček, J.: An approximation algorithm for the facility location problem with lexicographic minimax objective. J. Appl. Math. 2014 (562373) (2014)Google Scholar
  5. 5.
    García, S., Labbé, M., Marín, A.: Solving large p-median problems with a radius formulation. INFORMS J. Comput. 23(4), 546–556 (2011)CrossRefGoogle Scholar
  6. 6.
    Lorena, L.A., Senne, E.L.: A column generation approach to capacitated p-median problems. Comput. Oper. Res. 31(6), 863–876 (2004)CrossRefGoogle Scholar
  7. 7.
    Díaz, J.A., Fernández, E.: Hybrid scatter search and path relinking for the capacitated p-median problem. Eur. J. Oper. Res. 169(2), 570–585 (2006)Google Scholar
  8. 8.
    Reinelt, G.: The traveling salesman: Computational Solutions for TSP Applications. Springer, Berlin, Heidelberg (1994). ISBN: 3-540-58334-3Google Scholar
  9. 9.
    Data describing the road network of the Slovak Republic were purchased from the publisher MAPA Slovakia Plus s.r.o www.mapaslovakia.sk. Accessed 22 June 2014
  10. 10.
    United States Census Database: http://www.nationalatlas.gov/mld/ce2000t.html (2000) Accessed 22 June 2014

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  • Ľuboš Buzna
    • 1
  • Michal Koháni
    • 1
  • Jaroslav Janáček
    • 1
  1. 1.Department of Mathematical Methods and Operations ResearchUniversity of ZilinaZilinaSlovakia

Personalised recommendations