Geoscience Reference

In-Depth Information

of aggregation”. We have also presented an application of the covering location

model to a real public sector location problem in the state of Florida, and have

demonstrated error bound analysis for this problem.

Difficulties in computing actual errors lead to the concept of an error bound, and

this error bound can be used as a surrogate for the maximum absolute error. In fact,

error bounds can be computed for many other location models since many of these

models share properties with (PMM), (PCM), or (CLM). In addition, error bound

analysis can be extended to more general costing functions
g
if
f
(
S
)
D
g
(
D
(
S
,
V
))

and the costing function
g
is
s
ub
a
dditive and
n
on
d
ecreasing (SAND) (see Francis

et al.
2000
,
2009
).

Based on our work on demand point aggregation for location modeling, we offer

the following observations:

1. the work of Hillsman and Rhoda is widely recognized and influential; in

particular, self-canceling error is a helpful concept for models with additive

structure;

2. there is little average-case analysis of aggregation error;

3. much more research on aggregation for the median problem has been done than

for center, covering and other models;

4. progress is definitely being made in understanding aggregation error;

5. aggregation error bounds can be useful, particularly for center and covering

models;

6. aggregation error measures used vary greatly, and there is no agreement on how

to measure error; hence it is pointless to ask which aggregation algorithm is best,

since “best” is not defined.

References

Agarwal PK, Varadarajan KR (1999) Approximation algorithms for bipartite and nonbipartite

matchings in the plane. In: 10th ACM-SIAM symposium on discrete algorithms (SODA), pp

805-814

Agarwal PK, Efrat A, Sharir M (1999) Vertical decomposition of shallow levels in 3-dimensional

arrangements and its applications. SIAM J Comput 29:912-953

Ahuja RK, Magnanti TL, Orlin JB (1993) Network flows: theory, algorithms, and applications,

exercise 12.23. Prentice-Hall, Englewood Cliffs, p 505

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, Berlin

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-244

Chelst KR, Schultz JP, Sanghvi N (1988) Issues and decision aids for designing branch networks.

J Retail Bank 10:5-17

Daskin MS (2013) Network and discrete location: models, algorithms, and applications, 2nd edn.

Wiley, Hoboken