Orthogonal learning particle swarm optimization
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Zhan, Zhi-Hui | - |
dc.contributor.author | Zhang, Jun | - |
dc.contributor.author | Liu, Ou | - |
dc.date.accessioned | 2024-01-22T13:36:15Z | - |
dc.date.available | 2024-01-22T13:36:15Z | - |
dc.date.issued | 2011-12 | - |
dc.identifier.issn | 1089-778X | - |
dc.identifier.issn | 1941-0026 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/117921 | - |
dc.description.abstract | This paper proposes an orthogonal learning particle swarm optimization (OLPSO) by designing an orthogonal learning (OL) strategy through the orthogonal experimental design (OED) method. The OL strategy takes the dimensions of the problem as the orthogonal experimental factors. The levels of each dimension (factor) are the two choices of the personal best position and the neighborhood's best position. By orthogonally combining the two learning exemplars, the useful information can be discovered, preserved and utilized to construct an efficient exemplar to guide the particle to fly in a more promising direction towards the global optimum. The effectiveness and efficiency of the OL strategy is demonstrated on a set of benchmark functions by comparing the PSOs with and without OL strategy. The OL strategy improves the PSO algorithm in terms of higher quality solution and faster convergence speed. | - |
dc.format.extent | 2 | - |
dc.language | 영어 | - |
dc.language.iso | ENG | - |
dc.publisher | ACM | - |
dc.title | Orthogonal learning particle swarm optimization | - |
dc.type | Article | - |
dc.publisher.location | 네델란드 | - |
dc.identifier.doi | 10.1145/1569901.1570147 | - |
dc.identifier.scopusid | 2-s2.0-72749104380 | - |
dc.identifier.wosid | 000297586200006 | - |
dc.identifier.bibliographicCitation | GECCO '09: Proceedings of the 11th Annual conference on Genetic and evolutionary computation, v.15, no.6, pp 1763 - 1764 | - |
dc.citation.title | GECCO '09: Proceedings of the 11th Annual conference on Genetic and evolutionary computation | - |
dc.citation.volume | 15 | - |
dc.citation.number | 6 | - |
dc.citation.startPage | 1763 | - |
dc.citation.endPage | 1764 | - |
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.relation.journalWebOfScienceCategory | Computer Science, Theory & Methods | - |
dc.subject.keywordPlus | SIMULATED ANNEALING ALGORITHM | - |
dc.subject.keywordPlus | GENETIC ALGORITHM | - |
dc.subject.keywordPlus | OPTIMA | - |
dc.subject.keywordAuthor | Global numerical optimization | - |
dc.subject.keywordAuthor | Orthogonal experimental design | - |
dc.subject.keywordAuthor | Orthogonal learning particle swarm optimization | - |
dc.subject.keywordAuthor | Particle swarm optimization | - |
dc.identifier.url | https://dl.acm.org/doi/10.1145/1569901.1570147 | - |
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.