A Method for Districting Among Facilities.
Purchase Print Copy
| Format | List Price | Price | |
|---|---|---|---|
| Add to Cart | Paperback6 pages | $20.00 | $16.00 20% Web Discount |
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. 6 pp. Ref.
This report is part of the RAND Corporation Paper series. The paper was a product of the RAND Corporation from 1948 to 2003 that captured speeches, memorials, and derivative research, usually prepared on authors' own time and meant to be the scholarly or scientific contribution of individual authors to their professional fields. Papers were less formal than reports and did not require rigorous peer review.
This document and trademark(s) contained herein are protected by law. This representation of RAND intellectual property is provided for noncommercial use only. Unauthorized posting of this publication online is prohibited; linking directly to this product page is encouraged. Permission is required from RAND to reproduce, or reuse in another form, any of its research documents for commercial purposes. For information on reprint and reuse permissions, please visit www.rand.org/pubs/permissions.
The RAND Corporation is a nonprofit institution that helps improve policy and decisionmaking through research and analysis. RAND's publications do not necessarily reflect the opinions of its research clients and sponsors.