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 条
  • [21] DATA STRUCTURES AND TIME COMPLEXITY OF ALGORITHMS
    Seda, Milos
    APLIMAT 2005 - 4TH INTERNATIONAL CONFERENCE, PT II, 2005, : 245 - 250
  • [22] A New Approach for Analyzing Average Time Complexity of Population-Based Evolutionary Algorithms on Unimodal Problems
    Chen, Tianshi
    He, Jun
    Sun, Guangzhong
    Chen, Guoliang
    Yao, Xin
    IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS, 2009, 39 (05): : 1092 - 1106
  • [23] Drift Analysis in Studying the Convergence and Hitting Times of Evolutionary Algorithms: An Overview
    He Jun
    2.School of Computer Science
    WuhanUniversityJournalofNaturalSciences, 2003, (S1) : 143 - 154
  • [24] Using Evolutionary Algorithms to Target Complexity Levels in Game Economies
    Rogers, Katja
    Le Claire, Vincent
    Frommel, Julian
    Mandryk, Regan
    Nacke, Lennart E.
    IEEE TRANSACTIONS ON GAMES, 2023, 15 (01) : 56 - 66
  • [25] Complexity transitions in evolutionary algorithms: Evaluating the impact of the initial population
    Defaweux, A
    Lenaerts, T
    van Hemert, J
    Parent, J
    2005 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-3, PROCEEDINGS, 2005, : 2174 - 2181
  • [26] LOWER BOUNDS OF TIME COMPLEXITY OF SOME ALGORITHMS
    HONG, J
    SCIENTIA SINICA, 1979, 22 (08): : 890 - 900
  • [27] Linear Bandit Algorithms with Sublinear Time Complexity
    Yang, Shuo
    Ren, Tongzheng
    Shakkottai, Sanjay
    Price, Eric
    Dhillon, Inderjit S.
    Sanghavi, Sujay
    INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 162, 2022,
  • [28] Average time complexity of estimation of distribution algorithms
    González, C
    Ramífrez, A
    Lozano, JA
    Larrañaga, P
    COMPUTATIONAL INTELLIGENCE AND BIOINSPIRED SYSTEMS, PROCEEDINGS, 2005, 3512 : 42 - 49
  • [29] ON LOWER BOUNDS OF TIME COMPLEXITY OF SOME ALGORITHMS
    洪加威
    Science China Mathematics, 1979, (08) : 890 - 900
  • [30] Forecasting time series by means of evolutionary algorithms
    del Arco-Calderón, CL
    Viñuela, PI
    Castro, JCH
    PARALLEL PROBLEM SOLVING FROM NATURE - PPSN VIII, 2004, 3242 : 1061 - 1070
12345