Hill climbers and mutational heuristics in hyperheuristics

49Citations
Citations of this article
35Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Hyperheuristics are single candidate solution based and simple to maintain mechanisms used in optimization. At each iteration, as a higher level of abstraction, a hyperheuristic chooses and applies one of the heuristics to a candidate solution. In this study, the performance contribution of hill climbing operators along with the mutational heuristics are analyzed in depth in four different hyperheuristic frameworks. Four different hill climbing operators and three mutational operators are used during the experiments. Various subsets of the heuristics are evaluated on fourteen well-known benchmark functions. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Özean, E., Bilgin, B., & Korkmaz, E. E. (2006). Hill climbers and mutational heuristics in hyperheuristics. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4193 LNCS, pp. 202–211). Springer Verlag. https://doi.org/10.1007/11844297_21

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free