Nonstationary function optimization using genetic algorithm with dominance and diploidy
Proceedings of the Second International Conference on Genetic Algorithms on Genetic algorithms and their application
Parallel and distributed computation: numerical methods
Parallel and distributed computation: numerical methods
Coevolutionary search among adversaries
Coevolutionary search among adversaries
A New Diploid Scheme and Dominance Change Mechanism for Non-Stationary Function Optimization
Proceedings of the 6th International Conference on Genetic Algorithms
A Comparison of Dominance Mechanisms and Simple Mutation on Non-stationary Problems
PPSN V Proceedings of the 5th International Conference on Parallel Problem Solving from Nature
A Monotonic Archive for Pareto-Coevolution
Evolutionary Computation
Hi-index | 0.00 |
In order to study genetic algorithms in co-evolutionary environments, we construct a Markov model of co-evolution of populations with fixed, finite population sizes. In this combined Markov model, the behavior toward the limit can be utilized to study the relative performance of the algorithms. As an application of the model, we perform an analysis of the relative performance of haploid versus diploid genetic algorithms in the co-evolutionary setup, under several parameter settings. Because of the use of Markov chains, this paper provides exact stochastic results on the expected performance of haploid and diploid algorithms in the proposed co-evolutionary model.