IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v8y2020i9p1565-d412182.html
   My bibliography  Save this article

Success History-Based Adaptive Differential Evolution Using Turning-Based Mutation

Author

Listed:
  • Xingping Sun

    (School of Software, Yunnan University, Kunming 650000, China)

  • Linsheng Jiang

    (School of Software, Yunnan University, Kunming 650000, China)

  • Yong Shen

    (School of Software, Yunnan University, Kunming 650000, China)

  • Hongwei Kang

    (School of Software, Yunnan University, Kunming 650000, China)

  • Qingyi Chen

    (School of Software, Yunnan University, Kunming 650000, China)

Abstract

Single objective optimization algorithms are the foundation of establishing more complex methods, like constrained optimization, niching and multi-objective algorithms. Therefore, improvements to single objective optimization algorithms are important because they can impact other domains as well. This paper proposes a method using turning-based mutation that is aimed to solve the problem of premature convergence of algorithms based on SHADE (Success-History based Adaptive Differential Evolution) in high dimensional search space. The proposed method is tested on the Single Objective Bound Constrained Numerical Optimization (CEC2020) benchmark sets in 5, 10, 15, and 20 dimensions for all SHADE, L-SHADE, and jSO algorithms. The effectiveness of the method is verified by population diversity measure and population clustering analysis. In addition, the new versions (Tb-SHADE, TbL-SHADE and Tb-jSO) using the proposed turning-based mutation get apparently better optimization results than the original algorithms (SHADE, L-SHADE, and jSO) as well as the advanced DISH and the jDE100 algorithms in 10, 15, and 20 dimensional functions, but only have advantages compared with the advanced j2020 algorithm in 5 dimensional functions.

Suggested Citation

  • Xingping Sun & Linsheng Jiang & Yong Shen & Hongwei Kang & Qingyi Chen, 2020. "Success History-Based Adaptive Differential Evolution Using Turning-Based Mutation," Mathematics, MDPI, vol. 8(9), pages 1-26, September.
    • Handle: RePEc:gam:jmathe:v:8:y:2020:i:9:p:1565-:d:412182
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/8/9/1565/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/8/9/1565/
    Download Restriction: no
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:8:y:2020:i:9:p:1565-:d:412182. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.