Sciweavers

238 search results - page 31 / 48
» Parallel Ant Colonies for Combinatorial Optimization Problem...
Sort
View
JGO
2010
121views more  JGO 2010»
13 years 6 months ago
The oracle penalty method
A new and universal penalty method is introduced in this contribution. It is especially intended to be applied in stochastic metaheuristics like genetic algorithms, particle swarm...
Martin Schlüter, Matthias Gerdts
HEURISTICS
2006
120views more  HEURISTICS 2006»
13 years 7 months ago
A study of ACO capabilities for solving the maximum clique problem
This paper investigates the capabilities of the Ant Colony Optimization (ACO) meta-heuristic for solving the maximum clique problem, the goal of which is to find a largest set of ...
Christine Solnon, Serge Fenet
GECCO
2005
Springer
124views Optimization» more  GECCO 2005»
14 years 1 months ago
Generalized benchmark generation for dynamic combinatorial problems
Several general purpose benchmark generators are now available in the literature. They are convenient tools in dynamic continuous optimization as they can produce test instances w...
Abdulnasser Younes, Paul H. Calamai, Otman A. Basi...
GECCO
2008
Springer
183views Optimization» more  GECCO 2008»
13 years 8 months ago
UMDAs for dynamic optimization problems
This paper investigates how the Univariate Marginal Distribution Algorithm (UMDA) behaves in non-stationary environments when engaging in sampling and selection strategies designe...
Carlos M. Fernandes, Cláudio F. Lima, Agost...
HIS
2008
13 years 9 months ago
Implicit User Modelling Using Hybrid Meta-Heuristics
The requirements imposed on information retrieval systems are increasing steadily. The vast number of documents in today's large databases and especially on World Wide Web ca...
Pavel Krömer, Václav Snásel, Ja...