MN Omidvar, X Li, Y Mei, X Yao - IEEE Transactions on …, 2013 - ieeexplore.ieee.org
Cooperative co-evolution has been introduced into evolutionary algorithms with the aim of solving increasingly complex optimization problems through a divide-and-conquer …
J Lehman, KO Stanley - Evolutionary computation, 2011 - ieeexplore.ieee.org
In evolutionary computation, the fitness function normally measures progress toward an objective in the search space, effectively acting as an objective function. Through deception …
This report proposes 15 large-scale benchmark problems as an extension to the existing CEC'2010 large-scale global optimization benchmark suite. The aim is to better represent a …
K Sastry, D Goldberg, G Kendall - Search methodologies: Introductory …, 2005 - Springer
Chapter 4 GENETIC ALGORITHMS Page 1 Chapter 4 GENETIC ALGORITHMS Kumara Sastry, David Goldberg University of Illinois, USA Graham Kendall University of Nottingham, UK 4.1 …
" It is well known that" building blocks", whether they be the atoms of chemistry, the words of a language, or the modules of a computer, play a key role in our understanding of the world …
The previous chapter has discussed how hierarchy can be used to reduce problem complexity in black-box optimization. Additionally, the chapter has identified the three …
This paper reviews and summarizes existing linkage learning techniques for genetic and evolutionary algorithms in the literature. It first introduces the definition of linkage in both …
J Lehman, KO Stanley - Genetic programming theory and practice IX, 2011 - Springer
By synthesizing a growing body ofwork in search processes that are not driven by explicit objectives, this paper advances the hypothesis that there is a fundamental problem with the …
Three major sources of complexity in many real-world problems are size, variable interaction, and interdependence of the subcomponents of a problem. With the rapid growth …