Political Districting: from classical models to recent approaches

The Political Districting problem has been studied since the 60’s and many different models and techniques have been proposed with the aim of preventing districts’ manipulation which may favor some specific political party (gerrymandering). A variety of Political Districting models and procedures was provided in the Operations Research literature, based on single- or multiple-objective optimization. Starting from the forerunning papers published in the 60’s, this article reviews some selected optimization models and algorithms for Political Districting which gave rise to the main lines of research on this topic in the Operations Research literature of the last five decades.

[1]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[2]  Edward Forrest.  Apportionment by Computer , 1964 .

[3]  Gilbert Laporte,et al.  A tabu search heuristic and adaptive memory procedure for political districting , 2003, Eur. J. Oper. Res..

[4]  Gilbert Laporte,et al.  Metaheuristics: A bibliography , 1996, Ann. Oper. Res..

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

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

[7]  Bjørn Nygreen.  European assembly constituencies for wales - comparing of methods for solving a political districting problem , 1988, Math. Program..

[8]  Andrew B. Kahng,et al.  Old Bachelor Acceptance: A New Class of Non-Monotone Threshold Accepting Methods , 1995, INFORMS J. Comput..

[9]  Justo Puerto,et al.  Polynomial algorithms for partitioning a tree into single-center subtrees to minimize flat service costs , 2008 .

[10]  George L. Nemhauser,et al.  Scheduling to Minimize Interaction Cost , 1966, Oper. Res..

[11]  Brian W. Kernighan,et al.  An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

[12]  Lawrence D. Bodin.  A DISTRICTING EXPERIMENT WITH A CLUSTERING ALGORITHM , 1973 .

[13]  J. Weaver,et al.  Nonpartisan Political Redistricting by Computer , 1965 .

[14]  Sai-Ping Li,et al.  Taming the Gerrymander—Statistical physics approach to Political Districting Problem , 2005, physics/0511237.

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

[16]  Fernando Bação,et al.  Applying genetic algorithms to zone design , 2005, Soft Comput..

[17]  Juan C. Duque,et al.  Supervised Regionalization Methods: A Survey , 2007 .

[18]  Bruno Simeone,et al.  Local search algorithms for political districting , 2008, Eur. J. Oper. Res..

[19]  Sean Forman.  Congressional Redistricting Using A TSP-based Genetic Algorithm , 2002, GECCO.

[20]  J. K. Lenstra,et al.  Local Search in Combinatorial Optimisation. , 1997 .

[21]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[22]  Michelle H Browdy.  Simulated Annealing: An Improved Computer Model for Political Redistricting , 1990 .

[23]  G. Gallego,et al.  How to avoid stockouts when producing several items on a single facility? What to do if you can't? , 1996, Computers & Operations Research.

[24]  Franz Aurenhammer,et al.  An optimal algorithm for constructing the weighted voronoi diagram in the plane , 1984, Pattern Recognit..

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

[26]  H. Young.  Measuring the Compactness of Legislative Districts , 1988 .

[27]  José Rui Figueira,et al.  Multiple criteria districting problems , 2007, Ann. Oper. Res..

[28]  Ted Robert Gurr,et al.  Doctorates in the Social Sciences, 1920–1962 , 1964 .

[29]  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.

[30]  G. Laporte,et al.  Decoupage Electoral Automatise: Application A L’Lle De Montreal , 1981 .

[31]  G. Nemhauser,et al.  An Optimization Based Heuristic for Political Districting , 1998 .

[32]  Andrea Scozzari,et al.  Political districting: from classical models to recent approaches , 2011, 4OR.

[33]  Frank Harary,et al.  Graph Theory , 2016 .

[34]  G. Nemhauser,et al.  Optimal Political Districting by Implicit Enumeration Techniques , 1970 .

[35]  Stefan Nickel,et al.  Towards a unified territorial design approach — Applications, algorithms and GIS integration , 2005 .

[36]  Charles R. Hampton,et al.  Practical application of district compactness , 1993 .

[37]  Andrea Scozzari,et al.  Weighted Voronoi region algorithms for political districting , 2008, Math. Comput. Model..

[38]  Takeo Yamada,et al.  A heuristic algorithm for the mini-max spanning forest problem☆ , 1996 .

[39]  Takeo Yamada,et al.  A mini–max spanning forest approach to the political districting problem , 2009, Int. J. Syst. Sci..

[40]  Henry F. Kaiser,et al.  An Objective Method for Establishing Legislative Districts , 1966 .

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

[42]  Sartaj Sahni,et al.  Computationally Related Problems , 1974, SIAM J. Comput..

[43]  Bruce W. Lamar,et al.  Political district determination using large-scale network optimization , 1997 .