A study of evaluation functions for the graph K-coloring problem

Authors:
Daniel Cosmin Porumbel;Jin-Kao Hao;Pascale Kuntz
Affiliations:
LERIA, Université d'Angers, Angers Cedex 01, France;LERIA, Université d'Angers, Angers Cedex 01, France;LINA, PolytechNantes, Nantes, France
Venue:
EA'07 Proceedings of the Evolution artificielle, 8th international conference on Artificial evolution
Year:
2007

Citing 2
Cited 0

Using tabu search techniques for graph coloring

Computing
Optimization by simulated annealing: an experimental evaluation; part II, graph coloring and number partitioning

Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

The evaluation or fitness function is a key component ofany heuristic search algorithm. This paper introduces a new evaluationfunction for the well-known graph K-coloring problem. This functiontakes into account not only the number of conflicting vertices, but alsoinherent information related to the structure of the graph. To assessthe effectiveness of this new evaluation function, we carry out a numberof experiments using a set of DIMACS benchmark graphs. Based onstatistic data obtained with a parameter free steepest descent, we showan improvement of the new evaluation function over the classical one.