Districting Modeling with Exact Contiguity Constraints

Takeshi Shirabe
Additional contact information
Takeshi Shirabe: Institute for Geoinformation and Cartography, Vienna University of Technology, Gußhausstrasse 27-29, Vienna 1040, Austria

Environment and Planning B, 2009, vol. 36, issue 6, 1053-1066

Abstract: A classic problem in planning is districting, which aims to partition a given area into a specified number of subareas according to required criteria. Size, compactness, and contiguity are among the most frequently used districting criteria. While size and compactness may be interpreted differently in different contexts, contiguity is an unambiguous topological property. A district is said to be contiguous if all locations in it are ‘connected’—that is, one can travel between any two locations in the district without leaving it. This paper introduces a new integer-programming-based approach to districting modeling, which enforced contiguity constraints independently of any other criteria that might be additionally imposed. Three experimental models are presented, and tested with sample data on the forty-eight conterminous US states. A major implication of this paper is that the exact formulation of a contiguity requirement allows planners to address diverse sets of districting criteria.

Date: 2009
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
https://journals.sagepub.com/doi/10.1068/b34104 (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:36:y:2009:i:6:p:1053-1066

DOI: 10.1068/b34104

Access Statistics for this article

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