A Multiagent Co-Evolutionary Algorithm With Penalty-Based Objective for Network-Based Distributed Optimization
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Chen, Tai-You | - |
dc.contributor.author | Chen, Wei-Neng | - |
dc.contributor.author | Guo, Xiao-Qi | - |
dc.contributor.author | Gong, Yue-Jiao | - |
dc.contributor.author | Jun Zhang | - |
dc.date.accessioned | 2024-05-07T06:30:19Z | - |
dc.date.available | 2024-05-07T06:30:19Z | - |
dc.date.issued | 2024-04 | - |
dc.identifier.issn | 2168-2216 | - |
dc.identifier.issn | 2168-2232 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/118957 | - |
dc.description.abstract | The emergence of networked systems in various fields brings many complex distributed optimization problems, where multiple agents in the system need to optimize a global objective cooperatively when they only have local information. In this work, we take advantage of the intrinsic parallelism of evolutionary computation to address network-based distributed optimization. In the proposed multiagent co-evolutionary algorithm, each agent maintains a subpopulation in which individuals represent solutions to the problem. During optimization, agents perform local optimization on their subpopulations and negotiation through communication with their neighbors. In order to help agents optimize the global objective cooperatively, we design a penalty-based objective function for fitness evaluation, which constrains the subpopulation within a small and controllable range. Further, to make the penalty more targeted, a conflict detection method is proposed to examine whether agents are conflicting on a certain shared variable. Finally, in order to help agents negotiate a consensus solution when only the local objective function is known, we retrofit the processes of negotiating shared variables, namely, evaluation, competition, and sharing. The above approaches form a multiagent co-evolutionary framework, enabling agents to cooperatively optimize the global objective in a distributed manner. Empirical studies show that the proposed algorithm achieves comparable solution quality with the holistic algorithm and better performance than existing gradient-free distributed algorithms on gradient-uncomputable problems. IEEE | - |
dc.format.extent | 13 | - |
dc.language | 영어 | - |
dc.language.iso | ENG | - |
dc.publisher | IEEE | - |
dc.title | A Multiagent Co-Evolutionary Algorithm With Penalty-Based Objective for Network-Based Distributed Optimization | - |
dc.type | Article | - |
dc.publisher.location | 미국 | - |
dc.identifier.doi | 10.1109/TSMC.2024.3380389 | - |
dc.identifier.scopusid | 2-s2.0-85190737180 | - |
dc.identifier.wosid | 001205811500001 | - |
dc.identifier.bibliographicCitation | IEEE Transactions on Systems, Man, and Cybernetics: Systems, pp 1 - 13 | - |
dc.citation.title | IEEE Transactions on Systems, Man, and Cybernetics: Systems | - |
dc.citation.startPage | 1 | - |
dc.citation.endPage | 13 | - |
dc.type.docType | 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, Cybernetics | - |
dc.subject.keywordAuthor | Closed box | - |
dc.subject.keywordAuthor | Computational modeling | - |
dc.subject.keywordAuthor | Distributed algorithms | - |
dc.subject.keywordAuthor | Distributed optimization | - |
dc.subject.keywordAuthor | Evolutionary computation | - |
dc.subject.keywordAuthor | evolutionary computation (EC) | - |
dc.subject.keywordAuthor | Linear programming | - |
dc.subject.keywordAuthor | Multi-agent systems | - |
dc.subject.keywordAuthor | multiagent systems | - |
dc.subject.keywordAuthor | Optimization | - |
dc.subject.keywordAuthor | penalty function | - |
dc.identifier.url | https://ieeexplore.ieee.org/document/10500484 | - |
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.