Since their inception in 1990, the FOGA (Foundations of Genetic Algorithms) workshops have been one of the principal reference sources for theoretical dev- opmentsinevolutionarycomputation(EC)and, inparticular, geneticalgorithms (GAs). The ninth such workshop, FOGA IX, was held at the Instituto de Ci- cias Nucleares of the Universidad Nacional Aut onoma de M exico, Mexico City during January 8 11, 2007. One of the main reasons the FOGA series of conferences has had a large impact in EC has been its distinct pro?le as the only conference dedicated to theoretical issues of a foundational nature both conceptual and technical. In this FOGA conference, and in keeping with this tradition, special attention was paid to the biological foundations of EC. The essential mathematical structure behind many evolutionary algorithms is the one familiar from population gen- ics, whose basic elements have been around now for at least 70 years. The last 20 years or so, however, have witnessed huge changes in our understanding of how genomes and other genetic structures work due to a plethora of new exp- imental techniques and results.q9th International Workshop, FOGA 2007, Mexico City, Mexico, January 8-11, 2007, Revised Selected Papers Christopher R. Stephens ... Table1gives our ( predicted) measure of difficulty (h(V)) for selected problems and the actual performance obtained by the GA (P). ... A landscape with 9 local maxima has the same expected difficulty as a landscape with 16 local maxima, while a landscape with 5 localanbsp;...
|Title||:||Foundations of Genetic Algorithms|
|Author||:||Christopher R. Stephens, Marc Toussaint, Darrell Whitley|
|Publisher||:||Springer Science & Business Media - 2007-06-29|