Coevolutionary particle swarm optimization with bottleneck objective learning strategy for many-objective optimization
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Liu, Xiao-Fang | - |
dc.contributor.author | Zhan, Zhi-Hui | - |
dc.contributor.author | Gao, Ying | - |
dc.contributor.author | Zhang, Jie | - |
dc.contributor.author | Kwong, Sam | - |
dc.contributor.author | ZHANG, Jun | - |
dc.date.accessioned | 2023-11-14T01:33:37Z | - |
dc.date.available | 2023-11-14T01:33:37Z | - |
dc.date.issued | 2019-08 | - |
dc.identifier.issn | 1089-778X | - |
dc.identifier.issn | 1941-0026 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/115456 | - |
dc.description.abstract | The application of multiobjective evolutionary algorithms to many-objective optimization problems often faces challenges in terms of diversity and convergence. On the one hand, with a limited population size, it is difficult for an algorithm to cover different parts of the whole Pareto front (PF) in a large objective space. The algorithm tends to concentrate only on limited areas. On the other hand, as the number of objectives increases, solutions easily have poor values on some objectives, which can be regarded as poor bottleneck objectives that restrict solutions' convergence to the PF. Thus, we propose a coevolutionary particle swarm optimization with a bottleneck objective learning (BOL) strategy for many-objective optimization. In the proposed algorithm, multiple swarms coevolve in distributed fashion to maintain diversity for approximating different parts of the whole PF, and a novel BOL strategy is developed to improve convergence on all objectives. In addition, we develop a solution reproduction procedure with both an elitist learning strategy (ELS) and a juncture learning strategy (JLS) to improve the quality of archived solutions. The ELS helps the algorithm to jump out of local PFs, and the JLS helps to reach out to the missing areas of the PF that are easily missed by the swarms. The performance of the proposed algorithm is evaluated using two widely used test suites with different numbers of objectives. Experimental results show that the proposed algorithm compares favorably with six other state-of-the-art algorithms on many-objective optimization. © 1997-2012 IEEE. | - |
dc.format.extent | 16 | - |
dc.language | 영어 | - |
dc.language.iso | ENG | - |
dc.publisher | Institute of Electrical and Electronics Engineers | - |
dc.title | Coevolutionary particle swarm optimization with bottleneck objective learning strategy for many-objective optimization | - |
dc.type | Article | - |
dc.publisher.location | 미국 | - |
dc.identifier.doi | 10.1109/TEVC.2018.2875430 | - |
dc.identifier.scopusid | 2-s2.0-85054626260 | - |
dc.identifier.wosid | 000478941300004 | - |
dc.identifier.bibliographicCitation | IEEE Transactions on Evolutionary Computation, v.23, no.4, pp 587 - 602 | - |
dc.citation.title | IEEE Transactions on Evolutionary Computation | - |
dc.citation.volume | 23 | - |
dc.citation.number | 4 | - |
dc.citation.startPage | 587 | - |
dc.citation.endPage | 602 | - |
dc.type.docType | 정기학술지(Article(Perspective Article포함)) | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | sci | - |
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 | MULTIOBJECTIVE EVOLUTIONARY ALGORITHM | - |
dc.subject.keywordPlus | PARETO | - |
dc.subject.keywordPlus | SELECTION | - |
dc.subject.keywordPlus | MOEA/D | - |
dc.subject.keywordAuthor | Bottleneck objective learning (BOL) | - |
dc.subject.keywordAuthor | coevolution | - |
dc.subject.keywordAuthor | many-objective optimization problems (MaOPs) | - |
dc.subject.keywordAuthor | particle swarm optimization (PSO) | - |
dc.identifier.url | https://ieeexplore.ieee.org/document/8489938?arnumber=8489938&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.