Incorporating genetic algorithm into simulated annealing based redistricting
Redistricting is a process of drawing lines as a boundary, it plays an important role in the process of decision making on space and spatial allocation. In redistricting, the main problem to be solved is to find the districting plan that maximizes the value function involved. Thus, redistricting pro...
Saved in:
| Main Author: | |
|---|---|
| Format: | Thesis |
| Language: | English English |
| Published: |
Faculty of Computer Science and Information Technology
2002
|
| Subjects: | |
| Online Access: | http://ir.unimas.my/id/eprint/500/8/Sim%20Kwan%20Hua%20%2824%20pgs%29.pdf http://ir.unimas.my/id/eprint/500/10/Sim%20KH.pdf http://ir.unimas.my/id/eprint/500/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Redistricting is a process of drawing lines as a boundary, it plays an important role in the process of decision making on space and spatial allocation. In redistricting, the main problem to be solved is to find the districting plan that maximizes the value function involved. Thus, redistricting process can be characterized as a combinatorial optimization problem and considered to be computationally intractable or NP-hard problem, so getting trapped in local optimal and difficulty in obtaining the most optimal solution have became the great challenge of redistricting problem. Latest approach of solving redistricting problem using simulated annealing has shown a significant improvement with ability to escape from local optimal. |
|---|