Iterated Local Search vs. Hyper-heuristics: Towards General-Purpose Search Algorithms

Citation

Burke E, Curtois T, Hyde M, Kendall G, Ochoa G, Petrovic S, Vazquez-Rodriguez JA & Gendreau M (2010) Iterated Local Search vs. Hyper-heuristics: Towards General-Purpose Search Algorithms. In: 2010 IEEE Congress on Evolutionary Computation. 2010 IEEE Congress on Evolutionary Computation, Barcelona, 18.07.2010-23.07.2010. Piscataway, NJ, USA: IEEE Press. https://doi.org/10.1109/CEC.2010.5586064

Abstract
An important challenge within hyper-heuristic research is to design search methodologies that work well, not only across different instances of the same problem, but also across different problem domains. This article conducts an empirical study involving three different domains in combinatorial optimisation: bin packing, permutation flow shop and personnel scheduling. Using a common software interface (HyFlex), the same algorithms (high-level strategies or hyper-heuristics) can be readily run on all of them. The study is intended as a proof of concept of the proposed interface and domain modules, as a benchmark for testing the generalisation abilities of heuristic search algorithms. Several algorithms and variants from the literature were implemented and tested. From them, the implementation of iterated local search produced the best overall performance. Interestingly, this is one of the most conceptually simple competing algorithms, its advantage as a robust algorithm is probably due to two factors: (i) the simple yet powerful exploration/exploitation balance achieved by systematically combining a perturbation followed by local search; and (ii) its parameter-less nature. We believe that the challenge is still open for the design of robust algorithms that can learn and adapt to the available low-level heuristics, and thus select and apply them accordingly.