Cooperative cover location problems: The planar case

Oded Berman, Zvi Drezner and Dmitry Krass

IISE Transactions, 2010, vol. 42, issue 3, 232-246

Abstract: A cooperative-covering family of location problems is proposed in this paper. Each facility emits a (possibly non-physical) “signal” which decays over the distance and each demand point observes the aggregate signal emitted by all facilities. It is assumed that a demand point is covered if its aggregate signal exceeds a given threshold; thus facilities cooperate to provide coverage, as opposed to the classical coverage location model where coverage is only provided by the closest facility. It is shown that this cooperative assumption is appropriate in a variety of applications. Moreover, ignoring the cooperative behavior (i.e., assuming the traditional individual coverage framework) leads to solutions that are significantly worse than the optimal cooperative cover solutions; this is illustrated with a case study of locating warning sirens in North Orange County, California. The problems are formulated, analyzed and solved in the plane for the Euclidean distance case. Optimal and heuristic algorithms are proposed and extensive computational experiments are reported.

Date: 2010
References: Add references at CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://hdl.handle.net/10.1080/07408170903394355 (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:taf:uiiexx:v:42:y:2010:i:3:p:232-246

Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/uiie20

DOI: 10.1080/07408170903394355

Access Statistics for this article

IISE Transactions is currently edited by Jianjun Shi

More articles in IISE Transactions from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().