Foundations of Genetic Algorithms

Readers will find here a fascinating text that is the thoroughly refereed post-proceedings of the 9th Workshop on the Foundations of Genetic Algorithms, FOGA 2007, held in Mexico City in January 2007. The 11 revised full papers presented were carefully reviewed and selected during two rounds of reviewing and improvement from 22 submissions. The papers address all current topics in the field of theoretical evolutionary computation and also depict the continuing growth in interactions with other fields such as mathematics, physics, and biology

Inhalt

Inbreeding Properties of Geometric Crossover and Non-geometric Recombinations.- Just What Are Building Blocks?.- Sufficient Conditions for Coarse-Graining Evolutionary Dynamics.- On the Brittleness of Evolutionary Algorithms.- Mutative Self-adaptation on the Sharp and Parabolic Ridge.- Genericity of the Fixed Point Set for the Infinite Population Genetic Algorithm.- Neighborhood Graphs and Symmetric Genetic Operators.- Decomposition of Fitness Functions in Random Heuristic Search.- On the Effects of Bit-Wise Neutrality on Fitness Distance Correlation, Phenotypic Mutation Rates and Problem Hardness.- Continuous Optimisation Theory Made Easy? Finite-Element Models of Evolutionary Strategies, Genetic Algorithms and Particle Swarm Optimizers.- Saddles and Barrier in Landscapes of Generalized Search Operators.