A Critical Element-Guided Perturbation Strategy for Iterated Local Search

Authors:
Zhipeng Lü;Jin-Kao Hao
Affiliations:
LERIA, Université d'Angers, Angers, France 49045;LERIA, Université d'Angers, Angers, France 49045
Venue:
EvoCOP '09 Proceedings of the 9th European Conference on Evolutionary Computation in Combinatorial Optimization
Year:
2009

Citing 6
Cited 1

Using tabu search techniques for graph coloring

Computing
New methods to color the vertices of a graph

Communications of the ACM
Tabu Search

Tabu Search
Stochastic Local Search: Foundations & Applications

Stochastic Local Search: Foundations & Applications
A graph coloring heuristic using partial solutions and a reactive tabu scheme

Computers and Operations Research
An adaptive memory algorithm for the k-coloring problem

Discrete Applied Mathematics

Neighborhood analysis: a case study on curriculum-based course timetabling

Journal of Heuristics

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we study the perturbation operator of Iterated Local Search. To guide more efficiently the search to move towards new promising regions of the search space, we introduce a Critical Element-Guided Perturbation strategy (CEGP). This perturbation approach consists of the identification of critical elements and then focusing on these critical elements within the perturbation operator. Computational experiments on two case studies--graph coloring and course timetabling--give evidence that this critical element-guided perturbation strategy helps reinforce the performance of Iterated Local Search.