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 条
  • [1] Mixed Mutation Strategy Evolutionary Programming Based on Shapley Value
    Pang, Jinwei
    Dong, Hongbin
    He, Jun
    Feng, Qi
    2016 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2016, : 2805 - 2812
  • [2] Evolutionary programming using a mixed mutation strategy
    Dong, Hongbin
    He, Jun
    Huang, Houkuan
    Hou, Wei
    INFORMATION SCIENCES, 2007, 177 (01) : 312 - 327
  • [3] A Mixed Mutation Approach for Evolutionary Programming Based on Guided Selection Strategy
    Anik, Md. Tanvir Alam
    Ahmed, Saif
    2013 INTERNATIONAL CONFERENCE ON INFORMATICS, ELECTRONICS & VISION (ICIEV), 2013,
  • [4] Evolutionary programming with a simulated-conformist mutation strategy
    Huang, Han
    Ye, Shujin
    Fan, Zhun
    Lin, Zhiyong
    Lv, Liang
    Hao, Zhifeng
    SOFT COMPUTING, 2018, 22 (02) : 659 - 676
  • [5] Evolutionary programming with a simulated-conformist mutation strategy
    Han Huang
    Shujin Ye
    Zhun Fan
    Zhiyong Lin
    Liang Lv
    Zhifeng Hao
    Soft Computing, 2018, 22 : 659 - 676
  • [6] The Two Step Mutation Evolutionary Programming using in Image Segmentation
    Fang, Liu
    MATERIALS SCIENCE AND INFORMATION TECHNOLOGY, PTS 1-8, 2012, 433-440 : 5459 - 5462
  • [7] Self-Adaptive Mutation Strategy for Evolutionary Programming Based on Fitness Tracking Scheme
    Anik, Md. Tanvir Alam
    Ahmed, Saif
    Islam, K. M. Rakibul
    2013 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2013, : 2221 - 2228
  • [8] Adaptive evolutionary programming with p-best mutation strategy
    Das, Swagatam
    Mallipeddi, Rammohan
    Maity, Dipankar
    SWARM AND EVOLUTIONARY COMPUTATION, 2013, 9 : 58 - 68
  • [9] A Dual Mutation Strategy Embedded Evolutionary Programming for Continuous Optimization
    Anik, Md Tanvir Alam
    Ahmed, Sabbir
    Noman, Abu Saleh Md
    Islam, K. M. Rakibul
    2013 WORLD CONGRESS ON NATURE AND BIOLOGICALLY INSPIRED COMPUTING (NABIC), 2013, : 84 - 91
  • [10] How to control search step size in fast evolutionary programming
    Yong, L
    Xin, X
    CEC'02: PROCEEDINGS OF THE 2002 CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1 AND 2, 2002, : 652 - 656