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

Big Archive-Assisted Ensemble of Many-Objective Evolutionary Algorithms

Author

Listed:
  • Wen Zhong
  • Jian Xiong
  • Anping Lin
  • Lining Xing
  • Feilong Chen
  • Yingwu Chen
  • Dan Selisteanu

Abstract

Multiobjective evolutionary algorithms (MOEAs) have witnessed prosperity in solving many-objective optimization problems (MaOPs) over the past three decades. Unfortunately, no one single MOEA equipped with given parameter settings, mating-variation operator, and environmental selection mechanism is suitable for obtaining a set of solutions with excellent convergence and diversity for various types of MaOPs. The reality is that different MOEAs show great differences in handling certain types of MaOPs. Aiming at these characteristics, this paper proposes a flexible ensemble framework, namely, ASES, which is highly scalable for embedding any number of MOEAs to promote their advantages. To alleviate the undesirable phenomenon that some promising solutions are discarded during the evolution process, a big archive that number of contained solutions be far larger than population size is integrated into this ensemble framework to record large-scale nondominated solutions, and also an efficient maintenance strategy is developed to update the archive. Furthermore, the knowledge coming from updating archive is exploited to guide the evolutionary process for different MOEAs, allocating limited computational resources for efficient algorithms. A large number of numerical experimental studies demonstrated superior performance of the proposed ASES. Among 52 test instances, the ASES performs better than all the six baseline algorithms on at least half of the test instances with respect to both metrics hypervolume and inverted generational distance.

Suggested Citation

  • Wen Zhong & Jian Xiong & Anping Lin & Lining Xing & Feilong Chen & Yingwu Chen & Dan Selisteanu, 2021. "Big Archive-Assisted Ensemble of Many-Objective Evolutionary Algorithms," Complexity, Hindawi, vol. 2021, pages 1-17, February.
  • Handle: RePEc:hin:complx:6614283
    DOI: 10.1155/2021/6614283
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/complexity/2021/6614283.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/complexity/2021/6614283.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2021/6614283?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:complx:6614283. 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.