Drift conditions for time complexity of evolutionary algorithms

被引：0
|
作者：
He, Jun [1 ]
Yao, Xin [1 ]
Kang, Li-Shan [1 ]
机构：
[1] Sch. of Comp. Sci., Univ. of Birmingham, Birmingham B15 2TT, United Kingdom
来源：
Ruan Jian Xue Bao/Journal of Software | 2001年 / 12卷 / 12期
关键词：
Combinatorial mathematics - Computational complexity - Markov processes - Optimization;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
The computational time complexity is an important topic in the theory of evolutionary algorithms. This paper introduces drift analysis into analysing the average time complexity of evolutionary algorithms, which are applicable to a wide range of evolutionary algorithms and many problems. Based on the drift analysis, some useful drift conditions to determine the time complexity of evolutionary algorithms are studied. These conditions are applied into the fully deceptive problem to verify their efficiency.
引用
收藏
页码：1775 / 1783
相关论文
共 50 条
  • [1] Drift analysis and average time complexity of evolutionary algorithms
    He, J
    Yao, X
    ARTIFICIAL INTELLIGENCE, 2001, 127 (01) : 57 - 85
  • [2] Drift analysis and average time complexity of evolutionary algorithms (vol 127, pg 57, 2001)
    He, J
    Yao, X
    ARTIFICIAL INTELLIGENCE, 2002, 140 (1-2) : 245 - 248
  • [3] Drift conditions for estimating the first hitting times of evolutionary algorithms
    Chen, Yu
    Zou, Xiufen
    He, Jun
    INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 2011, 88 (01) : 37 - 50
  • [4] Some techniques for analyzing time complexity of evolutionary algorithms
    Ding, Lixin
    Yu, Jinghu
    TRANSACTIONS OF THE INSTITUTE OF MEASUREMENT AND CONTROL, 2012, 34 (06) : 755 - 766
  • [5] A study of drift analysis for estimating computation time of evolutionary algorithms
    He J.
    Yao X.
    Natural Computing, 2004, 3 (1) : 21 - 35
  • [6] Time Complexity of Evolutionary Algorithms for Combinatorial Optimization:A Decade of Results
    Pietro S.Oliveto
    International Journal of Automation & Computing, 2007, (03) : 281 - 293
  • [7] Time Complexity of Evolutionary Algorithms for Combinatorial Optimization: A Decade of Results
    Oliveto, Pietro S.
    He, Jun
    Yao, Xin
    INTERNATIONAL JOURNAL OF AUTOMATION AND COMPUTING, 2007, 4 (03) : 281 - 293
  • [8] Drift Analysis and Evolutionary Algorithms Revisited
    Lengler, J.
    Steger, A.
    COMBINATORICS PROBABILITY & COMPUTING, 2018, 27 (04): : 643 - 666
  • [9] Approach of drift analysis in evolutionary algorithms
    Hao, P
    INTELLIGENT COMPUTING: THEORY AND APPLICATIONS III, 2005, 5803 : 167 - 173
  • [10] On Average Time Complexity of Evolutionary Negative Selection Algorithms for Anomaly Detection
    Xu, Baoliang
    Luo, Wenjian
    Pei, Xingxin
    Zhang, Min
    Wang, Xufa
    WORLD SUMMIT ON GENETIC AND EVOLUTIONARY COMPUTATION (GEC 09), 2009, : 631 - 638
12345