A Clustering Approach for NSGA ‐ II in Political Redistricting
Networks · 2026-12 · 88 (4) · 402-417
DOI: 10.1002/net.70063 ↗At a glance
Journal article in Networks, published online on 2026-07-25. Written by Blake Splitter and 2 co-authors. Cited 1 times so far (Crossref); 31 references.
Abstract (original language)
Political redistricting is a complex, multi‐objective problem that has been extensively studied. One approach to solve this geographical partitioning problem is to use multiobjective genetic algorithms applied to the adjacency graph of precincts. Following the work of Vanneschi et al., we develop an algorithm using a Non‐Dominated Sorting Genetic Algorithm (NSGA‐II) to build electoral plans in the state of South Carolina. Our work (which we name Cluster‐NSGA‐II) utilizes a novel clustering approach to breed children rather than the standard crossover step. We find that this approach is competitive with other similar algorithms in terms of both solution diversity and Pareto optimality.
Cite
APA
Splitter, B., Saltzman, M. J., & Kurz, M. E. (2026). A Clustering Approach for NSGA ‐ II in Political Redistricting. Networks, 88(4), 402-417. https://doi.org/10.1002/net.70063
Vancouver
Splitter B, Saltzman MJ, Kurz ME. A Clustering Approach for NSGA ‐ II in Political Redistricting. Networks. 2026;88(4):402-417. doi:10.1002/net.70063
BibTeX
@article{Splitter2026,
author = {Splitter, Blake and Saltzman, Matthew J. and Kurz, Mary E.},
title = {A Clustering Approach for NSGA ‐ II in Political Redistricting},
journal = {Networks},
year = {2026},
volume = {88},
number = {4},
pages = {402--417},
doi = {10.1002/net.70063}
}
EUVIMED