An equivalent genetic algorithm based on extended strings and its convergence analysis

Information Sciences

Volumn 138, Issue 1-4, 2001, Pages 119-135

  Liang, Yanchun ^a,b   Zhou, Chunguang ^a   Wang, Zaishen ^a   Pueh Lee, Heow ^b   Piang Lim, Siak ^b  

^a JILIN UNIVERSITY   (China)

^b NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

Convergence analysis; Extended string based genetic algorithm (ESGA); Global optimal solution; Rate of convergence

Indexed keywords

CONVERGENCE OF NUMERICAL METHODS; PROBLEM SOLVING;

EXTENDED-STRING-BASED GENETIC ALGORITHMS (ESGA);

GENETIC ALGORITHMS;

EID: 0035480398     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0255(01)00122-0     Document Type: Article

References (11)

1. Global convergence of genetic algorithms: A Markov chain analysis
2. Evolving artificial intelligence
3. Theoretical analysis of evolutionary algorithms with an infinite population size in continuous space Part I: Basic properties of selection and mutation
4. Theoretical analysis of evolutionary algorithms with an infinite population size in continuous space Part II: Analysis of the diversification role of crossover
5. A study of convergence of genetic algorithms with selection and mutation alone
6. Convergence analysis of canonical genetic algorithms
7. Genetic algorithm with elitist model and its convergence
8. On an exact population model of genetic algorithms