Demand Point Aggregation for Planar Covering Location Models
H. Emir-Farinas () and
R. Francis ()
Annals of Operations Research, 2005, vol. 136, issue 1, 175-192
Abstract:
The covering location problem seeks the minimum number of facilities such that each demand point is within some given radius of its nearest facility. Such a model finds application mostly in locating emergency types of facilities. Since the problem is NP-hard in the plane, a common practice is to aggregate the demand points in order to reduce the computational burden. Aggregation makes the size of the problem more manageable but also introduces error. Identifying and controlling the magnitude of the error is the subject of this study. We suggest several aggregation methods with a priori error bounds, and conduct experiments to compare their performance. We find that the manner by which infeasibility is measured greatly affects the best choice of an aggregation method. Copyright Springer Science + Business Media, Inc. 2005
Keywords: location models; demand point aggregation; covering problem (search for similar items in EconPapers)
Date: 2005
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (7)
Downloads: (external link)
http://hdl.handle.net/10.1007/s10479-005-2044-2 (text/html)
Access to full text is restricted to subscribers.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:136:y:2005:i:1:p:175-192:10.1007/s10479-005-2044-2
Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479
DOI: 10.1007/s10479-005-2044-2
Access Statistics for this article
Annals of Operations Research is currently edited by Endre Boros
More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().