Sciweavers

6312 search results - page 8 / 1263
» A design framework for metaheuristics
Sort
View
ANOR
2004
155views more  ANOR 2004»
13 years 7 months ago
Model-Based Search for Combinatorial Optimization: A Critical Survey
In this paper we introduce model-based search as a unifying framework accommodating some recently proposed metaheuristics for combinatorial optimization such as ant colony optimiza...
Mark Zlochin, Mauro Birattari, Nicolas Meuleau, Ma...
IDA
2008
Springer
13 years 7 months ago
A comprehensive analysis of hyper-heuristics
Meta-heuristics such as simulated annealing, genetic algorithms and tabu search have been successfully applied to many difficult optimization problems for which no satisfactory pro...
Ender Özcan, Burak Bilgin, Emin Erkan Korkmaz
GECCO
2007
Springer
437views Optimization» more  GECCO 2007»
14 years 1 months ago
A gestalt genetic algorithm: less details for better search
The basic idea to defend in this paper is that an adequate perception of the search space, sacrificing most of the precision, can paradoxically accelerate the discovery of the mo...
Christophe Philemotte, Hugues Bersini
IMECS
2007
13 years 9 months ago
Metamodel-Assisted Global Search Using a Probing Technique
—This paper presents a new metamodel-assisted metaheuristic algorithm for optimisation problems involving computationally expensive simulations. The algorithm, called Global Prob...
Anna Persson, Henrik Grimm, Amos Ng
CPAIOR
2005
Springer
14 years 1 months ago
A Search-Infer-and-Relax Framework for Integrating Solution Methods
Abstract. We present an algorithmic framework for integrating solution methods that is based on search, inference, and relaxation and their interactions. We show that the following...
John N. Hooker