A Critical Element-Guided Perturbation Strategy for Iterated Local Search

TitreA Critical Element-Guided Perturbation Strategy for Iterated Local Search
Type de publicationCommunication
TypeCommunication avec actes dans un congrès
Année2009
LangueAnglais
Date du colloque2009
Titre du colloque9th European Conference, EvoCOP 2009
Titre des actes ou de la revueEvolutionary Computation in Combinatorial Optimization
Volume5482
Pagination1 - 12
AuteurLü, Zhipeng, Hao, Jin-Kao
PaysAllemagne
EditeurSpringer
VilleTübingen
ISBN978-3-642-01008-8 / 978-3-642-01009-5
Mots-clésalgorithm analysis and problem complexity, Computation by Abstract Devices, Computational Biology/Bioinformatics, course timetabling, critical element-guided perturbation, Discrete Mathematics in Computer Science, graph coloring, iterated local search, Numeric Computing, perturbation operator
Résumé en anglais

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.

Notes

Date du colloque : 04/2009

URL de la noticehttp://okina.univ-angers.fr/publications/ua4490
DOI10.1007/978-3-642-01009-5_1
Lien vers le document en ligne

http://link.springer.com/chapter/10.1007/978-3-642-01009-5_1