Glass, C. A. and Prügel-Bennett, A. (2003) Genetic Algorithm for Graph Colouring: Exploration of Galinier and Hao's algorithm. Journal of Combinatorial Optimization, 7 . pp. 229-236.
Download
![[img]](http://eprints.ecs.soton.ac.uk/style/images/fileicons/application_postscript.png)
| Postscript 151Kb |
Abstract
This paper examines the best current algorithm for solving the Chromatic
Number Problem, due to Galinier and Hao (Journal of Combinatorial
Optimization,1999, 3(4), pp 379-397). The algorithm combines a Genetic
Algorithm with Tabu Search. We show that the algorithm remains powerful
even if the Tabu Search component is eliminated, and explore the reasons
for its success where other Genetic Algorithms have failed. In addition we
propose a generalized algorithm for the Frequency Assignment Problem.
| Creators: | Celia A. Glass, Adam Prügel-Bennett |
|---|---|
| Item Type: | Article |
| Research Group: | Information - Signals, Images, Systems |
| Deposited On: | 01 May 2002 by Prugel-Bennett, Adam |
| ID Code: | 6037 |
| Last Modified: | 19 Dec 2009 18:26 |
| Performance Indicator: | EZ~02~01~11 |
| Citations: | Google Scholar: 13 |
Tools
Metadata
Download Statistics
Members of ECS may view the download statistics dashboard for this record.
Corrections
Repository Staff Only: item control page
