Mutation Strategy Based on Step Size and Survival Rate for Evolutionary Programming

被引:2
|
作者
Hong, Libin [1 ]
Liu, Chenjian [1 ]
Cui, Jiadong [2 ]
Liu, Fuchang [1 ]
机构
[1] Hangzhou Normal Univ, Sch Informat Sci & Technol, Hangzhou 311121, Peoples R China
[2] Hangzhou Dianzi Univ, Coll Elect & Informat, Hangzhou 310018, Peoples R China
关键词
D O I
10.1155/2021/1336929
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
Evolutionary programming (EP) uses a mutation as a unique operator. Gaussian, Cauchy, Levy, and double exponential probability distributions and single-point mutation were nominated as mutation operators. Many mutation strategies have been proposed over the last two decades. The most recent EP variant was proposed using a step-size-based self-adaptive mutation operator. In SSEP, the mutation type with its parameters is selected based on the step size, which differs from generation to generation. Several principles for choosing proper parameters have been proposed; however, SSEP still has limitations and does not display outstanding performance on some benchmark functions. In this work, we proposed a novel mutation strategy based on both the "step size" and "survival rate" for EP (SSMSEP). SSMSEP-1 and SSMSEP-2 are two variants of SSMSEP, which use "survival rate" or "step size" separately. Our proposed method can select appropriate mutation operators and update parameters for mutation operators according to diverse landscapes during the evolutionary process. Compared with SSMSEP-1, SSMSEP-2, SSEP, and other EP variants, the SSMSEP demonstrates its robustness and stable performance on most benchmark functions tested.
引用
收藏
页数:13
相关论文
共 50 条
  • [21] Evolutionary programming using exponential mutation
    Kohmoto, K
    Narihisa, H
    Katayama, K
    6TH WORLD MULTICONFERENCE ON SYSTEMICS, CYBERNETICS AND INFORMATICS, VOL XI, PROCEEDINGS: COMPUTER SCIENCE II, 2002, : 405 - 410
  • [22] A Mixed Strategy for Evolutionary Programming Based on Local Fitness Landscape
    Shen, Liang
    He, Jun
    2010 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2010,
  • [23] An approach to evolutionary robotics using a genetic algorithm with a variable mutation rate strategy
    Katada, Y
    Ohkura, K
    Ueda, K
    PARALLEL PROBLEM SOLVING FROM NATURE - PPSN VIII, 2004, 3242 : 952 - 961
  • [24] A new mutation operator based on the T probability distribution in evolutionary programming
    Gong, Wenyin
    Cai, Zhihua
    Lu, Xinwei
    Jiang, Siwei
    PROCEEDINGS OF THE FIFTH IEEE INTERNATIONAL CONFERENCE ON COGNITIVE INFORMATICS, VOLS 1 AND 2, 2006, : 675 - 679
  • [25] Evolutionary Programming Using Distribution-Based and Differential Mutation Operators
    Anik, Md. Tanvir Alam
    Ahmed, Saif
    UNCONVENTIONAL COMPUTATION AND NATURAL COMPUTATION, 2013, 7956 : 244 - 245
  • [26] Novel bi-subgroup evolutionary programming based on chaotic mutation
    Zhang, M
    Wang, XJ
    Ji, D
    DYNAMICS OF CONTINUOUS DISCRETE AND IMPULSIVE SYSTEMS-SERIES B-APPLICATIONS & ALGORITHMS, 2005, 1 : 125 - 129
  • [27] The evolutionary impact of population size, mutation rate and virulence on pathogen niche width
    Fisher, Adam M.
    JOURNAL OF EVOLUTIONARY BIOLOGY, 2021, 34 (08) : 1256 - 1265
  • [28] Heuristic Search Strategy of Evolutionary Programming
    Han, Zhi-Ming
    Liu, Xian-Ping
    Tang, Miao
    2010 2ND INTERNATIONAL ASIA CONFERENCE ON INFORMATICS IN CONTROL, AUTOMATION AND ROBOTICS (CAR 2010), VOL 1, 2010, : 241 - 243
  • [29] Dynamic scheduling strategy of job shop based on parallel evolutionary programming
    Weng, Miaofeng
    Xiaoxing Weixing Jisuanji Xitong/Mini-Micro Systems, 2000, 21 (06): : 620 - 622
  • [30] Evolutionary programming with only using exponential mutation
    Narihisa, H.
    Kohmoto, K.
    Taniguchi, T.
    Ohta, M.
    Katayama, K.
    2006 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-6, 2006, : 552 - +