Comparisons study of APSO OLPSO and CLPSO on CEC2005 and CEC2014 test suits
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Li, Yan-Fei | - |
dc.contributor.author | Zhan, Zhi-Hui | - |
dc.contributor.author | Lin, Ying | - |
dc.contributor.author | Zhang, Jun | - |
dc.date.accessioned | 2023-12-13T02:00:24Z | - |
dc.date.available | 2023-12-13T02:00:24Z | - |
dc.date.issued | 2015-09 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/116361 | - |
dc.description.abstract | Particle swarm optimization (PSO) is originally designed to solve continuous optimization problems. Recently, lots of improved PSO variants with different features have been proposed, such as Adaptive particle swarm optimization (APSO), Orthogonal Learning particle swarm optimization (OLPSO) and Comprehensive Learning particle swarm optimization (CLPSO). In order to find out whether these PSOs have any particular difficulties or preference and whether one of them would outperform the others on a majority of the tested problems, we analyze the performance of different PSOs on various tested problems. In this paper, we evaluate the performance of APSO, OLPSO, and CLPSO on more complex benchmark functions. The comparison is performed on a large amount of real-parameter optimization problems, including the CEC 2005 and the CEC 2014 benchmark functions. Finally, we find out that the OLPSO achieves higher solution quality than the other two PSOs on most problems based on the simulation results on benchmark functions. © 2015 IEEE. | - |
dc.format.extent | 7 | - |
dc.language | 영어 | - |
dc.language.iso | ENG | - |
dc.publisher | Institute of Electrical and Electronics Engineers Inc. | - |
dc.title | Comparisons study of APSO OLPSO and CLPSO on CEC2005 and CEC2014 test suits | - |
dc.type | Article | - |
dc.publisher.location | 미국 | - |
dc.identifier.doi | 10.1109/CEC.2015.7257286 | - |
dc.identifier.scopusid | 2-s2.0-84963570201 | - |
dc.identifier.wosid | 000380444803029 | - |
dc.identifier.bibliographicCitation | 2015 IEEE Congress on Evolutionary Computation (CEC), pp 3179 - 3185 | - |
dc.citation.title | 2015 IEEE Congress on Evolutionary Computation (CEC) | - |
dc.citation.startPage | 3179 | - |
dc.citation.endPage | 3185 | - |
dc.type.docType | Conference paper | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | sci | - |
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 | GLOBAL OPTIMIZATION | - |
dc.subject.keywordAuthor | Adaptive particle swarm optimization (APSO) | - |
dc.subject.keywordAuthor | benchmark problems | - |
dc.subject.keywordAuthor | Comprehensive Learning particle swarm optimization (CLPSO) | - |
dc.subject.keywordAuthor | Orthogonal Learning particle swarm optimization (OLPSO) | - |
dc.identifier.url | https://ieeexplore.ieee.org/document/7257286 | - |
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.