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
来源：
NUMERICAL FUNCTIONAL ANALYSIS AND OPTIMIZATION | 2016年 / 37卷 / 08期
关键词：
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 条
  • [21] CONVERGENCE OF AN ALGORITHM FOR MEAN-CURVATURE MOTION
    EVANS, LC
    INDIANA UNIVERSITY MATHEMATICS JOURNAL, 1993, 42 (02) : 533 - 557
  • [22] Mean square convergence analysis for kernel least mean square algorithm
    Chen, Badong
    Zhao, Songlin
    Zhu, Pingping
    Principe, Jose C.
    SIGNAL PROCESSING, 2012, 92 (11) : 2624 - 2632
  • [23] Solving unbounded Knapsack problem using an adaptive genetic algorithm with elitism strategy
    Chen, Rung-Ching
    Jian, Cheng-Huei
    Huang, Yung-Fa
    International Journal of Smart Home, 2008, 2 (02): : 139 - 150
  • [24] Solving unbounded knapsack problem using an adaptive genetic algorithm with elitism strategy
    Chen, Rung-Ching
    Jian, Cheng-Huei
    FRONTIERS OF HIGH PERFORMANCE COMPUTING AND NETWORKING - ISPA 2007 WORKSHOPS, 2007, 4743 : 193 - +
  • [25] TEMPLATE MATCHING IN DIGITAL IMAGES USING A COMPACT GENETIC ALGORITHM WITH ELITISM AND MUTATION
    Da Silva, Rafael R.
    Limay, Carlos R. Erig
    Lopesz, Heitor S.
    JOURNAL OF CIRCUITS SYSTEMS AND COMPUTERS, 2010, 19 (01) : 91 - 106
  • [26] MEAN-SQUARE RATES OF CONVERGENCE IN THE CONTINUOUS-TIME SIMULATED ANNEALING ALGORITHM ON RD
    GOLDSTEIN, L
    ADVANCES IN APPLIED MATHEMATICS, 1988, 9 (01) : 35 - 39
  • [27] Implicit elitism in genetic search
    Bhatia, A. K.
    Basu, S. K.
    NEURAL INFORMATION PROCESSING, PT 3, PROCEEDINGS, 2006, 4234 : 781 - 788
  • [28] The strategy of improving convergence of genetic algorithm
    Jing, J. (anyangjj@163.com), 2012, Universitas Ahmad Dahlan (10):
  • [29] Convergence of a genetic algorithm with finite population
    Bérard, J
    Bienvenüe, A
    MATHEMATICS AND COMPUTER SCIENCE: ALGORITHMS, TREES, COMBINATORICS AND PROBABILITIES, 2000, : 155 - 163
  • [30] The immune genetic algorithm and its convergence
    Wang, L
    Jiao, LC
    ICSP '98: 1998 FOURTH INTERNATIONAL CONFERENCE ON SIGNAL PROCESSING, PROCEEDINGS, VOLS I AND II, 1998, : 1347 - 1350
12345