Advertisement

Computational Optimization and Applications

, Volume 73, Issue 2, pp 603–645 | Cite as

Ordered p-median problems with neighbourhoods

  • Víctor BlancoEmail author
Article
  • 97 Downloads

Abstract

In this paper, we introduce a new variant of the p-median facility location problem in which it is assumed that the exact location of the potential facilities is unknown. Instead, each of the facilities must be located in a region around their initially assigned location (the neighborhood). In this problem, two main decisions have to be made simultaneously: the determination of the potential facilities that must be open to serve the customers’ demand and the location of the open facilities in their neighborhoods, at global minimum cost. We present several mixed integer non-linear programming formulations for a wide family of objective functions which are common in Location Analysis: ordered median functions. We also develop two math-heuristic approaches for solving the problem. We report the results of extensive computational experiments.

Keywords

Facility location Mixed integer second order cone programming Neighborhoods Ordered median 

Mathematics Subject Classification

90B85 90C22 90C30 47A30 

Notes

Acknowledgements

The author was partially supported by Project MTM2016-74983-C2-1-R (MINECO, Spain), the research group SEJ-534 (Junta de Andalucía) and the research project PP2016-PIP06 (Universidad de Granada). The author would like to thank the anonymous reviewers for their valuable comments and suggestions to improve the quality of the paper.

References

  1. 1.
    Albareda-Sambola, M., Fernández, E., Hinojosa, Y., Puerto, J.: The multi-period incremental service facility location problem. Comput. Oper. Res. 36(5), 1356–1375 (2009)zbMATHGoogle Scholar
  2. 2.
    Albareda-Sambola, M., Fernández, E., Saldanha-da Gama, F.: The facility location problem with bernoulli demands. Omega 39(3), 335–345 (2011)Google Scholar
  3. 3.
    Blanco, V., El Haj Ben Ali, S., Puerto, J.: Minimizing ordered weighted averaging of rational functions with applications to continuous location. Comput. Oper. Res. 40(5), 1448–1460 (2013)MathSciNetzbMATHGoogle Scholar
  4. 4.
    Blanco, V., Fernández, E., Puerto, J.: Mathematical programming formulations and solution approaches for minimum spanning trees with neighborhoods. Eur. J. Oper. Res. 262(3), 863–878 (2017)zbMATHGoogle Scholar
  5. 5.
    Blanco, V., Puerto, J., El Haj Ben Ali, S.: Revisiting several problems and algorithms in continuous location with \(\ell _\tau \)-norms. Comput. Optim. Appl. 58(3), 563–595 (2014)MathSciNetzbMATHGoogle Scholar
  6. 6.
    Blanco, V., Puerto, J., El-Haj Ben-Ali, S.: Continuous multifacility ordered median location problems. Eur. J. Oper. Res. 250(1), 56–64 (2016)MathSciNetzbMATHGoogle Scholar
  7. 7.
    Boland, N., Domínguez-Marín, P., Nickel, S., Puerto, J.: Exact procedures for solving the discrete ordered median problem. Comput. Oper. Res. 33(11), 3270–3300 (2006)zbMATHGoogle Scholar
  8. 8.
    Cooper, L.: Bounds on the weber problem solution under conditions of uncertainty. J. Reg. Sci. 18(1), 87–92 (1978)Google Scholar
  9. 9.
    Correia, I., Nickel, S., Saldanha-da Gama, F.: A stochastic multi-period capacitated multiple allocation hub location problem: formulation and inequalities. Omega 74, 122–134 (2018)Google Scholar
  10. 10.
    Correia, I., Saldanha da Gama, F.: Facility location under uncertainty, pp. 177–203. Springer, Berlin (2015)Google Scholar
  11. 11.
    de Berg, M., Gudmundsson, J., Katz, M.J., Levcopoulos, C., Overmars, M.H., van der Stappen, A.F.: TSP with neighborhoods of varying size. J. Algorithms 57(1), 22–36 (2005)MathSciNetzbMATHGoogle Scholar
  12. 12.
    Deleplanque, S., Labbé, M., Ponce, D., Puerto, J.: An extended version of a branch-price-and-cut procedure for the discrete ordered median problem (2018). arXiv preprint arXiv:1802.03191
  13. 13.
    Domínguez-Marín, P., Nickel, S., Hansen, P., Mladenović, N.: Heuristic procedures for solving the discrete ordered median problem. Ann. Oper. Res. 136(1), 145–173 (2005)MathSciNetzbMATHGoogle Scholar
  14. 14.
    Dorrigiv, R., Fraser, R., He, M., Kamali, S., Kawamura, A., López-Ortiz, A., Seco, D.: On minimum- and maximum-weight minimum spanning trees with neighborhoods. Theory Comput. Syst. 56(1), 220–250 (2015)MathSciNetzbMATHGoogle Scholar
  15. 15.
    Drezner, Z., Hamacher, H.W. (eds.): Facility Location: Applications and Theory. Springer, Berlin (2002)zbMATHGoogle Scholar
  16. 16.
    Dumitrescu, A., Mitchell, J.S.B.: Approximation algorithms for TSP with neighborhoods in the plane. J. Algorithms 48(1), 135–159 (2003)MathSciNetzbMATHGoogle Scholar
  17. 17.
    Gentilini, I., Margot, F., Shimada, K.: The travelling salesman problem with neighbourhoods: Minlp solution. Optim. Methods Softw. 28(2), 364–378 (2013)MathSciNetzbMATHGoogle Scholar
  18. 18.
    Gorski, J., Pfeuffer, F., Klamroth, K.: Biconvex sets and optimization with biconvex functions: a survey and extensions. Math. Methods Oper. Res. 66, 373–407 (2007)MathSciNetzbMATHGoogle Scholar
  19. 19.
    Grabis, J., Chandra, C., Kampars, J.: Use of distributed data sources in facility location. Comput. Ind. Eng. 63(4), 855–863 (2012)Google Scholar
  20. 20.
    Hakimi, S.: Optimum location of switching centers and the absolute centers and medians of a graph. Oper. Res. 12, 450–459 (1964)zbMATHGoogle Scholar
  21. 21.
    Juel, H.: Bounds in the generalized weber problem under locational uncertainty. Oper. Res. 29(6), 1219–1227 (1981)MathSciNetzbMATHGoogle Scholar
  22. 22.
    Kalcsics, J., Nickel, S., Puerto, J.: Multifacility ordered median problems on networks: a further analysis. Networks 41(1), 1–12 (2003)MathSciNetzbMATHGoogle Scholar
  23. 23.
    Kalcsics, J., Nickel, S., Puerto, J., Rodríguez-Chía, A.M.: The ordered capacitated facility location problem. TOP 18(1), 203–222 (2010)MathSciNetzbMATHGoogle Scholar
  24. 24.
    Kariv, O., Hakimi, S.: An algorithmic approach to network location problems. ii: The p-medians. SIAM J. Appl. Math. 37(3), 539–560 (1979)MathSciNetzbMATHGoogle Scholar
  25. 25.
    Kuehn, A.A., Hamburguer, M.J.: A heuristic program for locating warehouses. Manag. Sci. 9, 643–666 (1963)Google Scholar
  26. 26.
    Labbé, M., Ponce, D., Puerto, J.: A comparative study of formulations and solution methods for the discrete ordered p-median problem. Comput. Oper. Res. 78, 230–242 (2017)MathSciNetzbMATHGoogle Scholar
  27. 27.
    Ljubić, I., Gollowitzer, S.: Layered graph approaches to the hop constrained connected facility location problem. INFORMS J. Comput. 25(2), 256–270 (2012)MathSciNetGoogle Scholar
  28. 28.
    Lobo, M.S., Vandenberghe, L., Boyd, S., Lebret, H.: Applications of second-order cone programming. Linear Algebra Appl. 284(1), 193–228 (1998)MathSciNetzbMATHGoogle Scholar
  29. 29.
    Marín, A., Nickel, S., Puerto, J., Velten, S.: A flexible model and efficient solution strategies for discrete location problems. Discrete Appl. Math. 157(5), 1128–1145 (2009)MathSciNetzbMATHGoogle Scholar
  30. 30.
    Marín, A., Nickel, S., Velten, S.: An extended covering model for flexible discrete and equity location problems. Math. Methods Oper. Res. 71(1), 125–163 (2010)MathSciNetzbMATHGoogle Scholar
  31. 31.
    McCormick, G.P.: Computability of global solutions to factorable nonconvex programs: part i–convex underestimating problems. Math. Program. 10(1), 147–175 (1976)zbMATHGoogle Scholar
  32. 32.
    Melo, M.T., Nickel, S., Saldanha da Gama, F.: Dynamic multi-commodity capacitated facility location: a mathematical modeling framework for strategic supply chain planning. Comput. Oper. Res. 33(1), 181–208 (2006)zbMATHGoogle Scholar
  33. 33.
    Nickel, S., Puerto, J.: Location Theory: A Unified Approach. Springer, Berlin (2005)zbMATHGoogle Scholar
  34. 34.
    Nickel, S., Saldanha da Gama, F.: Multi-period facility location, pp. 289–310. Springer, Cham (2015)Google Scholar
  35. 35.
    Ogryczak, W., Olender, P.: On milp models for the OWA optimization. J. Telecommun. Inf. Technol. 2, 5–12 (2012)Google Scholar
  36. 36.
    Ogryczak, W., Tamir, A.: Minimizing the sum of the \(k\) largest functions in linear time. Inf. Process. Lett. 85(3), 117–122 (2003)MathSciNetzbMATHGoogle Scholar
  37. 37.
    Ponce, D.: The discrete ordered median problem revisited: new formulations, properties and algorithms, Ph.D. thesis, Universidad de Sevilla (2016)Google Scholar
  38. 38.
    Puerto, J.: A new formulation of the capacitated discrete ordered median problems with \(\{0,1\}\)-assignment, pp. 165–170. Springer, Berlin (2008)zbMATHGoogle Scholar
  39. 39.
    Puerto, J., Fernandez, F.R.: Geometrical properties of the symmetrical single facility location problem. J. Nonlinear Convex Anal. 1(3), 321–342 (2000)MathSciNetzbMATHGoogle Scholar
  40. 40.
    Puerto, J., Pérez-Brito, D., García-González, C.G.: A modified variable neighborhood search for the discrete ordered median problem. Eur. J. Oper. Res. 234(1), 61–76 (2014)MathSciNetzbMATHGoogle Scholar
  41. 41.
    Puerto, J., Ramos, A.B., Rodríguez-Chía, A.M.: Single-allocation ordered median hub location problems. Comput. Oper. Res. 38(2), 559–570 (2011)MathSciNetzbMATHGoogle Scholar
  42. 42.
    Puerto, J., Rodríguez-Chía, A.M., Tamir, A.: Revisiting k-sum optimization. Math. Program. 165, 1–26 (2016)MathSciNetzbMATHGoogle Scholar
  43. 43.
    Puerto, J., Rodríguez-Chía, A.M.: Ordered Median Location Problems, pp. 249–288. Springer, Cham (2015)Google Scholar
  44. 44.
    Puerto, J., Tamir, A.: Locating tree-shaped facilities using the ordered median objective. Math. Program. 102(2), 313–338 (2005)MathSciNetzbMATHGoogle Scholar
  45. 45.
    Rodríguez-Chía, A.M., Nickel, S., Puerto, J., Fernández, F.R.: A flexible approach to location problems. Math. Methods Oper. Res. 51(1), 69–89 (2000)MathSciNetzbMATHGoogle Scholar
  46. 46.
    Stanimirović, Z., Kratica, J., Dugošija, D.: Genetic algorithms for solving the discrete ordered median problem. Eur. J. Oper. Res. 182(3), 983–1001 (2007)zbMATHGoogle Scholar
  47. 47.
    Tang, H., Cheng, T.C.E., Ng, C.T.: Finite dominating sets for the multi-facility ordered median problem in networks and algorithmic applications. Comput. Ind. Eng. 57(3), 707–712 (2016)Google Scholar
  48. 48.
    Ward, J.E., Wendell, R.E.: Using block norms for location modeling. Oper. Res. 33(5), 1074–1090 (1985)MathSciNetzbMATHGoogle Scholar
  49. 49.
    Yan, S., Lin, J.-R., Chen, Y.-C., Xie, F.-R.: Rental bike location and allocation under stochastic demands. Comput. Ind. Eng. 107, 1–11 (2017)Google Scholar
  50. 50.
    Yang, Y., Lin, M., Xu, J., Xie, Y.: Minimum spanning tree with neighborhoods, pp. 306–316. Springer, Berlin (2007)zbMATHGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2019

Authors and Affiliations

  1. 1.IEMath-GRUniversidad de GranadaGranadaSpain
  2. 2.Department of Quantitative Methods for Economics and BusinessUniversidad de GranadaGranadaSpain

Personalised recommendations