A Method for Districting Among Facilities

Ralph L. Keeney
Additional contact information
Ralph L. Keeney: Massachusetts Institute of Technology, Cambridge, Massachusetts

Operations Research, 1972, vol. 20, issue 3, 613-618

Abstract: A problem shared by many municipal agencies and many large industries is: Given n service facilities whose locations have been set in a region, how should that region best be apportioned among the facilities if each facility is to have primary responsibility for service in one district of the region? This paper presents a simple and intuitive procedure for determining the boundaries of the service districts, using the criterion that each facility serves all points to which it is closest in either distance or travel time. The procedure is designed to be computed rapidly, either by hand or on a computer.

Date: 1972
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.20.3.613 (application/pdf)

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:inm:oropre:v:20:y:1972:i:3:p:613-618

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().