Competitive and cooperative particle swarm optimization with information sharing mechanism for global optimization problems
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Li, Yuhua | - |
dc.contributor.author | Zhan, Zhi-Hui | - |
dc.contributor.author | Lin, Shujin | - |
dc.contributor.author | Zhang, Jun | - |
dc.contributor.author | Luo, Xiaonan | - |
dc.date.accessioned | 2023-12-13T07:00:25Z | - |
dc.date.available | 2023-12-13T07:00:25Z | - |
dc.date.issued | 2015-02 | - |
dc.identifier.issn | 0020-0255 | - |
dc.identifier.issn | 1872-6291 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/116378 | - |
dc.description.abstract | This paper proposes an information sharing mechanism (ISM) to improve the performance of particle swarm optimization (PSO). The ISM allows each particle to share its best search information, so that all the other particles can take advantage of the shared information by communicating with it. In this way, the particles could enhance the mutual interaction with the others sufficiently and heighten their search ability greatly by using the search information of the whole swarm. Also, a competitive and cooperative (CC) operator is designed for a particle to utilize the shared information in a proper and efficient way. As the ISM share the search information among all the particles, it is an appropriate way to mix up information of the whole swarm for a better exploration of the landscape. Therefore, the competitive and cooperative PSO with ISM (CCPSO-ISM) is capable to prevent the premature convergence when solving global optimization problems. The satisfactory performance of CCPSO-ISM is evaluated by comparing it with other variants of PSOs on a set of 16 global optimization functions. Moreover, the effectiveness and efficiency of CCPSO-ISM is validated under different test environments such as biased initialization, coordinate rotated and high dimensionality. (C) 2014 Elsevier Inc. All rights reserved. | - |
dc.format.extent | 13 | - |
dc.language | 영어 | - |
dc.language.iso | ENG | - |
dc.publisher | Elsevier BV | - |
dc.title | Competitive and cooperative particle swarm optimization with information sharing mechanism for global optimization problems | - |
dc.type | Article | - |
dc.publisher.location | 미국 | - |
dc.identifier.doi | 10.1016/j.ins.2014.09.030 | - |
dc.identifier.scopusid | 2-s2.0-84911922776 | - |
dc.identifier.wosid | 000345480900023 | - |
dc.identifier.bibliographicCitation | Information Sciences, v.293, pp 370 - 382 | - |
dc.citation.title | Information Sciences | - |
dc.citation.volume | 293 | - |
dc.citation.startPage | 370 | - |
dc.citation.endPage | 382 | - |
dc.type.docType | 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, Information Systems | - |
dc.subject.keywordPlus | HARMONY SEARCH ALGORITHM | - |
dc.subject.keywordPlus | EVOLUTIONARY | - |
dc.subject.keywordPlus | DIVERSITY | - |
dc.subject.keywordPlus | OPTIMA | - |
dc.subject.keywordPlus | MODEL | - |
dc.subject.keywordAuthor | Particle swarm optimization (PSO) | - |
dc.subject.keywordAuthor | Competition | - |
dc.subject.keywordAuthor | Cooperation | - |
dc.subject.keywordAuthor | Information sharing | - |
dc.subject.keywordAuthor | Global optimization problems | - |
dc.identifier.url | https://www.sciencedirect.com/science/article/pii/S0020025514009360?via%3Dihub | - |
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.