Automatic Niching Differential Evolution With Contour Prediction Approach for Multimodal Optimization Problems
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Wang, Zi-Jia a | - |
dc.contributor.author | Zhan, Zhi-Hui | - |
dc.contributor.author | Lin, Ying | - |
dc.contributor.author | Yu, Wei-Jie | - |
dc.contributor.author | Wang, Hua | - |
dc.contributor.author | Kwong, Sam | - |
dc.contributor.author | Zhang, Jun | - |
dc.date.accessioned | 2023-11-14T01:31:08Z | - |
dc.date.available | 2023-11-14T01:31:08Z | - |
dc.date.issued | 2020-02 | - |
dc.identifier.issn | 1089-778X | - |
dc.identifier.issn | 1941-0026 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/115416 | - |
dc.description.abstract | Niching techniques have been widely incorporated into evolutionary algorithms (EAs) for solving multimodal optimization problems (MMOPs). However, most of the existing niching techniques are either sensitive to the niching parameters or require extra fitness evaluations (FEs) to maintain the niche detection accuracy. In this paper, we propose a new automatic niching technique based on the affinity propagation clustering (APC) and design a novel niching differential evolution (DE) algorithm, termed as automatic niching DE (ANDE), for solving MMOPs. In the proposed ANDE algorithm, APC acts as a parameter-free automatic niching method that does not need to predefine the number of clusters or the cluster size. Also, it can facilitate locating multiple peaks without extra FEs. Furthermore, the ANDE algorithm is enhanced by a contour prediction approach (CPA) and a two-level local search (TLLS) strategy. First, the CPA is a predictive search strategy. It exploits the individual distribution information in each niche to estimate the contour landscape, and then predicts the rough position of the potential peak to help accelerate the convergence speed. Second, the TLLS is a solution refine strategy to further increase the solution accuracy after the CPA roughly predicting the peaks. Compared with the other state-of-the-art DE and non-DE multimodal algorithms, even the winner of competition on multimodal optimization, the experimental results on 20 widely used benchmark functions illustrate the superiority of the proposed ANDE algorithm. © 1997-2012 IEEE. | - |
dc.format.extent | 15 | - |
dc.language | 영어 | - |
dc.language.iso | ENG | - |
dc.publisher | Institute of Electrical and Electronics Engineers | - |
dc.title | Automatic Niching Differential Evolution With Contour Prediction Approach for Multimodal Optimization Problems | - |
dc.type | Article | - |
dc.publisher.location | 미국 | - |
dc.identifier.doi | 10.1109/TEVC.2019.2910721 | - |
dc.identifier.scopusid | 2-s2.0-85064704140 | - |
dc.identifier.wosid | 000510708100009 | - |
dc.identifier.bibliographicCitation | IEEE Transactions on Evolutionary Computation, v.24, no.1, pp 114 - 128 | - |
dc.citation.title | IEEE Transactions on Evolutionary Computation | - |
dc.citation.volume | 24 | - |
dc.citation.number | 1 | - |
dc.citation.startPage | 114 | - |
dc.citation.endPage | 128 | - |
dc.type.docType | 정기학술지(Article(Perspective Article포함)) | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Artificial Intelligence | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Theory & Methods | - |
dc.subject.keywordPlus | PARTICLE SWARM OPTIMIZATION | - |
dc.subject.keywordPlus | MULTIOBJECTIVE OPTIMIZATION | - |
dc.subject.keywordPlus | GENETIC ALGORITHM | - |
dc.subject.keywordPlus | ENSEMBLE | - |
dc.subject.keywordPlus | MUTATION | - |
dc.subject.keywordPlus | STRATEGY | - |
dc.subject.keywordAuthor | Affinity propagation clustering (APC) | - |
dc.subject.keywordAuthor | contour prediction approach (CPA) | - |
dc.subject.keywordAuthor | differential evolution (DE) | - |
dc.subject.keywordAuthor | multimodal optimization problems (MMOPs) | - |
dc.subject.keywordAuthor | niching techniques | - |
dc.identifier.url | https://ieeexplore.ieee.org/document/8688426?arnumber=8688426&SID=EBSCO:edseee | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
55 Hanyangdeahak-ro, Sangnok-gu, Ansan, Gyeonggi-do, 15588, Korea+82-31-400-4269 sweetbrain@hanyang.ac.kr
COPYRIGHT © 2021 HANYANG UNIVERSITY. ALL RIGHTS RESERVED.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.