Optimal political districting

Optimal political districting

0.00 Avg rating0 Votes
Article ID: iaor19971942
Country: United Kingdom
Volume: 23
Issue: 12
Start Page Number: 1147
End Page Number: 1161
Publication Date: Dec 1996
Journal: Computers and Operations Research
Authors:
Keywords: programming: transportation, transportation: general
Abstract:

For the political districting problem, the paper proposes the following solution methodology: (a) use Lagrangian relaxation to determine the centres of the districts, then; (b) use the transportation technique to assign population units to centres, and finally; (c) resolve the splitting problem by solving a sequence of capacitated transportation problems. This method is applied to the problem of determining the provincial districts for the City of Saskatoon, Canada, and the results are compared with the actual districting done in 1993 by the Electoral Boundaries Commission.

Reviews

Required fields are marked *. Your email address will not be published.