Intensification/Diversification-Driven ILS for a graph coloring problem

Authors:
Samir Loudni
Affiliations:
Université de Caen Basse-Normandie, UMR 6072 GREYC, Caen, France
Venue:
EvoCOP'12 Proceedings of the 12th European conference on Evolutionary Computation in Combinatorial Optimization
Year:
2012

Citing 8
Cited 0

Using tabu search techniques for graph coloring

Computing
Tabu Search

Tabu Search
A graph coloring model for a feasibility problem in monthly crew scheduling with preferential bidding

Computers and Operations Research
A graph coloring heuristic using partial solutions and a reactive tabu scheme

Computers and Operations Research
Variable space search for graph coloring

Discrete Applied Mathematics
A Metaheuristic Approach for the Vertex Coloring Problem

INFORMS Journal on Computing
Advanced generic neighborhood heuristics for VNS

Engineering Applications of Artificial Intelligence
Search intensity versus search diversity: a false trade off?

Applied Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents an extension of the ILS algorithm, called ID-ILS, by introducing new local search devices that enforce an efficient tradeoff of intensification and diversification. Experiments performed on the DIMACS benchmarks show that our method is competitive with the best coloring algorithms.