The effect of multiple optima on the simple genetic algorithm run-time complexity

The effect of multiple optima on the simple genetic algorithm run-time complexity

0.00 Avg rating0 Votes
Article ID: iaor20084673
Country: Netherlands
Volume: 178
Issue: 1
Start Page Number: 27
End Page Number: 45
Publication Date: Apr 2007
Journal: European Journal of Operational Research
Authors: ,
Keywords: markov processes, computational analysis
Abstract:

Genetic algorithms are stochastic search algorithms that have been applied to optimization problems. In this paper we analyze the run-time complexity of a genetic algorithm when we are interested in one of a set of distinguished solutions. One such case occurs when multiple optima exist. We define the worst case scenario and derive a probabilistic worst case bound on the number of iterations required to find one of these multiple solutions of interest.

Reviews

Required fields are marked *. Your email address will not be published.