skip to main content
10.1145/3067695.3076103acmconferencesArticle/Chapter ViewAbstractPublication PagesgeccoConference Proceedingsconference-collections
poster

Solving electoral zone design problems with NSGA-II: application to redistricting in Mexico

Published: 15 July 2017 Publication History

Abstract

The electoral zone design problem consists in redrawing the boundaries of legislative districts for electoral purposes, in such a way that federal or state requirements are fulfilled. In Mexico, both population equality and compactness of the designed districts are considered as two conflicting objective functions. The present work represents the first intent to apply a classical Multi-Objective Evolutionary Algorithm (the NSGA-II) to this hard combinatorial problem, whereas the Mexican Federal Electoral Institute has traditionnally used a Simulated Annealing (SA) algorithm based on a weighted aggregation function. Despite some convergence troubles, the NSGA-II obtains promising results when compared with the SA algorithm, producing better-distributed solutions over a wider-spread front.

References

[1]
C. Chung-I. 2011. A Knowledge-based Evolution Algorithm approach to political districting problem. Computer Physics Communications 182, 1 (2011), 209--212.
[2]
K. Deb, A. Pratap, S. Aarwal, and T. Meyarivan. 2002. A fast and elitist non-dominated sorting genetic algorithm for multi-objective optimization: NSGA-II. IEEE Transactions on Evolutionary Computation 6, 2 (2002), 182--197.
[3]
K. C. Gilbert, D. D. Holmes, and R. E. Rosenthal. 1985. A Multiobjective Discrete Optimization Model for Land Allocation. Mgt Science 31 (1985), 150--1522.
[4]
F. Ricca and B. Simeone. 2008. Local search algorithms for political districting. European Journal of Operational Research 189, 3 (2008), 1409--1426.
[5]
E. A. Rincón-García, M. A. Gutiérrez-Andrade, S. G. de-los Cobos-Silva, P. Lara Velázquez, R. A. Mora-Gutiérrez, and A. Ponsich. 2012. A Discrete Particle Swarm Optimization Algorithm for Designing Electoral Zones. In Methods for decision making in an uncertain environment. World Scientific Proceedings Series on Computer Engineering and Information Science (Eds.). Reus, Spain, 174--197.

Cited By

View all
  • (2024)Evolutionary algorithms for solving single- and multiple-objective political redistricting problemsApplied Soft Computing10.1016/j.asoc.2024.111258152:COnline publication date: 1-Feb-2024
  • (2021)Optimal Voting and Voting-Districts; and Relationships between Constitutions and the Size of GovernmentGeopolitical Risk, Sustainability and “Cross-Border Spillovers” in Emerging Markets, Volume I10.1007/978-3-030-71415-4_5(257-312)Online publication date: 31-Aug-2021
  • (2019)Gerrymandering and computational redistrictingJournal of Computational Social Science10.1007/s42001-019-00053-9Online publication date: 13-Aug-2019

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
GECCO '17: Proceedings of the Genetic and Evolutionary Computation Conference Companion
July 2017
1934 pages
ISBN:9781450349390
DOI:10.1145/3067695
Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 15 July 2017

Check for updates

Author Tags

  1. NSGA-II
  2. multi-objective optimization
  3. zone design problem

Qualifiers

  • Poster

Conference

GECCO '17
Sponsor:

Acceptance Rates

Overall Acceptance Rate 1,669 of 4,410 submissions, 38%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)4
  • Downloads (Last 6 weeks)0
Reflects downloads up to 07 Mar 2025

Other Metrics

Citations

Cited By

View all
  • (2024)Evolutionary algorithms for solving single- and multiple-objective political redistricting problemsApplied Soft Computing10.1016/j.asoc.2024.111258152:COnline publication date: 1-Feb-2024
  • (2021)Optimal Voting and Voting-Districts; and Relationships between Constitutions and the Size of GovernmentGeopolitical Risk, Sustainability and “Cross-Border Spillovers” in Emerging Markets, Volume I10.1007/978-3-030-71415-4_5(257-312)Online publication date: 31-Aug-2021
  • (2019)Gerrymandering and computational redistrictingJournal of Computational Social Science10.1007/s42001-019-00053-9Online publication date: 13-Aug-2019

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media