Re-aggregation Heuristic for Large P-median Problems

Conference paper
Part of the Communications in Computer and Information Science book series (CCIS, volume 577)


When a location problem is too large to be computed in a reasonable time or if it is impossible to store it in the computer memory, an aggregation is commonly used tool that allows for transforming it to smaller size. Typically, an aggregation method is used only once, in the initial phase, before the solving process. An unavoidable consequence of the aggregation is the loss of optimality due to aggregation errors. The effects of aggregation errors might be significant, especially, when solving spatially large problems with huge number of potential customers. Here, we propose new simple re-aggregation approach, which minimizes sources of the aggregation errors. Our method aggregates the original problem to the size that can be solved by the used optimization algorithm, and in each iteration, the aggregated problem is adapted to achieve more precise location of facilities. The proposed approach is versatile and thus it can be easily extended to other location problems. To investigate the optimality error, we use benchmarks that can be computed exactly and to test the applicability of our approach, we study large benchmarks reaching 670 000 customers. Numerical experiments reveal that the re-aggregation heuristic works well for commonly used, as well as for extremely large sizes of the p-median problem. The approach allows for finding solutions of higher quality than the exact method that is applied to the aggregated problem.


P-median problem Re-aggregation heuristic OpenStreetMap 



This work was supported by the research grants VEGA 1/0339/13 Advanced microscopic modelling and complex data sources for designing spatially large public service systems and APVV-0760-11 Designing Fair Service Systems on Transportation Networks.


  1. 1.
    Andersson, G., Francis, R.L., Normark, T., Rayco, M.: Aggregation method experimentation for large-scale network location problems. Location Sci. 6(1–4), 25–39 (1998)CrossRefGoogle Scholar
  2. 2.
    Avella, P., Boccia, M., Salerno, S., Vasilyev, I.: An aggregation heuristic for large scale p-median problem. Comput. Oper. Res. 39, 1625–1632 (2012)CrossRefMathSciNetMATHGoogle Scholar
  3. 3.
    Batista e Silva, F., Gallego, J., Lavalle, C.: A high-resolution population grid map for Europe. J. Maps 9(1), 16–28 (2013)Google Scholar
  4. 4.
    Berlin, G.N., ReVelle, C.S., Elzinga, D.J.: Determining ambulance - hospital locations for on-scene and hospital services. Environ. Plan. A 8(5), 553–561 (1976)CrossRefGoogle Scholar
  5. 5.
    Buzna, L., Kohani, M., Janacek, J.: An approximation algorithm for the facility location problem with lexicographic minimax objective. J. Appl. Math. 2014(12), 1–12 (2014)CrossRefMathSciNetGoogle Scholar
  6. 6.
    Calvo, A.B., Marks, D.H.: Location of health care facilities: an analytical approach. Socio-Economic Plan. Sci. 7(5), 407–422 (1973)CrossRefGoogle Scholar
  7. 7.
    Current, J.R., Schilling, D.A.: Elimination of source A and B errors in p-Median location problems. Geogr. Anal. 19(8), 95–110 (1987)Google Scholar
  8. 8.
    Daskin, M.S.: Network and Discrete Location: Models, Algoritmhs and Applications. John Wiley & Sons, New York (1995)CrossRefGoogle Scholar
  9. 9.
    Drezner, Z. (ed.): Facility location: A survey of Applications and Methods. Springer Verlag, New York (1995)Google Scholar
  10. 10.
    Eiselt, H.A., Marianov, V. (eds.): Foundations of Location Analysis. Science + Business, International Series in Operations Research and Management Science, vol. 155, Springer, US (2011)Google Scholar
  11. 11.
    Erkut, E., Neuman, S.: A multiobjective model for locating undesirable facilities. Ann. Oper. Res. 40, 209–227 (1992)CrossRefMATHGoogle Scholar
  12. 12.
    Erkut, E., Bozkaya, B.: Analysis of aggregation errors for the p-median problem. Comput. Oper. Res. 26(10–11), 1075–1096 (1999)CrossRefMathSciNetMATHGoogle Scholar
  13. 13.
    Francis, R.L., Lowe, T.J., Rayco, M.B.: Row-Column aggregation for rectilinear distance p-Median problems. Transp. Sci. 30(2), 160–174 (1996)CrossRefMATHGoogle Scholar
  14. 14.
    Francis, R., Lowe, T., Rayco, M., Tamir, A.: Aggregation error for location models: survey and analysis. Ann. Oper. Res. 167(1), 171–208 (2009)CrossRefMathSciNetGoogle Scholar
  15. 15.
    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)CrossRefMathSciNetMATHGoogle Scholar
  16. 16.
    Goodchild, M.: Citizens as sensors: the world of volunteered geography. GeoJournal 69(4), 211–221 (2007).
  17. 17.
    Hakimi, S.L.: Optimum distribution of switching centers in a communication network and some related graph theoretic problems. Oper. Res. 13(3), 462–475 (1965)CrossRefMathSciNetMATHGoogle Scholar
  18. 18.
    Haklay, M.: How good is volunteered geographical information? a comparative study of OpenStreetMap and ordnance survey datasets. Environ. Plan. B Plan. Des. 37(4), 682–703 (2010)CrossRefGoogle Scholar
  19. 19.
    Hillsman, E., Rhoda, R.: Errors in measuring distances from populations to service centers. Ann. Reg. Sci. 12(3), 74–88 (1978)CrossRefGoogle Scholar
  20. 20.
    Hodgson, M.J., Neuman, S.: A GIS approach to eliminating source C aggregation error in p-median models. Location Sci. 1, 155–170 (1993)MATHGoogle Scholar
  21. 21.
    Hodgson, M.J., Shmulevitz, F., Körkel, M.: Aggregation error effects on the discrete-space p-median model: the case of Edmonton, Canada. Can. Geogr. / Le Géographe canadien 41(4), 415–428 (1997)CrossRefGoogle Scholar
  22. 22.
    Hodgson, M., Hewko, J.: Aggregation and surrogation error in the p-Median model. Ann. Oper. Res. 123(1–4), 53–66 (2003)CrossRefMathSciNetMATHGoogle Scholar
  23. 23.
    Janáček, J., Jánošíková, L., Buzna, L.: Optimized Design of Large-Scale Social Welfare Supporting Systems on Complex Networks. In: Thai, M.T., Pardalos, P.M. (eds.) Handbook of Optimization in Complex Networks, Springer Optimization and Its Applications, vol. 57, pp. 337–361. Springer, US (2012)CrossRefGoogle Scholar
  24. 24.
    Kariv, O., Hakimi, S.L.: An algorithmic approach to network location problems. II: the p-Medians. SIAM J. Appl. Math. 37(3), 539–560 (1979)CrossRefMathSciNetMATHGoogle Scholar
  25. 25.
    Marianov, V., Serra, D.: Location Problem in the Public Sector. In: Drezner, Z., Hamacher, H.W. (eds.) Facility Location: Applications and Theory, p. 460. Springer, Heidelberg (2002)Google Scholar
  26. 26.
    Marianov, V., Serra, D.: Median problems in networks. In: Eiselt, H.A., Marianov, V. (eds.) Foundations of Location Analysis, International Series in Operations Research & Management Science, vol. 155, pp. 39–59. Springer, US (2011)CrossRefGoogle Scholar
  27. 27.
    Mladenović, N., Brimberg, J., Hansen, P., Moreno-Pérez, J.A.: The p-median problem: a survey of metaheuristic approaches. Eur. J. Oper. Res. 179(3), 927–939 (2007)CrossRefMATHGoogle Scholar
  28. 28.
    Neis, P., Zielstra, D., Zipf, A.: The Street Network Evolution of Crowdsourced Maps: OpenStreetMap in Germany 2007–2011. Future Internet 4(1), 1–21 (2011).
  29. 29.
    Ogryczak, W.: On the lexicographic minmax approach to location problems. Eur. J. Oper. Res. 100, 566–585 (1997)CrossRefMATHGoogle Scholar
  30. 30.
    Reese, J.: Solution methods for the p-median problem: an annotated bibliography. Networks 48(3), 125–142 (2006)CrossRefMathSciNetMATHGoogle Scholar
  31. 31.
    ReVelle, C.S., Swain, R.W.: Central facilities location. Geogr. Anal. 2(1), 30–42 (1970)CrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  1. 1.University of ZilinaZilinaSlovakia

Personalised recommendations