A tabu search heuristic and adaptive memory procedure for political districting

In political districting problems, the aim is to partition a territory into electoral constituencies, subject to some side constraints. The most common side constraints include contiguity, population equality, compactness, and socio-economic homogeneity. We propose a formulation in which the various...

Full description

Saved in:
Bibliographic Details
Published inEuropean journal of operational research Vol. 144; no. 1; pp. 12 - 26
Main Authors Bozkaya, Burcin, Erkut, Erhan, Laporte, Gilbert
Format Journal Article
LanguageEnglish
Published Amsterdam Elsevier B.V 2003
Elsevier
Elsevier Sequoia S.A
SeriesEuropean Journal of Operational Research
Subjects
Districts
Heuristic
Mathematical models
Multicriteria optimization
Operations research
Optimization
Political behavior
Political districting
Studies
Tabu search heuristic
Edmonton Alberta Canada
Canada
Tabu search heuristic
Multicriteria optimization
Political districting
Online AccessGet full text
ISSN0377-2217
1872-6860
DOI10.1016/S0377-2217(01)00380-0

Cover

More Information
Summary:In political districting problems, the aim is to partition a territory into electoral constituencies, subject to some side constraints. The most common side constraints include contiguity, population equality, compactness, and socio-economic homogeneity. We propose a formulation in which the various constraints are integrated into a single multicriteria function. We solve the problem by means of a tabu search and adaptive memory heuristic. The procedure is illustrated on real data from the city of Edmonton.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0377-2217
1872-6860
DOI:10.1016/S0377-2217(01)00380-0