Multi-objective multi-criteria evolutionary algorithm for multi-objective multi-task optimization
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Du, Ke-Jing | - |
dc.contributor.author | Li, Jian-Yu | - |
dc.contributor.author | (Wang, Hua | - |
dc.contributor.author | Jun ZHANG | - |
dc.date.accessioned | 2023-11-14T01:32:06Z | - |
dc.date.available | 2023-11-14T01:32:06Z | - |
dc.date.issued | 2023-04 | - |
dc.identifier.issn | 2199-4536 | - |
dc.identifier.issn | 2198-6053 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/115435 | - |
dc.description.abstract | Evolutionary multi-objective multi-task optimization is an emerging paradigm for solving multi-objective multi-task optimization problem (MO-MTOP) using evolutionary computation. However, most existing methods tend to directly treat the multiple multi-objective tasks as different problems and optimize them by different populations, which face the difficulty in designing good knowledge transferring strategy among the tasks/populations. Different from existing methods that suffer from the difficult knowledge transfer, this paper proposes to treat the MO-MTOP as a multi-objective multi-criteria optimization problem (MO-MCOP), so that the knowledge of all the tasks can be inherited in a same population to be fully utilized for solving the MO-MTOP more efficiently. To be specific, the fitness evaluation function of each task in the MO-MTOP is treated as an evaluation criterion in the corresponding MO-MCOP, and therefore, the MO-MCOP has multiple relevant evaluation criteria to help the individual selection and evolution in different evolutionary stages. Furthermore, a probability-based criterion selection strategy and an adaptive parameter learning method are also proposed to better select the fitness evaluation function as the criterion. By doing so, the algorithm can use suitable evaluation criteria from different tasks at different evolutionary stages to guide the individual selection and population evolution, so as to find out the Pareto optimal solutions of all tasks. By integrating the above, this paper develops a multi-objective multi-criteria evolutionary algorithm framework for solving MO-MTOP. To investigate the proposed algorithm, extensive experiments are conducted on widely used MO-MTOPs to compare with some state-of-the-art and well-performing algorithms, which have verified the great effectiveness and efficiency of the proposed algorithm. Therefore, treating MO-MTOP as MO-MCOP is a potential and promising direction for solving MO-MTOP. | - |
dc.format.extent | 18 | - |
dc.language | 영어 | - |
dc.language.iso | ENG | - |
dc.publisher | TIERGARTENSTRASSE 17, HEIDELBERG, GERMANY, D-69121 | - |
dc.title | Multi-objective multi-criteria evolutionary algorithm for multi-objective multi-task optimization | - |
dc.type | Article | - |
dc.publisher.location | 독일 | - |
dc.identifier.doi | 10.1007/s40747-022-00650-8 | - |
dc.identifier.scopusid | 2-s2.0-85133934663 | - |
dc.identifier.wosid | 000759328100001 | - |
dc.identifier.bibliographicCitation | COMPLEX & INTELLIGENT SYSTEMS, v.9, no.2, pp 1211 - 1228 | - |
dc.citation.title | COMPLEX & INTELLIGENT SYSTEMS | - |
dc.citation.volume | 9 | - |
dc.citation.number | 2 | - |
dc.citation.startPage | 1211 | - |
dc.citation.endPage | 1228 | - |
dc.type.docType | 정기학술지(Article(Perspective Article포함)) | - |
dc.description.isOpenAccess | Y | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Artificial Intelligence | - |
dc.subject.keywordPlus | PARTICLE SWARM OPTIMIZATION | - |
dc.subject.keywordPlus | EXPENSIVE OPTIMIZATION | - |
dc.subject.keywordPlus | COMPUTATION | - |
dc.subject.keywordAuthor | Multi-objective optimization | - |
dc.subject.keywordAuthor | Multi-criteria optimization | - |
dc.subject.keywordAuthor | Multi-task optimization | - |
dc.subject.keywordAuthor | Evolutionary algorithm | - |
dc.subject.keywordAuthor | Evolutionary computation | - |
dc.identifier.url | https://www.proquest.com/docview/2802663202?accountid=11283 | - |
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.