Premium
THE FIXED CHARGE MAXIMAL COVERING LOCATION PROBLEM
Author(s) -
Church Richard L.,
Davis Rhonda R.
Publication year - 1992
Publication title -
papers in regional science
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.937
H-Index - 64
eISSN - 1435-5957
pISSN - 1056-8190
DOI - 10.1111/j.1435-5597.1992.tb01843.x
Subject(s) - facility location problem , constraint (computer aided design) , set (abstract data type) , mathematical optimization , fixed charge , location theory , 1 center problem , computer science , fixed cost , operations research , mathematics , engineering , economics , microeconomics , geometry , civil engineering , chemistry , molecular physics , programming language
The maximal covering location problem is based on locating p facilities in such a manner that coverage is maximized within set distance or time standards. This problem has been extended in a number of different ways where the main theme still involves locating a fixed number of facilities. In many applications site costs are not equal; this should cast doubt on the use of a constraint that fixes the number of facilities at a given number as compared to an approach that minimizes site costs and maximizes coverage. This paper addresses the use of site costs in a maximal covering location problem and presents several approaches to solutions, along with computational results. Theoretical linkages to other location models are also presented.