Maximising coverage of spatial demand for service
AbstractHow to represent geographic space has long been an issue in location modelling. Facilities, demand and/or the region of interest are often abstracted using aggregated points. However, substantial errors can be introduced, and obtained solutions could be dependent on the degree of aggregation. To address this, geographic representation of space is undergoing renewed research interest in spatial analysis and modelling. In this article the maximal coverage problem is studied, with a particular focus on demand coverage representation. Due to the limitations of existing modelling approaches for examining the coverage of space, there exist significant discrepancies between what is modelled and actual geographic coverage. In order to accurately reflect the mechanism of maximal coverage for spatial objects (points, lines or polygons), we introduce a new model explicitly accounting for joint service provided by multiple facilities. The new model can be viewed as an extension of existing approaches, but also a generalisation. An application to warning siren siting is carried out to demonstrate the merits of this new approach. Copyright (c) 2008 the author(s). Journal compilation (c) 2008 RSAI.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Bibliographic InfoArticle provided by Wiley Blackwell in its journal Papers in Regional Science.
Volume (Year): 88 (2009)
Issue (Month): 1 (03)
Contact details of provider:
Web page: http://www.blackwellpublishing.com/journal.asp?ref=1056-8190
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
- CHEVALIER, Philippe & THOMAS, Isabelle & GERAETS, David & GOETGHEBEUR, Els, .
"Locating fire stations: an integrated approach for Belgium,"
CORE Discussion Papers RP
-2390, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- Chevalier, Philippe & Thomas, Isabelle & Geraets, David & Goetghebeur, Els & Janssens, Olivier & Peeters, Dominique & Plastria, Frank, 2012. "Locating fire stations: An integrated approach for Belgium," Socio-Economic Planning Sciences, Elsevier, vol. 46(2), pages 173-182.
- CHEVALIER, Philippe & THOMAS, Isabelle & GERAETS, David & GOETGHEBEUR, Els, 2010. "Locating fire-stations: an integrated approach for Belgium," CORE Discussion Papers 2010008, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- Murray, Alan T. & Wei, Ran, 2013. "A computational approach for eliminating error in the solution of the location set covering problem," European Journal of Operational Research, Elsevier, vol. 224(1), pages 52-64.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Wiley-Blackwell Digital Licensing) or (Christopher F Baum).
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.