Open Access
An Analysis of Local Selection Algorithms in a Spatially Structured Evolutionary Algorithm.
Jayshree Sarma,Kenneth de Jong +1 more
- 01 Jan 1997
pp 181-187
78
TL;DR: Analysis tools and results are presented which provide considerable insight into the properties of various decentralized selection methods, including the selection pressures they induce, which permits a more informed choice of selection methods when designing and implementing spatially structured EAs.
read more
Abstract: A critical part of the design of eeective EAs is to obtain a proper balance between exploration and exploitation. A key element of this balance is the selection algorithm used. Although we have for some time now understood the relative diierences between various selection methods for standard centralized EAs, our understanding of decentralized EAs has been less complete. In this paper we present analysis tools and results which provide considerable insight into the properties of various decentralized selection methods, including the selection pressures they induce. Understanding this permits a more informed choice of selection methods when designing and implementing spatially structured EAs.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Multiple control levels in structured genetic alogorithms
Angelos Molfetas
- 01 Jan 2006
TL;DR: In this paper, the authors investigated the effect of the incorporation of control levels (tiers of genes which determine the activation of lower genes) on GAs which are used to generate feedforward Artificial Neural Networks (ANNs).
Resolución de problemas combinatorios con aplicación real en sistemas distribuidos
Gabriel Jesús Luque Polo
- 01 Jan 2006
TL;DR: In this paper, the authors present a tesis for the desarrollo of tecnicas metaheuristicas paralelas eficientes for the resolucion of problemas con aplicacion real.
On Takeover Times in Spatially Structured Populations : Array and Ring
Günter Rudolph
- 16 Oct 2001
TL;DR: The takeover time is defined as the expected number of iterations of some selection method until a population consists entirely of copies of the best individual under the assumption that only one best individual is contained in the initial population.
References
A Comparative Analysis of Selection Schemes Used in Genetic Algorithms
David E. Goldberg,Kalyanmoy Deb +1 more
- 01 Jan 1991
TL;DR: A number of selection schemes commonly used in modern genetic algorithms are compared on the basis of solutions to deterministic difference or differential equations, verified through computer simulations to provide convenient approximate or exact solutions and useful convergence time and growth ratio estimates.
Biologically influenced algorithms and parallelism in non-linear optimization
John Michael Neal McInerney
- 01 Jan 1992
TL;DR: Issues from population genetics, including Sewall Wright's shifting balance theory of evolution as implemented with a diffusion model, are explored as the mechanism for the power inherent in this model.
15
•Proceedings Article
ASPARAGOS An Asynchronous Parallel Genetic Optimization Strategy
Martina Gorges-Schleuter
- 01 Jun 1989
Related Papers (5)
David E. Goldberg,Kalyanmoy Deb +1 more
- 01 Jan 1991
Bernard Manderick,Piet Spiessens +1 more
- 01 Jun 1989
Enrique Alba,José M. Troya +1 more
- 18 Sep 2000