Genetic Algorithm for Graph Colouring: Exploration of Galinier and Hao's algorithm
Genetic Algorithm for Graph Colouring: Exploration of Galinier and Hao's algorithm
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.
229-236
Glass, Celia A.
4ae457e5-b653-49d7-8adb-1766901371cb
Prügel-Bennett, Adam
b107a151-1751-4d8b-b8db-2c395ac4e14e
2003
Glass, Celia A.
4ae457e5-b653-49d7-8adb-1766901371cb
Prügel-Bennett, Adam
b107a151-1751-4d8b-b8db-2c395ac4e14e
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, .
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.
Other
GH-Nov09.ps
- Other
More information
Published date: 2003
Organisations:
Southampton Wireless Group
Identifiers
Local EPrints ID: 256037
URI: http://eprints.soton.ac.uk/id/eprint/256037
PURE UUID: ad21954a-e595-4ae5-8acf-361f4307697e
Catalogue record
Date deposited: 01 May 2002
Last modified: 14 Mar 2024 05:38
Export record
Contributors
Author:
Celia A. Glass
Author:
Adam Prügel-Bennett
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics