Novel mutation strategy for enhancing SHADE and LSHADE algorithms for global numerical optimization

被引:192
作者
Mohamed, Ali W. [1 ]
Hadi, Anas A. [2 ]
Jambi, Kamal M. [2 ]
机构
[1] Cairo Univ, Operat Res Dept, Inst Stat Studies & Res, Giza 12613, Egypt
[2] King Abdulaziz Univ, Fac Comp & Informat Technol, POB 80200, Jeddah 21589, Saudi Arabia
关键词
Evolutionary computation; Global optimization; Differential evolution; Novel ordered mutation; DIFFERENTIAL EVOLUTION ALGORITHM; CONTROL PARAMETERS; ENSEMBLE; ADAPTATION;
D O I
10.1016/j.swevo.2018.10.006
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Proposing new mutation strategies to improve the optimization performance of differential evolution (DE) is an important research study. Therefore, the main contribution of this paper goes in three directions: The first direction is introducing a less greedy mutation strategy with enhanced exploration capability, named DE/current-to-ord_best/1 (ord stands for ordered) or ord_best for short. In the second direction, we introduce a more greedy mutation strategy with enhanced exploitation capability, named DE/current-to-ord_pbest/1 (ord_pbest for short). Both of the proposed mutation strategies are based on ordering three selected vectors from the current generation to perturb the target vector, where the directed differences are used to mimic the gradient decent behavior to direct the search toward better solutions. In ord_best the three vectors are selected randomly to enhance the exploration capability of the algorithm. On the other hand, ord_pbest is designed to enhance the exploitation capability where two vectors are selected randomly and the third is selected from the global p best vectors. Based on the proposed mutation strategies, ord_best and ord_pbest, two DE variants are introduced as EDE and EBDE, respectively. The third direction of our work is a hybridization framework. The proposed mutations can be combined with DE family algorithms to enhance their search capabilities on difficult and complicated optimization problems. Thus, the proposed mutations are incorporated into SHADE and LSHADE to enhance their performance. Finally, in order to verify and analyze the performance of the proposed mutation strategies, numerical experiments were conducted using CEC2013 and CEC2017 benchmarks. The performance was also evaluated using CEC2010 designed for Large-Scale Global Optimization. Experimental results indicate that in terms of robustness, stability, and quality of the solution obtained, both mutation strategies are highly competitive, especially as the dimension increases.
引用
收藏
页数:14
相关论文
共 64 条
  • [1] Algorithmic design issues in adaptive differential evolution schemes: Review and taxonomy
    Al-Dabbagh, Rawaa Dawoud
    Neri, Ferrante
    Idris, Norisma
    Baba, Mohd Sapiyan
    [J]. SWARM AND EVOLUTIONARY COMPUTATION, 2018, 43 : 284 - 311
  • [2] Population set-based global optimization algorithms:: some modifications and numerical studies
    Ali, MM
    Törn, A
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2004, 31 (10) : 1703 - 1725
  • [3] [Anonymous], 2010, IEEE C EV COMP CEC 2
  • [4] [Anonymous], 2010, Cooperative co-evolution with delta grouping for large scale non-separable function optimization, DOI DOI 10.1109/CEC.2010.5585979
  • [5] [Anonymous], 2013, 201212 ZHENGZH U CHI
  • [6] Awad NH, 2016, TECHNICAL REPORT
  • [7] Awad NH, 2017, IEEE C EVOL COMPUTAT, P372, DOI 10.1109/CEC.2017.7969336
  • [8] Brest J., 2010, IEEE C EV COMP, P1
  • [9] Self-adapting control parameters in differential evolution: A comparative study on numerical benchmark problems
    Brest, Janez
    Greiner, Saso
    Boskovic, Borko
    Mernik, Marjan
    Zumer, Vijern
    [J]. IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2006, 10 (06) : 646 - 657
  • [10] Caraffini F, 2013, 2013 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), P1678