Heuristic colour assignment strategies for merge models in graph colouring

Authors:
István Juhos;Attila Tóth;Jano I. van Hemert
Affiliations:
Dept. of Computer Algorithms and Artificial Intelligence, Univ. of Szeged, Hungary;Department of Computer Science, Univ. of Szeged (JGYTFK), Hungary;Centre for Emergent Computing, Napier University, Edinburgh, UK
Venue:
EvoCOP'05 Proceedings of the 5th European conference on Evolutionary Computation in Combinatorial Optimization
Year:
2005

Citing 8
Cited 1

New methods to color the vertices of a graph

Communications of the ACM
Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, Workshop, October 11-13, 1993

Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, Workshop, October 11-13, 1993
An Evolutionary Annealing Approach to Graph Coloring

Proceedings of the EvoWorkshops on Applications of Evolutionary Computing
Artificial Intelligence: A Modern Approach

Artificial Intelligence: A Modern Approach
A Tabu-Search Hyperheuristic for Timetabling and Rostering

Journal of Heuristics
On the futility of blind search: An algorithmic view of “no free lunch”

Evolutionary Computation
Where the really hard problems are

IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
No free lunch theorems for optimization

IEEE Transactions on Evolutionary Computation

Improving graph colouring algorithms and heuristics using a novel representation

EvoCOP'06 Proceedings of the 6th European conference on Evolutionary Computation in Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we combine a powerful representation for graph colouring problems with different heuristic strategies for colour assignment. Our novel strategies employ heuristics that exploit information about the partial colouring in an aim to improve performance. An evolutionary algorithm is used to drive the search. We compare the different strategies to each other on several very hard benchmarks and on generated problem instances, and show where the novel strategies improve the efficiency.