A comprehensive analysis of hyper-heuristics

Article type: Research Article

Authors: Özcan, Ender | Bilgin, Burak | Korkmaz, Emin Erkan

Affiliations: Yeditepe University, Department of Computer Engineering, İnönü Cad. Kayışdaǧı Mah., 34755 Kadıköy/İstanbul, Turkey. E-mail: eozcan@cse.yeditepe.edu.tr, bbilgin@cse.yeditepe.edu.tr, ekorkmaz@cse.yeditepe.edu.tr

Abstract: Meta-heuristics such as simulated annealing, genetic algorithms and tabu search have been successfully applied to many difficult optimization problems for which no satisfactory problem specific solution exists. However, expertise is required to adopt a meta-heuristic for solving a problem in a certain domain. Hyper-heuristics introduce a novel approach for search and optimization. A hyper-heuristic method operates on top of a set of heuristics. The most appropriate heuristic is determined and applied automatically by the technique at each step to solve a given problem. Hyper-heuristics are therefore assumed to be problem independent and can be easily utilized by non-experts as well. In this study, a comprehensive analysis is carried out on hyper-heuristics. The best method is tested against genetic and memetic algorithms on fourteen benchmark functions. Additionally, new hyper-heuristic frameworks are evaluated for questioning the notion of problem independence.

Keywords: Hyper-heuristic, meta-heuristic, heuristic, adaptive method, optimization, local search

DOI: 10.3233/IDA-2008-12102

Journal: Intelligent Data Analysis, vol. 12, no. 1, pp. 3-23, 2008