Mathematical Programming Formulations for Practical Political Districting

Political districting is a very well-known technical problem related to electoral systems in which the transformation of votes into seats depends on the subdivision of the national electoral body into a given number of smaller territorial bodies. After a proper discretization of the territory, the problem consists of partitioning the territory into a prefixed number of regions which satisfy a set of geographic and demographic criteria. The problem structure falls back into one of the more general territory design problems, which arises also in other types of applications, such as school and hospital districting, sales districting, etc. In the application to political elections, the aim is to prevent districts’ manipulation which may favor the electoral outcome of some specific party (Gerrymandering). Many political districting models and procedures have been proposed in the literature since the 1960s following different optimization strategies. Among them, many exploit mathematical programming which is one of the most used tools to solve problems in practice. The attractive feature of mathematical programming is that the model is easy-to-read, its resolution can be automated, and good compromise solutions can be computed in reasonable computational time for small and medium size problems.

[1]  J D Thoreson,et al.  Computers in behavioral science. Legislative districting by computer simulation. , 1967, Behavioral science.

[2]  Justo Puerto,et al.  Partitioning a graph into connected components with fixed centers and optimizing cost‐based objective functions or equipartition criteria , 2016, Networks.

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

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

[5]  Richard L. Church,et al.  The p-Regions Problem. p-区域问题 , 2011 .

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

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

[8]  A. Zoltners,et al.  Sales Territory Alignment: A Review and Model , 1983 .

[9]  Sidney W. Hess,et al.  Experiences with a Sales Districting Model: Criteria and Implementation , 1971 .

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

[11]  Leslie E. Trotter,et al.  Properties of vertex packing and independence system polyhedra , 1974, Math. Program..

[12]  Andrea Scozzari,et al.  Network flow methods for electoral systems , 2012, Networks.

[13]  Justin C. Williams.  POLITICAL REDISTRICTING: A REVIEW , 2005 .

[14]  Andrea Scozzari,et al.  Political Districting: from classical models to recent approaches , 2013, Annals of Operations Research.

[15]  Eric Alfredo Rincón García,et al.  A System for Political Districting in the State of Mexico , 2015, MICAI.

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

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

[18]  Bruno Simeone,et al.  Parametric maximum flow methods for minimax approximation of target quotas in biproportional apportionment , 2012, Networks.

[19]  Andrea Scozzari,et al.  Error minimization methods in biproportional apportionment , 2012 .

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

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

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

[23]  Takeshi Shirabe,et al.  Districting Modeling with Exact Contiguity Constraints , 2009 .

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

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

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

[27]  Leslie E. Trotter,et al.  Vertex packings: Structural properties and algorithms , 1975, Math. Program..

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