Randomized algorithms
ALIFE Proceedings of the sixth international conference on Artificial life
On the analysis of the (1+ 1) evolutionary algorithm
Theoretical Computer Science
Tracking the Red Queen: Measurements of Adaptive Progress in Co-Evolutionary Simulations
Proceedings of the Third European Conference on Advances in Artificial Life
The Coevolution of Antibodies for Concept Learning
PPSN V Proceedings of the 5th International Conference on Parallel Problem Solving from Nature
On the Optimization of Unimodal Functions with the (1 + 1) Evolutionary Algorithm
PPSN V Proceedings of the 5th International Conference on Parallel Problem Solving from Nature
Parameter Control within a Co-operative Co-evolutionary Genetic Algorithm
PPSN VII Proceedings of the 7th International Conference on Parallel Problem Solving from Nature
The Effects of Representational Bias on Collaboration Methods in Cooperative Coevolution
PPSN VII Proceedings of the 7th International Conference on Parallel Problem Solving from Nature
PPSN III Proceedings of the International Conference on Evolutionary Computation. The Third Conference on Parallel Problem Solving from Nature: Parallel Problem Solving from Nature
A Cooperative Coevolutionary Approach to Function Optimization
PPSN III Proceedings of the International Conference on Evolutionary Computation. The Third Conference on Parallel Problem Solving from Nature: Parallel Problem Solving from Nature
Cooperative Coevolution: An Architecture for Evolving Coadapted Subcomponents
Evolutionary Computation
Forming neural networks through efficient and adaptive coevolution
Evolutionary Computation
Rigorous hitting times for binary mutations
Evolutionary Computation
Heterogeneity in the coevolved behaviors of mobile robots: the emergence of specialists
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 2
Exploring the explorative advantage of the cooperative coevolutionary (1+1) EA
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartI
Runtime Analysis of the (μ+1) EA on Simple Pseudo-Boolean Functions
Evolutionary Computation
Archive-based cooperative coevolutionary algorithms
Proceedings of the 8th annual conference on Genetic and evolutionary computation
A Monotonic Archive for Pareto-Coevolution
Evolutionary Computation
Computational complexity and evolutionary computation
Proceedings of the 10th annual conference companion on Genetic and evolutionary computation
Theoretical Advantages of Lenient Learners: An Evolutionary Game Theoretic Perspective
The Journal of Machine Learning Research
Accelerated Neural Evolution through Cooperatively Coevolved Synapses
The Journal of Machine Learning Research
Population size versus runtime of a simple evolutionary algorithm
Theoretical Computer Science
On the performance effects of unbiased module encapsulation
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Computational complexity and evolutionary computation
Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers
A First Study on the Use of Coevolutionary Algorithms for Instance and Feature Selection
HAIS '09 Proceedings of the 4th International Conference on Hybrid Artificial Intelligence Systems
ICARIS '09 Proceedings of the 8th International Conference on Artificial Immune Systems
Computational complexity and evolutionary computation
Proceedings of the 12th annual conference companion on Genetic and evolutionary computation
Analyzing different variants of immune inspired somatic contiguous hypermutations
Theoretical Computer Science
IFS-CoCo in the landscape contest: description and results
ICPR'10 Proceedings of the 20th International conference on Recognizing patterns in signals, speech, images, and videos
Theoretical convergence guarantees for cooperative coevolutionary algorithms
Evolutionary Computation
Computers and Industrial Engineering
When do evolutionary algorithms optimize separable functions in parallel?
Proceedings of the twelfth workshop on Foundations of genetic algorithms XII
Proceedings of the 15th annual conference on Genetic and evolutionary computation
| Hi-index | 0.00 |
Coevolutionary algorithms are variants of traditional evolutionary algorithms and are often considered more suitable for certain kinds of complex tasks than non-coevolutionary methods. One example is a general cooperative coevolutionary framework for function optimization. This paper presents a thorough and rigorous introductory analysis of the optimization potential of cooperative coevolution. Using the cooperative coevolutionary framework as a starting point, the CC (1+1) EA is defined and investigated from the perspective of the expected optimization time. The research concentrates on separability, a key property of objective functions. We show that separability alone is not sufficient to yield any advantage of the CC (1+1) EA over its traditional, non-coevolutionary counterpart. Such an advantage is demonstrated to have its basis in the increased explorative possibilities of the cooperative coevolutionary algorithm. For inseparable functions, the cooperative coevolutionary set-up can be harmful. We prove that for some objective functions the CC (1+1) EA fails to locate a global optimum with overwhelming probability, even in infinite time; however, inseparability alone is not sufficient for an objective function to cause difficulties. It is demonstrated that the CC (1+1) EA may perform equal to its traditional counterpart, and may even outperform it on certain inseparable functions.