Mean Convergence Time of Inhomogeneous Genetic Algorithm with Elitism

被引:1
|
作者
Rojas Cruz, Juan Alberto [1 ]
Diniz, Iesus C. [1 ]
机构
[1] Univ Fed Rio Grande do Norte, Dept Math, Natal, RN, Brazil
关键词
Convergence mean time; genetic algorithm; non-homogeneous Markov chain; simulated annealing; 60J05; 60J10; 65C40;
D O I
10.1080/01630563.2016.1182187
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
The theoretical study of a genetic algorithm (GA) has focused mainly on establishing its convergence in probability and almost always to the global optimum. In this article, we establishsufficient conditions for the finiteness of convergence mean time of the genetic algorithm with elitism. We obtain bounds for the probability of convergence to the global optimum in the first n iterations as a by-product.
引用
收藏
页码:966 / 974
页数:9
相关论文
共 50 条