An Elite Gene Guided Reproduction Operator for Many-Objective Optimization
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Zhu, Qingling | - |
dc.contributor.author | Lin, Qiuzhen | - |
dc.contributor.author | Li, Jianqiang | - |
dc.contributor.author | Coello Coello, Carlos A. | - |
dc.contributor.author | Ming, Zhong | - |
dc.contributor.author | Chen, Jianyong | - |
dc.contributor.author | Zhang, Jun | - |
dc.date.accessioned | 2023-11-14T01:30:42Z | - |
dc.date.available | 2023-11-14T01:30:42Z | - |
dc.date.issued | 2021-02 | - |
dc.identifier.issn | 2168-2267 | - |
dc.identifier.issn | 2168-2275 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/115407 | - |
dc.description.abstract | Traditional reproduction operators in many-objective evolutionary algorithms (MaOEAs) seem to not be so effective to tackle many-objective optimization problems (MaOPs). This is mainly because the population size cannot be set to an arbitrarily large value if the computational efficiency is of concern. In such a case, the distance between the parents becomes remarkably large and, consequently, it is not easy to reproduce a superior offspring in high-dimensional objective space. To alleviate this problem, an elite gene-guided (EGG) reproduction operator is proposed to tackle MaOPs in this article. In this operator, an elite gene pool is built by collecting the knee points from the current population. Then, the offspring is produced by exchanging the genes with this elite gene pool under an exchange rate, aiming to reserve more promising genes into the next generation. In order to provide new genes for the population, other genes will be disturbed under a disturbance rate. The settings and functional analysis of the exchange rate and disturbance rate are studied using several experiments. The proposed EGG operator is easy to implement and can be embedded to any MaOEA. As examples, we show the embedding of the proposed EGG operator into four competitive MaOEAs, that is, MOEA/D, NSGA-III, \theta -DEA, and SPEA2-SDE provide some advantages over simulated binary crossover, differential evolution, and an evolutionary path-based reproduction operator on solving a number of benchmark problems with 3 to 15 objectives. © 2013 IEEE. | - |
dc.format.extent | 14 | - |
dc.language | 영어 | - |
dc.language.iso | ENG | - |
dc.publisher | IEEE Advancing Technology for Humanity | - |
dc.title | An Elite Gene Guided Reproduction Operator for Many-Objective Optimization | - |
dc.type | Article | - |
dc.publisher.location | 미국 | - |
dc.identifier.doi | 10.1109/TCYB.2019.2932451 | - |
dc.identifier.scopusid | 2-s2.0-85090718826 | - |
dc.identifier.wosid | 000608690900024 | - |
dc.identifier.bibliographicCitation | IEEE Transactions on Cybernetics, v.51, no.2, pp 765 - 778 | - |
dc.citation.title | IEEE Transactions on Cybernetics | - |
dc.citation.volume | 51 | - |
dc.citation.number | 2 | - |
dc.citation.startPage | 765 | - |
dc.citation.endPage | 778 | - |
dc.type.docType | 정기학술지(Article(Perspective Article포함)) | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Automation & Control Systems | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalWebOfScienceCategory | Automation & Control Systems | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Artificial Intelligence | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Cybernetics | - |
dc.subject.keywordPlus | EVOLUTIONARY ALGORITHM | - |
dc.subject.keywordAuthor | Crossover operator | - |
dc.subject.keywordAuthor | evolutionary algorithm | - |
dc.subject.keywordAuthor | evolutionary operator | - |
dc.subject.keywordAuthor | many-objective optimization | - |
dc.subject.keywordAuthor | recombination operator | - |
dc.identifier.url | https://ieeexplore.ieee.org/document/8820137?arnumber=8820137&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.