BARD: Better Automated Redistricting

BARD is the first (and at time of writing, only) open source software package for general redistricting and redistricting analysis. BARD provides methods to create, display, compare, edit, automatically refine, evaluate, and profile political districting plans. BARD aims to provide a framework for scientific analysis of redistricting plans and to facilitate wider public participation in the creation of new plans. BARD facilitates map creation and refinement through command-line, graphical user interface, and automatic methods. Since redistricting is a computationally complex partitioning problem not amenable to an exact optimization solution, BARD implements a variety of selectable metaheuristics that can be used to refine existing or randomly-generated redistricting plans based on user-determined criteria. Furthermore, BARD supports automated generation of redistricting plans and profiling of plans by assigning different weights to various criteria, such as district compactness or equality of population. This functionality permits exploration of trade-offs among criteria. The intent of a redistricting authority may be explored by examining these trade-offs and inferring which reasonably observable plans were not adopted. Redistricting is a computationally-intensive problem for even modest-sized states. Performance is thus an important consideration in BARD's design and implementation. The program implements performance enhancements such as evaluation caching, explicit memory management, and distributed computing across snow clusters.

[1]  B. Cain,et al.  From Equality to Fairness : The Path of Political Reform since Baker v Carr , 2004 .

[2]  G. Heuvelink,et al.  Using Linear Integer Programming for Multi-Site Land-Use Allocation , 2003 .

[3]  David H. Wolpert,et al.  No free lunch theorems for optimization , 1997, IEEE Trans. Evol. Comput..

[4]  Donald E. Knuth,et al.  The art of computer programming. Vol.2: Seminumerical algorithms , 1981 .

[5]  B. Grofman,et al.  Measuring Compactness and the Role of a Compactness Standard in a Test for Partisan and Racial Gerrymandering , 1990, The Journal of Politics.

[6]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .

[7]  Jasjeet S. Sekhon,et al.  Genetic Optimization Using Derivatives , 2011, Political Analysis.

[8]  Ningchuan Xiao,et al.  An Evolutionary Algorithm for Site Search Problems , 2006 .

[9]  The Record of American Democracy, 1984 - 1990 , 1997 .

[10]  P. Samuelson Consumption Theory in Terms of Revealed Preference , 1948 .

[11]  Micah Altman,et al.  Districting principles and democratic representation , 1998 .

[12]  J. O’Loughlin The Identification and Evaluation of Racial Gerrymandering , 1982 .

[13]  J. Weaver,et al.  A Procedure for Nonpartisan Districting: Development of Computer Techniques , 1963 .

[14]  Gary King,et al.  A Unified Method of Evaluating Electoral Systems and Redistricting Plans , 1994 .

[15]  Michel Gendreau,et al.  Metaheuristics in Combinatorial Optimization , 2022 .

[16]  John W. Shepherd,et al.  Decentralizing High School Administration in Detroit: An Evaluation of Alternative Strategies of Political Control , 1972 .

[17]  Richard G. Niemi,et al.  A Theory of Political Districting , 1978, American Political Science Review.

[18]  Prostitution In Nevada,et al.  ANNALS of the Association of American Geographers , 1974 .

[19]  The Effects of Spatial Population Distributions and Political Districting on Minority Representation , 1999 .

[20]  Bruno Simeone,et al.  Evaluation and Optimization of Electoral Systems , 1987 .

[21]  David S. Johnson,et al.  The NP-Completeness Column: An Ongoing Guide , 1982, J. Algorithms.

[22]  M. Armstrong,et al.  Geographical optimization using evolutionary algorithms , 2003 .

[23]  R. Engstrom,et al.  Pruning Thorns from the Thicket: An Empirical Test of the Existence of Racial Gerrymandering , 1977 .

[24]  B. Forest Information sovereignty and GIS: the evolution of “communities of interest” in political redistricting , 2004 .

[25]  S. Nagel Simplified Bipartisan Computer Redistricting , 1965 .

[26]  Peter J. Taylor,et al.  Seats, Votes, and the Spatial Organization of Elections , 1980 .

[27]  E. Tufte The Relationship between Seats and Votes in Two-Party Systems , 1973, American Political Science Review.

[28]  Paul Gronke,et al.  Competing Redistricting Plans As Evidence of Political Motives , 1999 .

[29]  李幼升,et al.  Ph , 1989 .

[30]  David Rossiter,et al.  Program GROUP: The Identification of All Possible Solutions to a Constituency-Delimitation Problem , 1981 .

[31]  Na Li,et al.  Simple Parallel Statistical Computing in R , 2007 .

[32]  V. Lenin,et al.  The United States of America , 2002, Government Statistical Agencies and the Politics of Credibility.

[33]  Donald E. Knuth The Art of Computer Programming 2 / Seminumerical Algorithms , 1971 .

[34]  Fred W. Glover,et al.  Future paths for integer programming and links to artificial intelligence , 1986, Comput. Oper. Res..

[35]  Bernard Grofman,et al.  Representation and redistricting issues , 1982 .

[36]  Micah Altman,et al.  Is automation the answer: the computational complexity of automated redistricting , 1997 .

[37]  W. Lucas Fair Representation: Meeting the Ideal of One Man, One Vote. By Michel L. Balinski and H. Peyton Young , 1985 .

[38]  Michael P. McDonald,et al.  From Crayons to Computers , 2005 .

[39]  Richard G. Niemi,et al.  Minority Representation and the Quest for Voting Equality: Defining and Measuring Racially Polarized Voting and Other Elements of the Totality of the Circumstances , 1992 .

[40]  Micah Altman,et al.  Modeling the effect of mandatory district compactness on partisan gerrymanders , 1998 .

[41]  W. Vickrey On the Prevention of Gerrymandering , 1961 .

[42]  M. Resende,et al.  A probabilistic heuristic for a computationally difficult set covering problem , 1989 .

[43]  C. Cirincione,et al.  Assessing South Carolina's 1990s congressional districting , 2000 .