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: | |
|---|---|
| Other Authors: | |
| 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 |
| Summary: | 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. |
|---|