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:
| 主要作者: | |
|---|---|
| 其他作者: | |
| 格式: | Theses and Dissertations |
| 出版: |
2008
|
| 主題: | |
| 在線閱讀: | http://hdl.handle.net/10356/4664 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 機構: | Nanyang Technological University |