The geo-graph in practice: creating United States Congressional Districts from census blocks

D. M. King (), S. H. Jacobson () and E. C. Sewell ()
Additional contact information
D. M. King: University of Illinois at Urbana-Champaign
S. H. Jacobson: University of Illinois at Urbana-Champaign
E. C. Sewell: Southern Illinois University Edwardsville

Computational Optimization and Applications, 2018, vol. 69, issue 1, No 2, 25-49

Abstract: Abstract Every 10 years, United States Congressional Districts must be redesigned in response to a national census. While the size of practical political districting problems is typically too large for exact optimization approaches, heuristics such as local search can help stakeholders quickly identify good (but suboptimal) plans that suit their objectives. However, enforcing a district contiguity constraint during local search can require significant computation; tools that can reduce contiguity-based computations in large practical districting problems are needed. This paper applies the geo-graph framework to the creation of United States Congressional Districts from census blocks in four states—Arizona, Massachusetts, New Mexico, and New York—and finds that (a) geo-graph contiguity assessment algorithms reduce the average number of edges visited during contiguity assessments by at least three orders of magnitude in every problem instance when compared with simple graph search, and (b) the assumptions of the geo-graph model are easily adapted to the sometimes-irregular census block geography with only superficial impact on the solution space. These results show that the geo-graph model and its associated contiguity algorithms provide a powerful constraint assessment tool to political districting stakeholders.

Keywords: Planar graphs; Graph partitioning; Geographic districting; Graph connectivity (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10589-017-9936-3 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

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:spr:coopap:v:69:y:2018:i:1:d:10.1007_s10589-017-9936-3

Ordering information: This journal article can be ordered from
http://www.springer.com/math/journal/10589

DOI: 10.1007/s10589-017-9936-3

Access Statistics for this article

Computational Optimization and Applications is currently edited by William W. Hager

More articles in Computational Optimization and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().