Hybrid genetic hill-climbing algorithm for four-colouring map optimisation
The objective of an n-region 4-colouring map problem is to colour the regions in the map such that the adjacent regions (sharing a common boundary) are coloured differently to distinguish the different regions and complete the colouring in the shortest (computation) time possible.
Saved in:
Main Author: | Lim, Heng Won. |
---|---|
Other Authors: | Gwee, Bah Hwee |
Format: | Theses and Dissertations |
Published: |
2008
|
Subjects: | |
Online Access: | http://hdl.handle.net/10356/4664 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Similar Items
-
Time series modelling : design, testing and optimisation using genetic algorithms
by: Ting, Hoe Ming.
Published: (2009) -
Scan matching based on hill climbing algorithm
by: Ang, Jimmy
Published: (2011) -
Integrated Genetic Algorithm with Hill Climbing for the Bandwidth Minimization Porblem
by: LIM, Andrew, et al.
Published: (2003) -
New self-organizing algorithms for topological maps
by: Xu, Pengfei
Published: (2010) -
Adaptive active noise control with genetic algorithm
by: Yang, Xiaoguang
Published: (2008)