Scatter Search for Graph Coloring

Authors:
Jean-Philippe Hamiez;Jin-Kao Hao
Affiliations:
-;-
Venue:
Selected Papers from the 5th European Conference on Artificial Evolution
Year:
2001

Citing 8
Cited 11

Using tabu search techniques for graph coloring

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

Operations Research
A still better performance guarantee for approximate graph coloring

Information Processing Letters
On the hardness of approximating minimization problems

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
New methods to color the vertices of a graph

Communications of the ACM
Tabu Search

Tabu Search
A New Genetic Local Search Algorithm for Graph Coloring

PPSN V Proceedings of the 5th International Conference on Parallel Problem Solving from Nature
A Template for Scatter Search and Path Relinking

AE '97 Selected Papers from the Third European Conference on Artificial Evolution

An analysis of solution properties of the graph coloring problem

Metaheuristics
A graph coloring heuristic using partial solutions and a reactive tabu scheme

Computers and Operations Research
Combinatorial optimization in system configuration design

Automation and Remote Control
Breaking instance-independent symmetries in exact graph coloring

Journal of Artificial Intelligence Research
An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring

Computers and Operations Research
How can bees colour graphs

International Journal of Bio-Inspired Computation
Coloring large graphs based on independent set extraction

Computers and Operations Research
A hybrid scatter search meta-heuristic for delay-constrained multicast routing problems

Applied Intelligence
A scatter search algorithm for the slab stack shuffling problem

ICSI'10 Proceedings of the First international conference on Advances in Swarm Intelligence - Volume Part I
Improving the extraction and expansion method for large graph coloring

Discrete Applied Mathematics
A memetic algorithm for the Minimum Sum Coloring Problem

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we present a first scatter search approach for the Graph Coloring Problem (GCP). The evolutionary strategy scatter search operates on a set of configurations by combining two or more elements. New configurations are improved before replacing others according to their quality (fitness), and sometimes, to their diversity. Scatter search has been applied recently to some combinatorial optimization problems with promising results. Nevertheless, it seems that no attempt of scatter search has been published for the GCP. This paper presents such an investigation and reports experimental results on some well-studied DIMACS graphs.