Abstract
This paper models the political districting of Kuwait as a multiple objective combinatorial optimization problem, where each political system is assessed in terms of population and voting equity, geographical contiguity, and social, religious, ethnic, family size, and educational homogeneity. First, it proposes four constructive heuristics and a specialized simulated annealing to generate alternative non-dominated districting plans that may "guarantee" a national consensus. Second, it searches for a districting plan that optimizes a set of criteria (classified as hard and soft constraints) using a tree-search based heuristic. The heuristic takes advantage and combines the orthogonal but complementary strengths of constraint and integer programming. Finally, it compares the proposed solution to both the existing and the previously applied patterns. Thus, this paper offer politicians a multiple criteria evaluation method that they may apply to choose the most "appropriate" political districting pattern.
Original language | English |
---|---|
Pages (from-to) | 160-188 |
Number of pages | 29 |
Journal | Kuwait Journal of Science |
Volume | 42 |
Issue number | 2 |
Publication status | Published - 2015 |
Keywords
- Combinatorial optimization
- Constraint propagation
- Heuristics
- Integer programming
- Multiple objective