Redistricting

Fast and Effective Redistricting Optimization via Composite-Move Tabu Search

This research introduces a composite-move Tabu search (CM-Tabu) algorithm designed for fast and effective spatial redistricting optimization. It tackles the contiguity constraint by expanding the feasible neighborhood to include composite moves, ensuring better exploration and preventing the search from getting trapped in poor local optima.