A Study of Adaptive Perturbation Strategy for Iterated Local Search

Abstract

We investigate the contribution of a recently proposed adaptive diversification strategy (ADS) to the performance of an iterated local search (ILS) algorithm. ADS is used as a diversification mechanism by breakout local search (BLS), which is a new variant of the ILS metaheuristic. The proposed perturbation strategy adaptively selects between two types of perturbations (directed or random moves) of different intensities, depending on the current state of search. We experimentally evaluate the performance of ADS on the quadratic assignment problem (QAP) and the maximum clique problem (MAX-CLQ). Computational results accentuate the benefit of combining adaptively multiple perturbation types of different intensities. Moreover, we provide some guidance on when to introduce a weaker and when to introduce a stronger diversification into the search.

DOI: 10.1007/978-3-642-37198-1_6

Extracted Key Phrases

3 Figures and Tables

Cite this paper

@inproceedings{Benlic2013ASO, title={A Study of Adaptive Perturbation Strategy for Iterated Local Search}, author={Una Benlic and Jin-Kao Hao}, booktitle={EvoCOP}, year={2013} }