AINeutralarXiv – CS AI · 7h ago5/10
🧠
Fast and Effective Redistricting Optimization via Composite-Move Tabu Search
Researchers present CM-Tabu, a composite-move Tabu search algorithm that solves spatial redistricting optimization problems more effectively by expanding the feasible solution space while maintaining district contiguity constraints. The method uses graph analysis to identify minimal unit movements or swaps that preserve connectivity, achieving superior solution quality and computational efficiency compared to traditional approaches.