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 条
  • [41] Algorithms and Complexity for Periodic Real-Time Scheduling
    Bonifaci, Vincenzo
    Chan, Ho-Leung
    Marchetti-Spaccamela, Alberto
    Megow, Nicole
    PROCEEDINGS OF THE TWENTY-FIRST ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2010, 135 : 1350 - +
  • [42] Real-time model checking: Algorithms and complexity
    Worrell, James
    TIME 2008: 15TH INTERNATIONAL SYMPOSIUM ON TEMPORAL REPRESENTATION AND REASONING, PROCEEDINGS, 2008, : 19 - 19
  • [43] Time complexity evaluation of cover song identification algorithms
    Ferreira, Martha Dais
    de Mello, Rodrigo Fernandes
    APPLIED ACOUSTICS, 2021, 175
  • [44] Lower Bounds for Non-Elitist Evolutionary Algorithms via Negative Multiplicative Drift
    Doerr, Benjamin
    EVOLUTIONARY COMPUTATION, 2021, 29 (02) : 305 - 329
  • [45] On the analysis of average time complexity of Estimation of Distribution Algorithms
    Chen, Tianshi
    Tang, Ke
    Chen, Guoliang
    Yao, Xin
    2007 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-10, PROCEEDINGS, 2007, : 453 - 460
  • [46] Sublinear Time Algorithms and Complexity of Approximate Maximum Matching
    Behnezhad, Soheil
    Roghani, Mohammad
    Rubinstein, Aviad
    PROCEEDINGS OF THE 55TH ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING, STOC 2023, 2023, : 267 - 280
  • [47] Trading Bit, Message, and Time Complexity of Distributed Algorithms
    Schneider, Johannes
    Wattenhofer, Roger
    DISTRIBUTED COMPUTING, 2011, 6950 : 51 - 65
  • [48] Minimum average case time complexity for sorting algorithms
    Anurag Dutta
    Manan Roy Choudhury
    Rakesh K. Sharma
    Iran Journal of Computer Science, 2023, 6 (4) : 445 - 451
  • [49] Multilevel (Hierarchical) Optimization: Complexity Issues, Optimality Conditions, Algorithms
    Chinchuluun, Altannar
    Pardalos, Panos M.
    Huang, Hong-Xuan
    ADVANCES IN APPLIED MATHEMATICS AND GLOBAL OPTIMIZATION, 2009, 17 : 197 - +
  • [50] Algorithms and time complexity of the request-service problem
    Chunmei Liu
    Legand Burge
    Ajoni Blake
    Journal of Combinatorial Optimization, 2010, 20 : 180 - 193
12345