A Parallel Implementation of Multiobjective Particle Swarm Optimization Algorithm Based on Decomposition
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Li, Jin-Zhou | - |
dc.contributor.author | Chen, Wei-Neng | - |
dc.contributor.author | Zhang, Jun | - |
dc.contributor.author | Zhan, Zhi-hui | - |
dc.date.accessioned | 2023-12-13T08:00:17Z | - |
dc.date.available | 2023-12-13T08:00:17Z | - |
dc.date.issued | 2015-12 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/116381 | - |
dc.description.abstract | Multiobjective particle swarm optimization based on decomposition (MOPSO/D) is an effective algorithm for multiobjective optimization problems (MOPs). This paper proposes a parallel version of MOPSO/D algorithm using both message passing interface (MPI) and OpenMP, which is abbreviated as MO-MOPSO/D. It adopts an island model and divides the whole population into several subspecies. Based on the hybrid of distributed and shared-memory programming models, the proposed algorithm can fully use the processing power of today's multicore processors and even a cluster. The experimental results show that MO-MOPSO/D can achieve speedups of 2x on a personal computer equipped with a dual-core four-thread CPU. In terms of the quality of solutions, it can perform similarly to the serial MOPSO/D but greatly outperform NSGA-II. An additional experiment is done on a cluster, and the results show the speedup is not obvious for small-scale MOPs and it is more suitable for solving highly complex problems. | - |
dc.format.extent | 8 | - |
dc.language | 영어 | - |
dc.language.iso | ENG | - |
dc.publisher | IEEE | - |
dc.title | A Parallel Implementation of Multiobjective Particle Swarm Optimization Algorithm Based on Decomposition | - |
dc.type | Article | - |
dc.publisher.location | 미국 | - |
dc.identifier.doi | 10.1109/SSCI.2015.187 | - |
dc.identifier.scopusid | 2-s2.0-84964951723 | - |
dc.identifier.wosid | 000380431500180 | - |
dc.identifier.bibliographicCitation | 2015 IEEE Symposium Series on Computational Intelligence, pp 1310 - 1317 | - |
dc.citation.title | 2015 IEEE Symposium Series on Computational Intelligence | - |
dc.citation.startPage | 1310 | - |
dc.citation.endPage | 1317 | - |
dc.type.docType | Proceedings 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 | GENETIC LOCAL SEARCH | - |
dc.identifier.url | https://ieeexplore.ieee.org/document/7376763 | - |
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.