P-Complete Approximation Problems
Journal of the ACM (JACM)
A Racing Algorithm for Configuring Metaheuristics
GECCO '02 Proceedings of the Genetic and Evolutionary Computation Conference
Stochastic Local Search: Foundations & Applications
Stochastic Local Search: Foundations & Applications
Computers and Operations Research
An Evolutionary ILS-Perturbation Technique
HM '08 Proceedings of the 5th International Workshop on Hybrid Metaheuristics
Paper: Robust taboo search for the quadratic assignment problem
Parallel Computing
Iterated robust tabu search for MAX-SAT
AI'03 Proceedings of the 16th Canadian society for computational studies of intelligence conference on Advances in artificial intelligence
Pareto autonomous local search
LION'05 Proceedings of the 5th international conference on Learning and Intelligent Optimization
A non-adaptive stochastic local search algorithm for the CHeSC 2011 competition
LION'12 Proceedings of the 6th international conference on Learning and Intelligent Optimization
Path Relinking with Multi-Start Tabu Search for the Quadratic Assignment Problem
International Journal of Swarm Intelligence Research
| Hi-index | 0.00 |
Iterated local search is a stochastic local search (SLS) method that combines a perturbation step with an embedded local search algorithm. In this article, we propose a new way of hybridizing iterated local search. It consists in using an iterated local search as the embedded local search algorithm inside another iterated local search. This nesting of local searches and iterated local searches can be further iterated, leading to a hierarchy of iterated local searches. In this paper, we experimentally examine this idea applying it to the quadratic assignment problem. Experimental results on large, structured instances show that the hierarchical iterated local search can offer advantages over using a "flat" iterated local search and make it a promising technique to be further considered for other applications.