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:
主要作者: | Lim, Heng Won. |
---|---|
其他作者: | Gwee, Bah Hwee |
格式: | Theses and Dissertations |
出版: |
2008
|
主題: | |
在線閱讀: | http://hdl.handle.net/10356/4664 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
機構: | Nanyang Technological University |
相似書籍
-
Time series modelling : design, testing and optimisation using genetic algorithms
由: Ting, Hoe Ming.
出版: (2009) -
Scan matching based on hill climbing algorithm
由: Ang, Jimmy
出版: (2011) -
Integrated Genetic Algorithm with Hill Climbing for the Bandwidth Minimization Porblem
由: LIM, Andrew, et al.
出版: (2003) -
New self-organizing algorithms for topological maps
由: Xu, Pengfei
出版: (2010) -
Adaptive active noise control with genetic algorithm
由: Yang, Xiaoguang
出版: (2008)