2008•Intelligent Data AnalysisRequires access

A comprehensive analysis of hyper-heuristics

Ender Özcan, Burak Bi̇lgi̇n, Emin Erkan Korkmaz

Open publisher page 247 citations

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

About this research paper

What this paper is about

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

Why it matters

OpenAlex reports 247 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available 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

Key concepts: Heuristics, Computer science, Operating system

Related papers

Back to paper searchBrowse research topicsOriginal source
A comprehensive analysis of hyper-heuristics — Research Paper | ScholarLens