Incorporating genetic algorithm into simulated annealing based redistricting

Sim, Kwan Hua. (2002) Incorporating genetic algorithm into simulated annealing based redistricting. Masters thesis, Universiti Malaysia Sarawak.

[img]
Preview
PDF
sim_kwan_hua.pdf

Download (5MB) | Preview
[img] PDF (Please get the password from Digital Collection Development Unit, ext: 3932 / 3914)
2011-08-thSimKHfull.pdf
Restricted to Registered users only

Download (18MB)

Abstract

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.

Item Type: Thesis (Masters)
Uncontrolled Keywords: algorithm, Universiti Malaysia Sarawak, UNIMAS, postgraduate, research, IPTA, education, universiti, university, kuching, samarahan, sarawak, malaysia
Subjects: A General Works > AC Collections. Series. Collected works
A General Works > AC Collections. Series. Collected works

Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Divisions: Academic Faculties, Institutes and Centres > Faculty of Computer Science and Information Technology
Depositing User: Karen Kornalius
Date Deposited: 18 Dec 2013 02:44
Last Modified: 01 Sep 2015 02:25
URI: http://ir.unimas.my/id/eprint/500

Actions (For repository members only: login required)

View Item View Item