Journal Article10.3233/IDA-2008-12102
A comprehensive analysis of hyper-heuristics
Ender Özcan,Burak Bilgin,Emin Erkan Korkmaz +2 more
- 01 Jan 2008
- Vol. 12, Iss: 1, pp 3-23
TL;DR: In this study, a comprehensive analysis is carried out on hyper-heuristics and the best method is tested against genetic and memetic algorithms on fourteen benchmark functions.
read more
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.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
The Interleaved Constructive Memetic Algorithm and its application to timetabling
TL;DR: A new hybrid method, ''Interleaved Constructive Memetic Algorithm'' (ICMA) that interleaves memetic algorithms with constructive methods for timetabling problems, which is of particular interest because it has a highly hierarchical structure arising from various organisational requirements.
25
HySST: Hyper-heuristic Search Strategies and Timetabling
Ahmed Kheiri,Ender Özcan,Andrew J. Parkes +2 more
- 29 Aug 2012
TL;DR: 9th International Conference on the Practice and Theory of Automated Timetabling, Son, Norway, 28-31 August 2012.
A cultural algorithm for the urban public transportation
Laura Cruz Reyes,Carlos Alberto Ochoa Ortíz Zezzatti,Claudia Gómez Santillán,Paula Hernández Hernández,Mercedes Villa Fuerte +4 more
- 23 Jun 2010
TL;DR: The results of the experiment show that the technique of the cultural algorithms is applicable to these kinds of multi-objective problems.
24
Investment Opportunities Forecasting: Extending the Grammar of a GP-based Tool
Michael Kampouridis,Edward Tsang +1 more
TL;DR: A new version of a GP financial forecasting tool, called EDDIE 8, that allows the GP to search in the space of indicators, instead of using pre-specified ones, and finds that new and improved solutions can be found.
Generalizing hyper-heuristics via apprenticeship learning
Shahriar Asta,Ender Özcan,Andrew J. Parkes,A. Şima Etaner-Uyar +3 more
- 03 Apr 2013
TL;DR: An apprenticeship-learning-based technique is used as a hyper-heuristic to generate heuristics for an online combinatorial problem, which shows that the generated policy often performs better than the standard best-fit heuristic even when applied to instances much larger than the training set.
References
Genetic algorithms in search, optimization and machine learning
David E. Goldberg
- 01 Jan 1989
TL;DR: This book brings together the computer techniques, mathematical tools, and research results that will enable both students and practitioners to apply genetic algorithms to problems in many fields.
58.6K
•Book
Genetic algorithms in search, optimization, and machine learning
David E. Goldberg
- 01 Sep 1988
TL;DR: In this article, the authors present the computer techniques, mathematical tools, and research results that will enable both students and practitioners to apply genetic algorithms to problems in many fields, including computer programming and mathematics.
•Book
Adaptation in natural and artificial systems
John H. Holland
- 01 Jan 1975
TL;DR: Names of founding work in the area of Adaptation and modiication, which aims to mimic biological optimization, and some (Non-GA) branches of AI.
•Book
Genetic Algorithms
David E. Goldberg,William Shakespeare +1 more
- 01 Jan 2002
TL;DR: The present work expresses the problem as a multi-objective optimization problem and a methodology has been proposed based on multi-objective genetic algo-rithm (MOGA) that exploits the effectiveness of MOGA for searching global optimal solutions in selecting an appropriate image enhancement operator.
17.1K
No free lunch theorems for optimization
TL;DR: A framework is developed to explore the connection between effective optimization algorithms and the problems they are solving and a number of "no free lunch" (NFL) theorems are presented which establish that for any algorithm, any elevated performance over one class of problems is offset by performance over another class.