Aggregation in Location

  • Richard L. Francis
  • Timothy J. LoweEmail author


Location problems occurring in urban or regional settings may involve many tens of thousands of “demand points,” usually individual residences. In modeling such problems it is common to aggregate demand points to obtain tractable models. We discuss aggregation approaches to a large class of location models, consider various aggregation error measures, and identify some effective measures. In particular, we focus on an upper bounding methodology for the error associated with aggregation. The chapter includes an example application.


Aggregation Demand points Location 


  1. Agarwal PK, Efrat A, Sharir M (1999) Vertical decomposition of shallow levels in 3-dimensional arrangements and its applications. SIAM J Comput 29:912–953MathSciNetzbMATHCrossRefGoogle Scholar
  2. Agarwal PK, Varadarajan KR (1999) Approximation algorithms for bipartite and nonbipartite matchings in the plane. In: 10th ACM-SIAM symposium on discrete algorithms (SODA). ACM, New York, pp 805–814Google Scholar
  3. Ahuja RK, Magnanti TL, Orlin JB (1993) Exercise 12.23. In: Network flows: theory, algorithms, and applications. Prentice Hall, Englewood Cliffs, p 505zbMATHGoogle Scholar
  4. Avella P, Boccia M, Salerno S, Vasilyev I (2012) An aggregation heuristic for large scale p-median problem. Comput Oper Res 39:1625–1632MathSciNetzbMATHGoogle Scholar
  5. Bender T, Hennes H, Kalcsics J, Melo T, Nickel S (2001) Location software and interface with GIS and supply chain management. In: Drezner Z, Hamacher H (eds) Facility location: applications and theory. Springer, BerlinzbMATHGoogle Scholar
  6. Casillas PA (1987) Data aggregation and the p-median problem in continuous space. In: Ghosh A, Rushton G (eds) Spatial analysis and location-allocation models. Van Nostrand Reinhold Publishers, New York, pp 227–244Google Scholar
  7. Chelst KR, Schultz JP, Sanghvi N (1998) Issues and decision aids for designing branch networks. J Retail Bank X:5–17Google Scholar
  8. Daskin MS (2013) Network and discrete location: models, algorithms, and applications, 2nd edn. Wiley, HobokenzbMATHGoogle Scholar
  9. Daskin MS, Haghani AE, Khanal M, Malandraki C (1989) Aggregation effects in maximum covering models. Ann Oper Res 18:115–139MathSciNetzbMATHCrossRefGoogle Scholar
  10. Dekle J, Lavieri M, Martin E, Emir-Farinas H, Francis RL (2005) A Florida county locates disaster recovery centers. Interfaces 35:133–139CrossRefGoogle Scholar
  11. Domich PD, Hoffman KL, Jackson RHF, McClain MA (1991) Locating tax facilities: a graphics-based microcomputer optimization model. Manag Sci 37:960–979CrossRefGoogle Scholar
  12. Drezner Z (ed) (1995) Facility location: a survey of applications and methods. Springer, BerlinGoogle Scholar
  13. Drezner Z, Hamacher HW (eds) (2002) Facility location: theory and algorithms. Springer, BerlinzbMATHGoogle Scholar
  14. Dyer M, Frieze A (1985) A simple heuristic for the p-center problem. Oper Res Lett 3:285–288MathSciNetzbMATHCrossRefGoogle Scholar
  15. Efrat A, Itai A, Katz MJ (2001) Geometry helps in bottleneck matching and related problems. Algorithmica 31:1–28MathSciNetzbMATHCrossRefGoogle Scholar
  16. Eiselt HA, Marianov V (2011) Foundations of location analysis. Springer, New YorkzbMATHCrossRefGoogle Scholar
  17. Erkut E, Bozkaya B (1999) Analysis of aggregation errors for the p-median problem. Comput Oper Res 26:1075–1096MathSciNetzbMATHCrossRefGoogle Scholar
  18. Erkut E, Neuman S (1989) Analytical models for locating undesirable facilities. Eur J Oper Res 40:275–291MathSciNetzbMATHCrossRefGoogle Scholar
  19. Ernst A, Hamacher HW, Jiang HW, Krishnamorthy M, Woeginger G (2002a) Uncapacitated single and multiple allocation p-hub center problems. Report. CSIRO, MelbourneGoogle Scholar
  20. Ernst A, Hamacher HW, Jiang HW, Krishnamorthy M, Woeginger G (2002b) Heuristic algorithms for the uncapacitated hub center single allocation problem. Report. CSIRO, MelbourneGoogle Scholar
  21. Francis RL, Lowe TJ (1992) On worst-case aggregation analysis for network location problems. Ann Oper Res 40:229–246MathSciNetzbMATHCrossRefGoogle Scholar
  22. Francis RL, Lowe TJ (2014) Comparative error bound theory for three location models: continuous demand vs discrete demand. TOP 22:144–169MathSciNetzbMATHCrossRefGoogle Scholar
  23. Francis RL, Lowe TJ, Rayco MB, Tamir A (2003) Exploiting self-canceling demand point aggregation error for some planar rectilinear median problems. Nav Res Log 50:614–637MathSciNetzbMATHCrossRefGoogle Scholar
  24. Francis RL, Lowe TJ, Rushton G, Rayco MB (1999) A synthesis of aggregation methods for multi-facility location problems: strategies for containing error. Geogr Anal 31:67–87CrossRefGoogle Scholar
  25. Francis RL, Lowe TJ, Tamir A (2000) On aggregation error bounds for a class of location models. Oper Res 48:294–307MathSciNetzbMATHCrossRefGoogle Scholar
  26. Francis RL, Lowe TJ, Tamir A (2004a) Demand point aggregation analysis for a class of constrained location models: a penalty function approach. IIE Trans 36:601–609CrossRefGoogle Scholar
  27. Francis RL, Lowe TJ, Tamir A, Emir-Farinas H (2004b) Aggregation decomposition and aggregation guidelines for a class of minimax and covering location models. Geogr Anal 36:332–349CrossRefGoogle Scholar
  28. Francis RL, Lowe TJ, Tamir A, Emir-Farinas H (2004c) A framework for demand point and solution space aggregation analysis for location models. Eur J Oper Res 159:574–585MathSciNetzbMATHCrossRefGoogle Scholar
  29. Francis RL, McGinnis LF, White JA (1992) Facility layout and location: an analytical approach, 2nd edn. Prentice-Hall, Englewood CliffsGoogle Scholar
  30. Francis RL, Rayco MB, Lowe TJ, Tamir A (2009) Aggregation error for location models: survey and analysis. Ann Oper Res 167:171–208MathSciNetzbMATHCrossRefGoogle Scholar
  31. Francis RL, White JA (1974) Facility layout and location: an analytical approach. Prentice-Hall, Englewood Cliffs, p 324. problem 7.25Google Scholar
  32. Gavriliouk EO (2003) Aggregation in hub location models. M Sc thesis, Department of Mathematics, Clemson University, Clemson, SCGoogle Scholar
  33. Geoffrion A (1977) Objective function approximations in mathematical programming. Math Prog 13:23–37MathSciNetzbMATHCrossRefGoogle Scholar
  34. Goldberg R (1976) Methods of real analysis, 2nd edn. Wiley, New YorkzbMATHGoogle Scholar
  35. Hakimi SL (1965) Optimum location of switching centers and the absolute centers and medians of a graph. Oper Res 12:450–459zbMATHCrossRefGoogle Scholar
  36. Handler GY, Mirchandani PB (1979) Location on networks: theory and algorithms. MIT Press, Cambridge, NJzbMATHGoogle Scholar
  37. Hillsman EL, Rhoda R (1978) Errors in measuring distances from populations to service centers. Ann Reg Sci 12:74–88CrossRefGoogle Scholar
  38. Hooker JN, Garfinkel RS, Chen CK (1991) Finite dominating sets for network location problems. Oper Res 39:100–118MathSciNetzbMATHCrossRefGoogle Scholar
  39. Irawan C, Salhi S (2015a) Aggregation and non aggregation techniques for large facility location problems - a survey. Yugosl J Oper Res 25:313–341MathSciNetzbMATHCrossRefGoogle Scholar
  40. Irawan C, Salhi S (2015b) Solving large p-median problems by a multistage hybrid approach iusing demand points aggregation and variable neighborhood search. J Glob Optim 63:537–554zbMATHCrossRefGoogle Scholar
  41. Irawan C, Salhi S, Scaparra M (2014) An adaptive multiphase approach for large unconditional and conditional p-median problems. Eur J Oper Res 237:590–605MathSciNetzbMATHCrossRefGoogle Scholar
  42. Kariv O, Hakimi SL (1979) An algorithmic approach to network location problems: part 1, the p-centers; part 2, the p-medians. SIAM J Appl Math 37:513–560MathSciNetzbMATHCrossRefGoogle Scholar
  43. Kolen A, Tamir A (1990) Covering problems. In: Mirchandani PB, Francis RL (eds) Discrete location theory. Wiley, New York, pp 263–304Google Scholar
  44. Love R, Morris J, Wesolowsky G (1988) Facility location: models and methods. North-Holland Publishers, AmsterdamzbMATHGoogle Scholar
  45. Megiddo N, Supowit KJ (1984) On the complexity of some common geometric location problems. SIAM J Comput 13:182–196MathSciNetzbMATHCrossRefGoogle Scholar
  46. Mirchandani PB, Francis RL (eds) (1990) Discrete location theory. Wiley, New YorkzbMATHGoogle Scholar
  47. Murray AT, Gottsegen JM (1997) The influence of data aggregation on the stability of p-median location model solutions. Geogr Anal 29:200–213CrossRefGoogle Scholar
  48. NaimiSadigh A, Fallah H (2009) Demand point aggregation analysis for location models. Chap. 22. In: Farahani R, Hekmatfar M (eds) Contributions to management science. Physica-Verlag, HeidelbergGoogle Scholar
  49. Nickel S, Puerto J (2005) Location theory: a unified approach. Springer, BerlinzbMATHGoogle Scholar
  50. Pardalos PM, Resende M (eds) (2002) Handbook of applied optimization. Oxford University Press, OxfordzbMATHGoogle Scholar
  51. Plastria F (2000) New error bounds in continuous minisum location for aggregation at the gravity centre. Stud Locat Anal 14:101–119MathSciNetzbMATHGoogle Scholar
  52. Plastria F (2001) On the choice of aggregation points for continuous p-median problems: a case for the gravity center. TOP 9:217–242MathSciNetzbMATHCrossRefGoogle Scholar
  53. Reeves C (1993) Modern heuristic techniques for combinatorial problems. Blackwell Scientific Press, OxfordzbMATHGoogle Scholar
  54. Resende MGC, de Sousa JP (eds) (2004) Metaheuristics: computer decision-making. Kluwer Academic Press, BostonGoogle Scholar
  55. Sheffi Y (1985) Urban transportation networks: equilibrium analysis with mathematical programming models. Prentice-Hall, Englewood Cliffs, pp 14–16Google Scholar
  56. Varadarajan KR (1998) A divide and conquer algorithm for min-cost perfect matching in the plane. In: Proceedings 38th annual IEEE symposium on foundations of computer sciences. IEEE, Los Alamitos, pp 320–331Google Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.Industrial and Systems Engineering DepartmentUniversity of FloridaGainesvilleUSA
  2. 2.Management Science DepartmentTippie College of Business, University of IowaIowa CityUSA

Personalised recommendations