Journal article
On worst-case aggregation analysis for network location problems
Annals of operations research, Vol.40(1), pp.229-246
12/1992
DOI: 10.1007/BF02060479
Abstract
Network location problems occur when new facilities must be located on a network, and the network distances between new and existing facilities are important. In urban, regional, or geographic contexts, there may be hundreds of thousands (or more) of existing facilities, in which case it is common to aggregate existing facilities, e.g. represent all the existing facility locations in a zip code area by a centroid. This aggregation makes the size of the problem more manageable for data collection and data processing purposes, as well as for purposes of analysis; at the same time, it introduces errors, and results in an approximating location problem being solved. There seems to be relatively little theory for doing aggregation, or evaluating the results of aggregation; most approaches are based on experimentation or computational studies. We propose a theory that has the potential to improve the means available for doing aggregation.
Details
- Title: Subtitle
- On worst-case aggregation analysis for network location problems
- Creators
- Richard L. Francis - University of FloridaTimothy J. Lowe - University of Iowa
- Resource Type
- Journal article
- Publication Details
- Annals of operations research, Vol.40(1), pp.229-246
- DOI
- 10.1007/BF02060479
- ISSN
- 0254-5330
- eISSN
- 1572-9338
- Number of pages
- 18
- Language
- English
- Date published
- 12/1992
- Academic Unit
- Business Analytics
- Record Identifier
- 9984963214902771
Metrics
1 Record Views