Genetic Algorithm for Graph Colouring: Exploration of Galinier and Hao's algorithm
Glass, Celia A. and Prügel-Bennett, Adam (2003) Genetic Algorithm for Graph Colouring: Exploration of Galinier and Hao's algorithm. Journal of Combinatorial Optimization, 7, 229-236.
Download
![[img]](http://eprints.soton.ac.uk/style/images/fileicons/application_postscript.png) |
Postscript
Download (151Kb) |
Description/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.
| Item Type: | Article |
|---|---|
| Divisions: | Faculty of Physical and Applied Science > Electronics and Computer Science > Comms, Signal Processing & Control |
| Item ID: | 256037 |
| Date Deposited: | 01 May 2002 |
| Last Modified: | 02 Mar 2012 13:18 |
| Contributors: | Glass, Celia A. (Author) Prügel-Bennett, Adam (Author) |
| Date: | 2003 |
| Status: | Published |
| Further Information: | Google Scholar |
| URI: | http://eprints.soton.ac.uk/id/eprint/256037 |
Actions (login required)
 |
View Item |
