Multiobjective Genetic Algorithms for Reinforcing Equal Population in Congressional Districts

Redistricting is the process of partitioning a set of basic units into a given number of larger groups for electoral purposes. These groups must follow federal and state requirements to enhance fairness and minimize the impact of manipulating boundaries for political gain. In redistricting tasks, one of the most important criteria is equal population. As a matter of fact, redistricting plans can be rejected when the population deviation exceeds predefined limits. In the literature, there are several methods to balance population among districts. However, further discussion is needed to assess the effectiveness of these strategies. In this paper, we considered two different strategies, mean deviation and overall range. Additionally, a compactness measure is included to design well-shaped districts. In order to provide a wide set of redistricting plans that achieve good trade-offs between mean deviation, overall range, and compactness, we propose four multiobjective metaheuristic algorithms based on NSGA-II and SPEA-II. The proposed strategies were applied in California, Texas, and New York. Numerical results show that the proposed multiobjective approach can be a very valuable tool in any real redistricting process.

[1]  Xavier Blasco Ferragud,et al.  A Multiobjective Genetic Algorithm for the Localization of Optimal and Nearly Optimal Solutions Which Are Potentially Useful: nevMOGA , 2018, Complex..

[2]  Federico Liberatore,et al.  A multi-criteria Police Districting Problem for the efficient and effective design of patrol sector , 2015, Eur. J. Oper. Res..

[3]  L. Vanneschi,et al.  Multi-objective genetic algorithm with variable neighbourhood search for the electoral redistricting problem , 2017, Swarm Evol. Comput..

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

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

[6]  Martin J. Oates,et al.  The Pareto Envelope-Based Selection Algorithm for Multi-objective Optimisation , 2000, PPSN.

[7]  Cassius Tadeu Scarpin,et al.  Multi-objective optimization in partitioning the healthcare system of Parana State in Brazil , 2015 .

[8]  Lothar Thiele,et al.  Multiobjective Optimization Using Evolutionary Algorithms - A Comparative Case Study , 1998, PPSN.

[9]  Paulo Morelato França,et al.  A redistricting problem applied to meter reading in power distribution networks , 2014, Comput. Oper. Res..

[10]  Tomás de Jesús Mateo Sanguino,et al.  Optimal Modeling of Wireless LANs: A Decision-Making Multiobjective Approach , 2018, Complex..

[11]  Takeshi Shirabe,et al.  A Model of Contiguity for Spatial Unit Allocation , 2005 .

[12]  Raúl Ramos Lobo,et al.  Supervised regionalization methods: A survey , 2006 .

[13]  Marco Laumanns,et al.  SPEA2: Improving the strength pareto evolutionary algorithm , 2001 .

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

[15]  David W. S. Wong,et al.  Congressional districts: How “equal” are they? , 2020, GeoJournal.

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

[17]  K. Deb An Efficient Constraint Handling Method for Genetic Algorithms , 2000 .

[18]  Wang Yin Chai,et al.  A Multiobjective Hybrid Metaheuristic Approach for GIS-based Spatial Zoning Model , 2004, J. Math. Model. Algorithms.

[19]  Minvydas Ragulskis,et al.  Damage Diagnosis in 3D Structures Using a Novel Hybrid Multiobjective Optimization and FE Model Updating Framework , 2018, Complex..

[20]  Jason Parent,et al.  Ten compactness properties of circles: measuring shape in geography , 2010 .

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

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

[23]  Hugo Jair Escalante,et al.  GRASP with path relinking for commercial districting , 2016, Expert Syst. Appl..

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

[25]  A. Lara,et al.  A Simulated Annealing-Based Multiobjective Optimization Algorithm for Political Districting , 2018 .

[26]  Pedro Lara-Velázquez,et al.  A Multiobjective Algorithm for Redistricting , 2013 .

[27]  Wei Xu,et al.  A non-dominated sorting genetic algorithm for the location and districting planning of earthquake shelters , 2014, Int. J. Geogr. Inf. Sci..

[28]  Jacques A. Ferland,et al.  Decision Support System for the School Districting Problem , 1990, Oper. Res..

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

[30]  Rosa G. González-Ramírez,et al.  A GRASP-Tabu Heuristic Approach to Territory Design for Pickup and Delivery Operations for Large-Scale Instances , 2017 .

[31]  Julián Molina Luque,et al.  Multiobjective scatter search for a commercial territory design problem , 2012, Ann. Oper. Res..

[32]  J. Guo,et al.  MOZART : A Multi-Objective Zoning and AggRegation Tool , 2001 .

[33]  F. Liberatore,et al.  A Comparison of Local Search Methods for the Multicriteria Police Districting Problem on Graph , 2016 .

[34]  F. Glover,et al.  Scatter Search and Path Relinking: Foundations and Advanced Designs , 2004 .

[35]  Kalyanmoy Deb,et al.  A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..

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

[37]  Fred W. Glover,et al.  The case for strategic oscillation , 2011, Ann. Oper. Res..