An adaptive pursuit strategy for allocating operator probabilities
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Adaptive operator selection with dynamic multi-armed bandits
Proceedings of the 10th annual conference on Genetic and evolutionary computation
Memetic algorithm with strategic controller for the maximum clique problem
Proceedings of the 2011 ACM Symposium on Applied Computing
Adaptive iterated local search for cross-domain optimisation
Proceedings of the 13th annual conference on Genetic and evolutionary computation
| Hi-index | 0.00 |
Iterated local search is a simple yet powerful metaheuristic. It is only drawback is that it is quite sensitive to its only parameter: the perturbation step size. Adaptive operator selection methods are on-line adaptive algorithms that adjust the probability of applying the search operators to the current solutions. In this short note, we show the use of the adaptive pursuit algorithm to automatically select the perturbation step size for ILS when optimizing a blind, single-constraint knapsack problem. The resulting adaptive ILS achieves almost the same performance as the ILS with the best perturbation step size but without the need to determine the optimal parameter setting.