Re-aggregation Approach to Large Location Problems

Matej Cebecauer, Lubos Buzna

2015

Abstract

The majority of location problems are known to be NP-hard. An aggregation is a valuable tool that allows to adjust the size of the problem and thus to transform it to the problem that is computable in a reasonable time. An inevitible consequence is the loss of the optimality due to aggregation error. The size of the aggregation error might be significant, when solving spatially large problems with huge number of customers. Typically, an aggregation method is used only once, in the initial phase of the solving process. Here, we propose new re-aggregation approach. First, our method aggregates the original problem to the size that can be solved by the used optimization algorithm, and in an each iteration the aggregated problem is adapted to achieve more precise location of facilities for the original problem. We use simple heuristics to minimize the sources of aggregation errors, know in the literature as, sources A, B, C and D. To investigate the optimality error, we use the problems that can be computed exactly. To test the efficiency of the proposed method, we compute large location problems reaching 80000 customers.

References

  1. Andersson, G., Francis, R. L., Normark, T., and Rayco, M. (1998). Aggregation method experimentation for large-scale network location problems. Location Science, 6(1-4):25-39.
  2. Avella, P., Boccia, M., Salerno, S., and Vasilyev, I. (2012). An aggregation heuristic for large scale pmedian problem. Computers and Operations Research, 39:1625-1632.
  3. Batista e Silva, F., Gallego, J., and Lavalle, C. (2013). A high-resolution population grid map for Europe. Journal of Maps, 9(1):16-28.
  4. Berlin G N, ReVelle C S, and Elzinga D J (1976). Determining ambulance - hospital locations for on-scene and hospital services. Environment and Planning A, 8(5):553-561.
  5. Buzna, L., Kohani, M., and Janacek, J. (2014). An Approximation Algorithm for the Facility Location Problem with Lexicographic Minimax Objective. Journal of Applied Mathematics, 2014.
  6. Calvo, A. B. and Marks, D. H. (1973). Location of health care facilities: An analytical approach. SocioEconomic Planning Sciences, 7(5):407-422.
  7. Current, J. R. and Schilling, D. A. (1987). Elimination of Source A and B Errors in p-Median Location Problems. Geographical Analysis, 19(8):95-110.
  8. Daskin. M., S. (1995). Network and discrete location: Models, Algoritmhs and Applications. John Wiley & Sons.
  9. Drezner, Z. (1995). Facility location: A survey of Applications and Methods. Springer Verlag.
  10. Eiselt, H. A. and Marianov, V. (2011). Foundations of Location Analysis. International Series in Operations Research and Management Science. Springer, Science + Business.
  11. Erkut, E. and Bozkaya, B. (1999). Analysis of aggregation errors for the p-median problem. Computers & Operations Research, 26(10-11):1075-1096.
  12. Erkut, E. and Neuman, S. (1992). A multiobjective model for locating undesirable facilities. Annals of Operations Research, 40:209-227.
  13. Francis, R., Lowe, T., Rayco, M., and Tamir, A. (2009). Aggregation error for location models: survey and analysis. Annals of Operations Research, 167(1):171-208.
  14. Francis, R. L., Lowe, T. J., and Rayco, M. B. (1996). Row-Column Aggregation for Rectilinear Distance p-Median Problems. Transportation Science, 30(2):160-174.
  15. García, S., Labbé, M., and Marín, A. (2011). Solving Large p-Median Problems with a Radius Formulation. INFORMS Journal on Computing, 23(4):546-556.
  16. Goodchild, M. (2007). Citizens as sensors: the world of volunteered geography. GeoJournal, 69(4):211-221.
  17. Hakimi, S. L. (1965). Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems. Operations Research, 13(3):pp. 462-475.
  18. Haklay, M. (2010). How good is volunteered geographical information? A comparative study of OpenStreetMap and Ordnance Survey datasets. Environment and Planning B: Planning and Design, 37(4):682-703.
  19. Hillsman, E. and Rhoda, R. (1978). Errors in measuring distances from populations to service centers. The Annals of Regional Science, 12(3):74-88.
  20. Hodgson, M. and Hewko, J. (2003). Aggregation and Surrogation Error in the p-Median Model. Annals of Operations Research, 123(1-4):53-66.
  21. Hodgson, M. J. and Neuman, S. (1993). A GIS approach to eliminating source C aggregation error in p-median models. Location Science, 1:155-170.
  22. Hodgson, M. J., Shmulevitz, F., and Körkel, M. (1997). Aggregation error effects on the discrete-space p-median model: The case of Edmonton, Canada. Canadian Geographer / Le Géographe canadien, 41(4):415-428.
  23. Janác?ek, J., János?íková, L., and Buzna, L. (2012). Optimized Design of Large-Scale Social Welfare Supporting Systems on Complex Networks. In Thai, M. T. and Pardalos, P. M., editors, Handbook of Optimization in Complex Networks, volume 57 of Springer Optimization and Its Applications, pages 337-361. Springer US.
  24. Kariv, O. and Hakimi, S. L. (1979). An Algorithmic Approach to Network Location Problems. II: The pMedians. SIAM Journal on Applied Mathematics, 37(3):pp. 539-560.
  25. Marianov, V. and Serra, D. (2002). Location Problem in the Public Sector. In Drezner, Z. and Hamacher, H. W., editors, Facility Location: Applications and Theory, page 460. Springer.
  26. Marianov, V. and Serra, D. (2011). Median Problems in Networks. In Eiselt, H. A. and Marianov, V., editors, Foundations of Location Analysis, volume 155 of International Series in Operations Research & Management Science, pages 39-59. Springer US.
  27. Mladenovic, N., Brimberg, J., Hansen, P., and MorenoPérez, J. A. (2007). The p-median problem: A survey of metaheuristic approaches. European Journal of Operational Research, 179(3):927-939.
  28. Neis, P., Zielstra, D., and Zipf, A. (2011). The Street Network Evolution of Crowdsourced Maps: OpenStreetMap in Germany 2007-2011. Future Internet, 4(1):1-21.
  29. Ogryczak, W. (1997). On the lexicographic minmax approach to location problems. European Journal of Operational Research, 100:566-585.
  30. Reese, J. (2006). Solution methods for the p-median problem: An annotated bibliography. Networks, 48(3):125-142.
  31. ReVelle, C. S. and Swain, R. W. (1970). Central Facilities Location. Geographical Analysis, 2(1):30-42.
Download


Paper Citation


in Harvard Style

Cebecauer M. and Buzna L. (2015). Re-aggregation Approach to Large Location Problems . In Proceedings of the International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES, ISBN 978-989-758-075-8, pages 42-50. DOI: 10.5220/0005222300420050


in Bibtex Style

@conference{icores15,
author={Matej Cebecauer and Lubos Buzna},
title={Re-aggregation Approach to Large Location Problems},
booktitle={Proceedings of the International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,},
year={2015},
pages={42-50},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0005222300420050},
isbn={978-989-758-075-8},
}


in EndNote Style

TY - CONF
JO - Proceedings of the International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,
TI - Re-aggregation Approach to Large Location Problems
SN - 978-989-758-075-8
AU - Cebecauer M.
AU - Buzna L.
PY - 2015
SP - 42
EP - 50
DO - 10.5220/0005222300420050