Interaction-based Prediction for Dynamic Multiobjective Optimization
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Liu, Xiao-Fang | - |
dc.contributor.author | Xu, Xin-Xin | - |
dc.contributor.author | Zhan, Zhi-Hui | - |
dc.contributor.author | Fang, Yongchun | - |
dc.contributor.author | ZHANG, Jun | - |
dc.date.accessioned | 2023-11-14T01:32:25Z | - |
dc.date.available | 2023-11-14T01:32:25Z | - |
dc.date.issued | 2023-12 | - |
dc.identifier.issn | 1089-778X | - |
dc.identifier.issn | 1941-0026 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/115441 | - |
dc.description.abstract | Dynamic multiobjective optimization poses great challenges to evolutionary algorithms due to the change of optimal solutions or Pareto front with time. Learning-based methods are popular to extract the changing pattern of optimal solutions for predicting new solutions. They tend to use all variables as features (i.e., inputs) to build prediction models. However, there are usually some irrelevant and redundant variables, which increase training difficulty and decrease prediction accuracy. This paper proposes a new interaction-based prediction method, which captures the correlation of variables with prediction targets and selects the most relevant variables to build prediction models using neural networks. In particular, the interaction between variables is detected to remove redundant variables. In addition, a correction procedure is developed to further improve predicted solutions according to the prediction error in past environments. The predicted solutions are used to update the population according to a specifically designed update strategy. Integrating the interaction-based prediction (IP) method into the framework of multiobjective evolutionary algorithm based on decomposition (MOEA/D), a new algorithm named IP-DMOEA is put forward. Experimental results on a typical dynamic multiobjective test suite demonstrate the better performance of the proposed IPDMOEA than state-of-the-art algorithms in terms of convergence speed and solution quality. The proposed IP-DMOEA is also successfully applied to the multirobot task scheduling problem. | - |
dc.format.extent | 15 | - |
dc.language | 영어 | - |
dc.language.iso | ENG | - |
dc.publisher | Institute of Electrical and Electronics Engineers | - |
dc.title | Interaction-based Prediction for Dynamic Multiobjective Optimization | - |
dc.type | Article | - |
dc.publisher.location | 미국 | - |
dc.identifier.doi | 10.1109/TEVC.2023.3234113 | - |
dc.identifier.scopusid | 2-s2.0-85147200621 | - |
dc.identifier.wosid | 001125199200020 | - |
dc.identifier.bibliographicCitation | IEEE Transactions on Evolutionary Computation, v.27, no.6, pp 1881 - 1895 | - |
dc.citation.title | IEEE Transactions on Evolutionary Computation | - |
dc.citation.volume | 27 | - |
dc.citation.number | 6 | - |
dc.citation.startPage | 1881 | - |
dc.citation.endPage | 1895 | - |
dc.type.docType | 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 | EVOLUTIONARY ALGORITHM | - |
dc.subject.keywordPlus | STRATEGY | - |
dc.subject.keywordPlus | MEMORY | - |
dc.subject.keywordPlus | POWER | - |
dc.subject.keywordAuthor | Dynamic multiobjective optimization | - |
dc.subject.keywordAuthor | prediction | - |
dc.subject.keywordAuthor | neural network | - |
dc.subject.keywordAuthor | correlation | - |
dc.subject.keywordAuthor | interaction | - |
dc.subject.keywordAuthor | evolutionary computation | - |
dc.identifier.url | https://ieeexplore.ieee.org/document/10005616 | - |
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.