IDEAS home Printed from https://ideas.repec.org/a/igg/jcini0/v13y2019i1p36-61.html
   My bibliography  Save this article

Performance Analyses of Differential Evolution Algorithm Based on Dynamic Fitness Landscape

Author

Listed:
  • Kangshun Li

    (South China Agricultural University, Guangzhou, China)

  • Zhuozhi Liang

    (South China Agricultural University, Guangzhou, China)

  • Shuling Yang

    (South China University of Technology, Guangzhou, China)

  • Zhangxing Chen

    (University of Calgary, Calgary, Canada)

  • Hui Wang

    (South China Agricultural University, Guangzhou, China)

  • Zhiyi Lin

    (Guangdong University of Technology, Guangzhou, China)

Abstract

Dynamic fitness landscape analyses contain different metrics to attempt to analyze optimization problems. In this article, some of dynamic fitness landscape metrics are selected to discuss differential evolution (DE) algorithm properties and performance. Based on traditional differential evolution algorithm, benchmark functions and dynamic fitness landscape measures such as fitness distance correlation for calculating the distance to the nearest global optimum, ruggedness based on entropy, dynamic severity for estimating dynamic properties, a fitness cloud for getting a visual rendering of evolvability and a gradient for analyzing micro changes of benchmark functions in differential evolution algorithm, the authors obtain useful results and try to apply effective data, figures and graphs to analyze the performance differential evolution algorithm and make conclusions. Those metrics have great value and more details as DE performance.

Suggested Citation

  • Kangshun Li & Zhuozhi Liang & Shuling Yang & Zhangxing Chen & Hui Wang & Zhiyi Lin, 2019. "Performance Analyses of Differential Evolution Algorithm Based on Dynamic Fitness Landscape," International Journal of Cognitive Informatics and Natural Intelligence (IJCINI), IGI Global, vol. 13(1), pages 36-61, January.
    • Handle: RePEc:igg:jcini0:v:13:y:2019:i:1:p:36-61
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJCINI.2019010104
    Download Restriction: no
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Chen Yan & Cai Mengxiang & Zheng Mingyong & Li Kangshun, 2022. "A Many-Objective Practical Swarm Optimization Based on Mixture Uniform Design and Game Mechanism," International Journal of Cognitive Informatics and Natural Intelligence (IJCINI), IGI Global, vol. 16(1), pages 1-17, January.

    More about this item

    Statistics

    Access and download statistics

    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:igg:jcini0:v:13:y:2019:i:1:p:36-61. 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: Journal Editor (email available below). General contact details of provider: https://www.igi-global.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.