IDEAS home Printed from https://ideas.repec.org/a/hin/jnddns/2491796.html
   My bibliography  Save this article

Adaptive Strategies Based on Differential Evolutionary Algorithm for Many-Objective Optimization

Author

Listed:
  • Yifei Sun
  • Kun Bian
  • Zhuo Liu
  • Xin Sun
  • Ruoxia Yao
  • Rui Wang

Abstract

The decomposition-based algorithm, for example, multiobjective evolutionary algorithm based on decomposition (MOEA/D), has been proved effective and useful in a variety of multiobjective optimization problems (MOPs). On the basis of MOEA/D, the MOEA/D-DE replaces the simulated binary crossover (SBX) operator with differential evolution (DE) operator, which is used to enhance the diversity of the solutions more effectively. However, the amplification factor and the crossover probability are fixed in MOEA/D-DE, which would lead to a low convergence rate and be more likely to fall into local optimum. To overcome such a prematurity problem, this paper proposes three different adaptive operators in DE with crossover probability and amplification factors to adjust the parameter settings adaptively. We incorporate these three adaptive operators in MOEA/D-DE and MOEA/D-PaS to solve MOPs and many-objective optimization problems (MaOPs), respectively. This paper also designs a sensitive experiment for the changeable parameter η in the proposed adaptive operators to explore how η would affect the convergence of the proposed algorithms. These adaptive algorithms are tested on many benchmark problems, including ZDT, DTLZ, WFG, and MaF test suites. The experimental results illustrate that the three proposed adaptive algorithms have better performance on most benchmark problems.

Suggested Citation

  • Yifei Sun & Kun Bian & Zhuo Liu & Xin Sun & Ruoxia Yao & Rui Wang, 2021. "Adaptive Strategies Based on Differential Evolutionary Algorithm for Many-Objective Optimization," Discrete Dynamics in Nature and Society, Hindawi, vol. 2021, pages 1-17, November.
  • Handle: RePEc:hin:jnddns:2491796
    DOI: 10.1155/2021/2491796
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/ddns/2021/2491796.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/ddns/2021/2491796.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2021/2491796?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    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:hin:jnddns:2491796. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.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.