Skip to main content
Log in

Comparative error bound theory for three location models: continuous demand versus discrete demand

  • Original Paper
  • Published:
TOP Aims and scope Submit manuscript

Abstract

We develop a unified error bound theory to compare a given p-median, p-center or covering location model with continuously distributed demand points in R n to a corresponding given original model of the same type having a finite collection of demand points in R n. We give ways to construct either a continuous or finite demand point model from the other model and also control the error bound. Our work uses Voronoi tilings extensively, and is related to earlier error bound theory for aggregating finitely many demand points.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1

Similar content being viewed by others

References

  • Akella MA, Delmelle E, Batta R, Rogerson P, Blatt A (2010) Adaptive cell tower location using geostatistics. Geogr Anal 23:227–244

    Article  Google Scholar 

  • Apostol T (1981) Mathematical analysis: a modern approach to advanced calculus. Addison Wesley, Reading

    Google Scholar 

  • Aurenhammer F (1991) Voronoi diagrams—a survey of a fundamental geometric data structure. ACM Comput Surv 23:345–405

    Article  Google Scholar 

  • Bowerman RL, Calamai PH, Hall B (1999) The demand partitioning method for reducing aggregation errors in p-median problems. Comput Oper Res 26:1097–1111

    Article  Google Scholar 

  • Brotcorne L, Laporte G, Semet F (2002) Fast heuristics for large scale covering-location problems. Comput Oper Res 29:741–759

    Article  Google Scholar 

  • Carrizosa E, Muñoz-Márquez M, Puerto J (1998) The Weber problem with regional demand. Eur J Oper Res 104:358–365

    Article  Google Scholar 

  • Cui T, Ouyang Y, Shen Z-JM (2010) Reliable facility location design under the risk of disruptions. Oper Res 58:998–1011

    Article  Google Scholar 

  • Daskin MS (1995) Network and discrete location: Models, algorithms, and applications. Wiley, New York

    Book  Google Scholar 

  • Donthu N, Rust RT (1989) Estimating geographic consumer densities using kernel density estimation. Mark Sci 8:191–203

    Article  Google Scholar 

  • Drezner Z (1995a) Replacing discrete demand with continuous demand. In: Drezner Z (ed) Facility location: a survey of applications and methods. Springer, Berlin, pp 33-42

    Chapter  Google Scholar 

  • Drezner Z (ed) (1995b) Facility location: a survey of applications and methods. Springer, Berlin

    Google Scholar 

  • Drezner Z (1997) Converting an area to discrete points in location analysis. Stud Locat Anal 11:1–12

    Google Scholar 

  • Drezner T, Drezner Z (1997) Replacing discrete demand with continuous demand in a competitive facility location problem. Nav Res Logist 44:81–95

    Article  Google Scholar 

  • Drezner Z, Hamacher HW (eds) (2002) Facility location: theory and algorithms. Springer, Berlin

    Google Scholar 

  • Eiselt HA (1986) Continuous maximin knapsack problems with GLB constraints. Math Program 36:114–121

    Article  Google Scholar 

  • Erdemir ET, Batta R, Spielman S, Rogerson PA, Blatt A, Flanigan M (2008a) Optimization of aeromedical base locations in New Mexico using a model that considers crash nodes and paths. Accid Anal Prev 40:1105–1114

    Article  Google Scholar 

  • Erdemir ET, Batta R, Spielman S, Rogerson PA, Blatt A, Flanigan M (2008b) Location coverage models with demand originating from nodes and paths: application to cellular network design. Eur J Oper Res 190:610–632

    Article  Google Scholar 

  • Erlenkotter D (1989) The general market area model. Ann Oper Res 18:45–70

    Article  Google Scholar 

  • Ezra N, Handler GY, Chen R (1994) Solving infinite p-center problems in Euclidean space using an interactive graphical method. Location Sci 2:101–109

    Google Scholar 

  • Farahani RZ, Hekmatfar M (eds) (2009) Facility location: concepts, models, algorithms and case studies. Physica-Verlag, Berlin

    Google Scholar 

  • Fleming WH (1965) Functions of several variables. Addison-Wesley, Reading (see Chap. 5)

    Google Scholar 

  • Francis RL, Lowe TJ (1992) On worst-case aggregation analysis for network location problems. Ann Oper Res 40:229–246

    Article  Google Scholar 

  • Francis RL, Rayco MB (1996) Asymptotically optimal aggregation for some unweighted p-center problems with rectilinear distances. Stud Locat Anal 10:25–36

    Google Scholar 

  • Francis RL, White JA (1974) Facility layout and location: an analytical approach. Prentice-Hall, Englewood Cliffs (Homework problem 725, p 324)

    Google Scholar 

  • Francis RL, McGinnis LF, White JA (1992) Facility layout and location: an analytical approach, 2nd edn. Prentice-Hall, Englewood Cliffs

    Google Scholar 

  • Francis RL, Lowe TJ, Tamir A (2000) On aggregation error bounds for a class of location models. Oper Res 48:294–307

    Article  Google Scholar 

  • Francis RL, Lowe TJ, Rayco MB, Tamir A (2003) Exploiting self-canceling demand point aggregation error for some planar rectilinear median problems. Nav Res Logist 50:614–637

    Article  Google Scholar 

  • Francis RL, Lowe TJ, Tamir A (2004) Demand point aggregation analysis for a class of constrained location models: a penalty function approach. IIE Trans 36:601–609

    Article  Google Scholar 

  • Francis RL, Lowe TJ, Tamir A, Emir-Farinas H (2004a) A framework for demand point and solution space aggregation analysis for location models. Eur J Oper Res 159:574–585

    Article  Google Scholar 

  • 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–349

    Article  Google Scholar 

  • Francis RL, Lowe TJ, Rayco MB, Tamir A (2009) Aggregation error for location models: survey and analysis. Ann Oper Res 167:171–208

    Article  Google Scholar 

  • Geoffrion AM (1976) The purpose of mathematical programming is insight, not numbers. Interfaces 7:81–92

    Article  Google Scholar 

  • Hakimi SL (1964) Optimum location of switching centers and the absolute centers and medians of a graph. Oper Res 12:450–459

    Article  Google Scholar 

  • Hakimi SL (1965) Optimum distribution of switching centers in a communication network and some related graph theoretic problems. Oper Res 13:462–475

    Article  Google Scholar 

  • Hakimi SL, Labbé M, Schmeichel E (1992) The Voronoi partitioning of a network and its implications in network location theory. ORSA/INFORMS J Comput 4:412–417

    Article  Google Scholar 

  • Halpern J (1978) Finding minimal center-median convex combination (cent-dian) of a graph. Manag Sci 24:535–544

    Article  Google Scholar 

  • Handler G (1985) Medi-centers of a tree. Transp Sci 19:246–260

    Article  Google Scholar 

  • Handler GY, Mirchandani PB (1979) Location on networks: theory and algorithms. MIT Press, Cambridge

    Google Scholar 

  • Hillsman EL, Rhoda R (1978) Errors in measuring distances from populations to service centers. Ann Reg Sci 12:74–88

    Article  Google Scholar 

  • Hodgson MJ, Hewko J (2003) Aggregation and surrogation error in the p-median model. Ann Oper Res 123:53–66

    Article  Google Scholar 

  • Hodgson MJ, Neuman S (1993) A GIS approach to eliminating source C aggregation error in p-median models. Location Sci 1:155–170

    Google Scholar 

  • Ibaraki T, Katoh N (1998) Resource allocation problems: algorithmic approaches. MIT Press, Cambridge

    Google Scholar 

  • Jacobsen S (1971) On marginal allocation in single constraint min-max problems. Manag Sci 17(11):780–783

    Article  Google Scholar 

  • 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–560

    Article  Google Scholar 

  • Kolen A, Tamir A (1990) Covering problems. In: Mirchandani PB, Francis RL (eds) Discrete location theory. Wiley-Interscience, New York, pp 263–304

    Google Scholar 

  • Love R, Morris J, Wesolowsky G (1998) Facility location: models and methods. North-Holland, Amsterdam

    Google Scholar 

  • Matisziw TC, Murray AT (2009) Siting a facility in continuous space to maximize coverage of a region. Transp Sci 43:131–139

    Google Scholar 

  • Mirchandani PB, Francis RL (eds) (1990) Discrete location theory. Wiley-Interscience, New York

    Google Scholar 

  • Murat A, Verter V, Laporte G (2010) A continuous analysis framework for the solution of location-allocation problems with dense demand. Comput Oper Res 37:123–136

    Article  Google Scholar 

  • Murray AT (2005) Geography in coverage modeling: exploiting spatial structure to address complementary partial service of areas. Ann Assoc Am Geogr 95:761–772

    Article  Google Scholar 

  • Murray AT, Tong D (2007) Coverage optimization in continuous space facility siting. Int J Geogr Inf Decis Anal 21:757–776

    Article  Google Scholar 

  • Nickel S, Puerto J (2005) Location theory: a unified approach. Springer, Berlin

    Google Scholar 

  • Okabe A, Suzuki A (1997) Locational optimization problems solved through Voronoi diagrams. Eur J Oper Res 98:445–456

    Article  Google Scholar 

  • Ouyang Y, Daganzo CF (2006) Discretization and validation of the continuum approximation scheme for terminal system design. Transp Sci 40:89–98

    Article  Google Scholar 

  • Plastria F (2000) New error bounds in continuous minisum location for aggregation at the gravity center. Stud Locat Anal 14:101–119

    Google Scholar 

  • Plastria F (2001) On the choice of aggregation points for continuous p-median problems: a case for the gravity center. Top 9:217–242

    Article  Google Scholar 

  • Porteus EL, Yormark JS (1972) More on the min-max allocation problem. Manag Sci 18:502–507

    Article  Google Scholar 

  • Powell MJD (1981) Approximation theory and methods. Cambridge University Press, Cambridge (see Sects. 8.5 and 15.4)

    Google Scholar 

  • Puerto J, Rodriguez-Chia AM (2009) On the structure of the solution set for the single facility location problem with average distances. Math Program, Series A, published on-line, 13 October 2009

  • Rayco MB, Francis RL, Lowe TJ (1997) Error-bound driven demand point aggregation for the rectilinear distance p-center model. Location Sci 4:213–235

    Article  Google Scholar 

  • Rayco MB, Francis RL, Tamir A (1999) A p-center grid-positioning aggregation procedure. Comput Oper Res 26:1113–1124

    Article  Google Scholar 

  • Rogers DF, Plante RD, Wong RT, Evans JR (1991) Aggregation and disaggregation techniques and methodology in optimization. Oper Res 39:553–582

    Article  Google Scholar 

  • Rushton G (1989) Applications of location models. Ann Oper Res 18:25–42

    Article  Google Scholar 

  • Silverman BW (1978) Choosing window width when estimating a density. Biometrika 65:1–11

    Article  Google Scholar 

  • Silverman BW (1986) Density estimation for statistics and data analysis. CRC Press, Boca Raton

    Book  Google Scholar 

  • Sliwinski A (2002) Spatial point pattern analysis for targeting prospective new customers: bringing GIS functionality into direct marketing. J Geogr Inf Decis Anal 6:31–48

    Google Scholar 

  • Suzuki A, Drezner Z (1996) The p-center location problem in an area. Location Sci 4:69–82

    Article  Google Scholar 

  • Suzuki A, Drezner Z (2009) The minimum equitable radius location problem with continuous demand. Eur J Oper Res 195:17–30

    Article  Google Scholar 

  • Suzuki A, Okabe A (1995) Using Voronoi diagrams. In: Drezner Z (ed) Facility location: a survey of applications and methods. Springer, Berlin, pp 103–118

    Chapter  Google Scholar 

  • Tang CS (1998) A max-min allocation problem: its solutions and applications. Oper Res 36(2):359–367

    Article  Google Scholar 

  • Tansel BC, Francis RL, Lowe TJ, Chen ML (1982) Duality and distance constraints for the nonlinear p-center problem and covering problem on a tree network. Oper Res 30:725–744

    Article  Google Scholar 

  • Tong D, Murray AT (2009) Maximizing coverage of spatial demand for service. Pap Reg Sci 88:85–97

    Article  Google Scholar 

  • Zemel E (1985) Probabilistic analysis of geometric location problems. SIAM J Algebr Discrete Methods 6:189–197

    Article  Google Scholar 

Download references

Acknowledgements

We would like to thank Alper Murat for his help with literature, and Justo Puerto, Atsuo Suzuki and Arie Tamir for their constructive suggestions.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Richard L. Francis.

Appendix: Unifying SAND theory for error bound analysis

Appendix: Unifying SAND theory for error bound analysis

Here we adapt some of the theory used in Francis et al. (2000) considering certain functions called “SAND” functionals. In particular, we exploit the ideas of subadditivity and monotonicity (nondecreasingness), defined below. The basic difference between that work and ours is that previously the SAND function domain was a class of finite-dimensional, nonnegative vectors; in what follows, the domain is a class of “infinite,” nonnegative functions. Apart from providing the basis for our error bound theory, we believe this approach, since it suppresses much of the notation needed for the three specific location models, is more transparent than an approach with model-specific notation; it is also more general. Our purpose here is to establish Theorem A.1, and then indicate how to use it to obtain Theorem 2.1.

Let T be a compact subset of R n, while T i is part of a tiling of T. Let I(T) be the set of all Lebesgue-integrable and nonnegative-valued functions defined on T, and bounded above on T.

For any two functions φ 1,φ 2I(T), we define φ 1φ 2 to mean φ 1(u)≤φ 2(u) for all uT.

We have a given, nonnegative-valued weight function w, a member of I(T). S() is a nonnegative-valued functional defined for all functions φI(T) on the product function w(u)φ(u), uT. Hence S is a function from I(T) into the nonnegative reals. To restrict the domain of S to I(T i ) for some tile T i , we use the notation S(⋅:T i ); if the function φ is identically 1, we write S(w:T i ).

We make the following two basic SAND assumptions about S.

Subadditive (SA) assumption :

For any φ 1,φ 2I(T), we have S(w(φ 1+φ 2))≤S( 1)+S( 2).

Nondecreasing (ND) assumption :

For any φ 1,φ 2I(T) with φ 1φ 2, we have S( 1)≤S( 2).

The integral functional, S()=∫ uT w(u)φ(u) du, and supremum functional, S()=sup{w(u)φ(u):uT}, are versions of S that satisfy both these assumptions, and are the principal SAND functionals of interest.

The above two basic assumptions immediately imply the following for any SAND functional S with domain I(T). Refer to Sects. 2 and 3 for assumptions about w(u) for the integral and supremum case, respectively.

SAND property :

Let φ 1,φ 2,φ 3I(T). If φ 1φ 2+φ 3, then S( 1)≤S( 2)+S( 3). Equality holds if and only if S( 1)=S(w(φ 2+φ 3))=S( 2)+S( 3).

Definition :

A SAND functional S with domain I(T) is positively homogeneous if, for any positive constant c, and φI(T), S(cwφ)=cS(); it is positively subhomogeneous if S(cwφ)≤cS().

Both the integral and sup-functionals are positively homogeneous.

Notation :

With w=w(u) for all uT, for all XFS, for all uT i of any given tiling of T, and for all iM, define the following:

$$\begin{aligned}[t]&\varphi _{1X}(u) = D(X,u),\qquad k_{iX} = D(X,a_{i});\qquad \varphi _{2i}(u) = d(u,a_{i}),\qquad \\&c(T_{i}) = S(w\varphi _{2i}:T_{i}),\qquad w'_{i} = S(w:T_{i}).\end{aligned}$$

Theorem A.1

Let S be any positively subhomogeneous SAND functional on I(T). Also, suppose \(|w_{i}' - w_{i}|\leq \varepsilon_{i}\), iM.

  1. (a)

    For all XFS, we have

    $$S(w \varphi _{1 X}: T_{i}) \leq w_{i} D(X,a_{i}) +b_{i} \varepsilon _{i} + c(T_{i}).$$
  2. (b)

    For all XFS, we have

    $$w_{i} D(X,a_{i}) = w_{i} k_{iX} \leq S(w\varphi _{1X}:T_{i}) + b_{i} \varepsilon _{i} +c(T_{i}).$$

Proof

(a) We have, using the triangle inequality and the nonnegativity of the function w,

Using the fact that S is SAND, positively subhomogeneous, and the definitions, now gives

(b) We have, since \(|w_{i}' - w_{i}| \leq \varepsilon_{i}\),

$$w_{i} - w_{i}' \leq \varepsilon_{i} \Leftrightarrow w_{i} \leq \varepsilon_{i} + w_{i}'.$$

Thus

$$w_{i} k_{iX} \leq \varepsilon_{i} k_{iX} +w_{i}' k_{iX} \leq \varepsilon_{i} b_{i} +w_{i}' k_{iX} \leq \varepsilon_{i} b_{i} + S(wk_{iX}: T_{i}).$$

Also, wk iX 1X + 2i by the triangle inequality and positivity of w, so, since S is SAND,

$$S(w k_{iX}) \leq S(w \varphi _{1X}:T_{i}) + S(w\varphi _{2i}: T_{i}),$$

giving

$$w_{i} k_{iX} \leq \varepsilon b_{i} + S(w\varphi _{1X}:T_{i}) + S(w \varphi _{2i}: T_{i}) = S(w\varphi _{1X}:T_{i}) + b_{i} \varepsilon _{i} +c(T_{i}).$$

 □

The inequalities used in the proofs of (a) and (b) are: the triangle inequality, the SAND inequality property, D(X,a i )≤b i for all XFS, \(|w_{i}'- w_{i}| \leq \varepsilon_{i}\), and positive subhomogeneity.

Equality holds in claim (a) or (b) if and only if each inequality in the proof of (a) or (b) holds as an equality. One can build on these equality observations to obtain necessary and sufficient conditions for each of the PCM, PMM, and CLM error bounds to be tight.

Remark

(a) If S is the integral functional, then, for all iM, \(S(w \varphi _{1 X}: T_{i}) =\int_{u \in T_{i}}w( u )D( X,u ) \,du\),

$$\begin{aligned}[t]&c(T_{i}) = S(w\varphi _{2i}: T_{i}) =\int_{u \in T_{i}} w( u)d(u,a_{i}) \,du ;\qquad \\&w_{i}' = S(w: T_{i}) =\int_{u \in T_{i}} w(u )\,du\quad \mbox{(see Theorem~2.1(a))}.\end{aligned}$$

(b) If S is the supremum functional, then, for all iM, S( 1X :T i )=sup{w(u)D(X,u):uT i }, c(T i )=S( 2i :T i )=sup{w(u)d(u,a i ):uT i }; \(w_{i}' = S(w: T_{i}) =\sup\{w(u): u \in T_{i}\}\) (see Theorem 2.1(b)).

Sections 2, 3 and 4 discuss uses of Theorem A.1, including Theorem 2.1.

We remark that our error bound results are not limited to the PMM, PCM, or LCM. For example, we can obtain an error bound for finite and infinite DP set versions of the “cent-dian” model of Halpern (1978), called the medi-center model by Handler (1985).

Rights and permissions

Reprints and permissions

About this article

Cite this article

Francis, R.L., Lowe, T.J. Comparative error bound theory for three location models: continuous demand versus discrete demand. TOP 22, 144–169 (2014). https://doi.org/10.1007/s11750-011-0244-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11750-011-0244-2

Keywords

Mathematics Subject Classification (2000)

Navigation