An Algorithm for Facility Location in a Districted Region

C ReVelle and D J Elzinga
Additional contact information
C ReVelle: Department of Geography and Environmental Engineering, The Johns Hopkins University, Baltimore, MD 21218, USA
D J Elzinga: Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL 32611, USA

Environment and Planning B, 1989, vol. 16, issue 1, 41-50

Abstract: The problem of facility siting in a districted region is discussed and a two-stage algorithm proposed. The first stage consists of solving a particular facility siting problem (for example, a p -median problem, or a maximal location covering problem) in each district for all possible allocations of facilities to a district with respect to the number of facilities allocated in each district. The second stage is the allocation of resources (facilities) among the districts. A greedy algorithm is proposed to solve the resource allocation problem with a criterion of minimizing the sum of weighted distances under convex conditions.

Date: 1989
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://journals.sagepub.com/doi/10.1068/b160041 (text/html)

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:sae:envirb:v:16:y:1989:i:1:p:41-50

DOI: 10.1068/b160041

Access Statistics for this article

More articles in Environment and Planning B
Bibliographic data for series maintained by SAGE Publications ().