Premium
A Geocomputational Heuristic for Coverage Maximization in Service Facility Siting
Author(s) -
Murray Alan T,
Matisziw Timothy C,
Wei Hu,
Tong Daoqin
Publication year - 2008
Publication title -
transactions in gis
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.721
H-Index - 63
eISSN - 1467-9671
pISSN - 1361-1682
DOI - 10.1111/j.1467-9671.2008.01125.x
Subject(s) - facility location problem , service (business) , heuristic , maximization , computer science , order (exchange) , operations research , transport engineering , business , engineering , mathematical optimization , mathematics , finance , marketing , artificial intelligence
Siting service facilities in order to maximize regional coverage is important when budget resources are limited. Various approaches exist for addressing this particular planning problem for discrete or continuous representations of potential facility sites and demand to be served. In cases where both candidate facility sites and service demand are continuous, approaches for maximizing regional coverage have only examined the siting of a single facility. In this article, a geocomputational approach is proposed for addressing multiple facility siting when demand is continuously distributed and facilities may be located anywhere in the region. Emergency warning siren location is used to highlight the developed approach.