Future paths for integer programming and links to artificial intelligence
Computers and Operations Research - Special issue: Applications of integer programming
Political districting: a tabu search algorithm and geographical interfaces
Political districting: a tabu search algorithm and geographical interfaces
A mini-max spanning forest approach to the political districting problem
International Journal of Systems Science
Weighted Voronoi region algorithms for political districting
Mathematical and Computer Modelling: An International Journal
A dual bounding scheme for a territory design problem
Computers and Operations Research
Hi-index | 0.00 |
Every few years, the city of Edmonton, Canada must review and evaluate changes to its electoral district boundaries. The review process that was completed in 2009 resulted in modifying the district plan from a six-ward system with two council members in each to a single-member 12-ward system. The authors of this paper designed the redistricting plan. This paper describes the algorithm we applied to solve the problem and the decision support system we used. The algorithm is based on a multicriteria mathematical model, which is solved by a tabu search heuristic embedded within a geographic information system (GIS)-based decision support system. The resulting district plan meets districting criteria, including population balance, contiguity, compactness, respect for natural boundaries, growth areas, and integrity of communities of interest. This plan was formally approved as a city bylaw and used in the municipal elections in 2010.