Composite-Move Tabu Search for Redistricting Optimization
A new algorithm, Composite-Move Tabu Search (CM-Tabu), addresses spatial redistricting optimization by expanding feasible neighborhood space while preserving contiguity. The method identifies minimal sets of units that can move together or switch pairs to maintain district contiguity, generating candidate moves in linear time. This approach tackles the challenge of contiguity constraints that often shrink feasible neighborhoods and trap searches in poor local optima. The research, published on arXiv (2605.06682v1), focuses on improving solution quality, speed, and flexibility for multi-criteria objectives in redistricting.
Key facts
- CM-Tabu systematically expands feasible neighborhood space in Tabu search while preserving contiguity.
- It identifies minimal sets of units that can move together or switch pairs as contiguity-preserving composite moves.
- Candidate single-unit and composite moves are generated in linear time.
- The algorithm addresses the contiguity constraint challenge in redistricting optimization.
- Published on arXiv with ID 2605.06682v1.
- Aims to improve solution quality, speed, and flexibility for multi-criteria objectives.
Entities
Institutions
- arXiv