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 条
  • [31] About the Computation Time of Adaptive Evolutionary Algorithms
    Ding, Lixin
    Yu, Jinghu
    ADVANCES IN COMPUTATION AND INTELLIGENCE, PROCEEDINGS, 2008, 5370 : 669 - +
  • [32] An inference model for analyzing termination conditions of Evolutionary Algorithms
    Roche, David
    Gil, Debora
    Giraldo, Jesus
    ARTIFICIAL INTELLIGENCE RESEARCH AND DEVELOPMENT, 2011, 232 : 218 - 227
  • [33] EXPERIMENTAL DESIGN UNDER CONDITIONS OF TIME DRIFT
    LISENKOV, AN
    KRUG, GK
    KORSHUNO.MA
    BUKHAREV.VA
    INDUSTRIAL LABORATORY, 1967, 33 (05): : 706 - &
  • [34] Theoretical Perspective of Convergence Complexity of Evolutionary Algorithms Adopting Optimal Mixing
    Tung, Yu-Fan
    Yu, Tian-Li
    GECCO'15: PROCEEDINGS OF THE 2015 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, 2015, : 535 - 542
  • [35] Analysis of Evolutionary Algorithms: From Computational Complexity Analysis to Algorithm Engineering
    Jansen, Thomas
    Zarges, Christine
    FOGA 11: PROCEEDINGS OF THE 2011 ACM/SIGEVO FOUNDATIONS OF GENETIC ALGORITHMS XI, 2011, : 1 - 14
  • [36] Evaluating genetic drift in time-series evolutionary analysis
    Nene, Nuno R.
    Mustonen, Ville
    Illingworth, Christopher J. R.
    JOURNAL OF THEORETICAL BIOLOGY, 2018, 437 : 51 - 57
  • [37] Time complexity analysis of evolutionary algorithms for 2-hop (1,2)-minimum spanning tree problem
    Shi, Feng
    Neumann, Frank
    Wang, Jianxin
    THEORETICAL COMPUTER SCIENCE, 2021, 893 : 159 - 175
  • [38] Hybrid Dynamical Evolutionary Algorithm and Time Complexity Analysis
    Li, Huiying
    Zhang, Yilai
    Xu, Xing
    INFORMATION TECHNOLOGY APPLICATIONS IN INDUSTRY, PTS 1-4, 2013, 263-266 : 2344 - 2348
  • [39] Hidden Complexity of Yeast Adaptation under Simple Evolutionary Conditions
    Li, Yuping
    Venkataram, Sandeep
    Agarwala, Atish
    Dunn, Barbara
    Petrov, Dmitri A.
    Sherlock, Gavin
    Fisher, Daniel S.
    CURRENT BIOLOGY, 2018, 28 (04) : 515 - +
  • [40] Selection, drift, recombination, and mutation in multiobjective evolutionary algorithms on scalable MNK-Landscapes
    Aguirre, HE
    Tanaka, K
    EVOLUTIONARY MULTI-CRITERION OPTIMIZATION, 2005, 3410 : 355 - 369