Sciweavers

1253 search results - page 35 / 251
» Convergence of Evolutionary Algorithms in General Search Spa...
Sort
View
GECCO
2005
Springer
131views Optimization» more  GECCO 2005»
15 years 11 months ago
EA models and population fixed-points versus mutation rates for functions of unitation
Using a dynamic systems model for the Simple Genetic Algorithm due to Vose[1], we analyze the fixed point behavior of the model without crossover applied to functions of unitation...
J. Neal Richter, John Paxton, Alden H. Wright
CEC
2005
IEEE
15 years 11 months ago
Dynamic niching in evolution strategies with covariance matrix adaptation
Abstract- Evolutionary Algorithms (EAs) have the tendency to converge quickly into a single solution in the search space. However, many complex search problems require the identiï¬...
Ofer M. Shir, Thomas Bäck
GECCO
2007
Springer
241views Optimization» more  GECCO 2007»
16 years 5 days ago
Binary ant algorithm
When facing dynamic optimization problems the goal is no longer to find the extrema, but to track their progression through the space as closely as possible. Over these kind of ov...
Carlos Fernandes, Agostinho C. Rosa, Vitorino Ramo...
GECCO
2010
Springer
187views Optimization» more  GECCO 2010»
15 years 10 months ago
The maximum hypervolume set yields near-optimal approximation
In order to allow a comparison of (otherwise incomparable) sets, many evolutionary multiobjective optimizers use indicator functions to guide the search and to evaluate the perfor...
Karl Bringmann, Tobias Friedrich
GECCO
2006
Springer
121views Optimization» more  GECCO 2006»
15 years 9 months ago
A splicing/decomposable encoding and its novel operators for genetic algorithms
In this paper, we introduce a new genetic representation -- a splicing/decomposable (S/D) binary encoding, which was proposed based on some theoretical guidance and existing recom...
Yong Liang, Kwong-Sak Leung, Kin-Hong Lee