The second largest eigenvalue upper bound for the canonical genetic algorithms

Authors:
Parag C. Pendharkar
Affiliations:
Information Systems, School of Business Administration, Pennsylvania State University at Harrisburg, 777 West Harrisburg Pike, Middletown, PA 17057, USA. Tel.: +1 717 948 6028/ Fax: +1 717 948 645 ...
Venue:
International Journal of Knowledge-based and Intelligent Engineering Systems
Year:
2007

Citing 2
Cited 0

Convergence rates for Markov chains

SIAM Review
Degree of population diversity - a perspective on premature convergence in genetic algorithms and its Markov chain analysis

IEEE Transactions on Neural Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

We provide an analysis of a Markov chain model that explains the convergence properties of canonical genetic algorithms with proportional selection, single point crossover and bit mutation with a mutation rate between 0 and 1. Specifically, we provide a second largest eigenvalue upper bound for canonical genetic algorithms (CGA). We show that, when mutation rate for CGA is 0.5, the second largest eigenvalue for the CGA is zero and the CGA converges to a stationary distribution in the first step after the initial random population initialization.