An Evolutionary Annealing Approach to Graph Coloring

Authors:
Dimitris Fotakis;Spiridon D. Likothanassis;Stamatis K. Stefanakos
Affiliations:
-;-;-
Venue:
Proceedings of the EvoWorkshops on Applications of Evolutionary Computing
Year:
2001

Citing 6
Cited 3

Future paths for integer programming and links to artificial intelligence

Computers and Operations Research - Special issue: Applications of integer programming
Using tabu search techniques for graph coloring

Computing
Simulated annealing and Boltzmann machines: a stochastic approach to combinatorial optimization and neural computing

Simulated annealing and Boltzmann machines: a stochastic approach to combinatorial optimization and neural computing
Optimization by simulated annealing: an experimental evaluation; part II, graph coloring and number partitioning

Operations Research
LEDA: a platform for combinatorial and geometric computing

LEDA: a platform for combinatorial and geometric computing
New methods to color the vertices of a graph

Communications of the ACM

Towards the control of emergence by the coordination of decentralized agent activity for the resource sharing problem

ESOA'06 Proceedings of the 4th international conference on Engineering self-organising systems
Heuristic colour assignment strategies for merge models in graph colouring

EvoCOP'05 Proceedings of the 5th European conference on Evolutionary Computation in Combinatorial Optimization
Note: Quantum annealing of the graph coloring problem

Discrete Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a new heuristic algorithm for the graph coloring problem based on a combination of genetic algorithms and simulated annealing. Our algorithm exploits a novel crossover operator for graph coloring. Moreover, we investigate various ways in which simulated annealing can be used to enhance the performance of an evolutionary algorithm. Experiments performed on various collections of instances have justified the potential of this approach. We also discuss some possible enhancements and directions for further research.