A Study on the Performance of Multiple Sub-Swarms for PSO

碩士 === 國立中山大學 === 資訊工程學系研究所 === 103 === In the past decades, many global optimization algorithms based on biologically-inspired strategies have been developed. Most of them are population-based algorithms and their abilities of adaptive learning have shown they can solve optimization problems effect...

Full description

Bibliographic Details
Main Authors: Jui-Chi Chen, 陳睿淇
Other Authors: Tzung-Pei Hong
Format: Others
Language:en_US
Published: 2015
Online Access:http://ndltd.ncl.edu.tw/handle/r38j7k
id ndltd-TW-103NSYS5392070
record_format oai_dc
spelling ndltd-TW-103NSYS53920702019-05-15T22:18:01Z http://ndltd.ncl.edu.tw/handle/r38j7k A Study on the Performance of Multiple Sub-Swarms for PSO 多群組之粒子群演算法之效能研究 Jui-Chi Chen 陳睿淇 碩士 國立中山大學 資訊工程學系研究所 103 In the past decades, many global optimization algorithms based on biologically-inspired strategies have been developed. Most of them are population-based algorithms and their abilities of adaptive learning have shown they can solve optimization problems effectively. Particle swarm optimization (PSO) is a very popular and common-used strategy among them since it is easily implemented. In the early days, PSO was usually performed on a single swarm. Along with the development of variant PSO technologies, multiple-swarm schemes were also adopted for some purposes such as parallel processing, multimodal optimization and multi-objective optimization. In the thesis, we first revisit and discuss some interesting characteristics of PSO for multiple sub-swarm processing. We then propose a multi-sub-swarm algorithm, in which the original particle swarm is divided into several sub-swarms with the same total size, to investigate the variation of performance with different sub-swarm numbers. The algorithm is very suitable to be parallelized in nature. We then propose a hierarchical PSO strategy called HPSO, which executes the PSO algorithm in hierarchical levels and uses some operations to increase the performance. Different execution structures of HPSO are discussed as well. Furthermore, we propose a dynamic migration mechanism for PSO, which can automatically determine when to migrate a portion of particles from one sub-swarm to its neighbor. Finally, we apply the dynamic migration mechanism on the HPSO to check the effects of combination. By additionally using some operations such as migration, merge and re-initialization, the particles can increase diversity effectively and thus obtain good results. Experiments are also made to show the performance of the proposed approaches. Tzung-Pei Hong 洪宗貝 2015 學位論文 ; thesis 85 en_US
collection NDLTD
language en_US
format Others
sources NDLTD
description 碩士 === 國立中山大學 === 資訊工程學系研究所 === 103 === In the past decades, many global optimization algorithms based on biologically-inspired strategies have been developed. Most of them are population-based algorithms and their abilities of adaptive learning have shown they can solve optimization problems effectively. Particle swarm optimization (PSO) is a very popular and common-used strategy among them since it is easily implemented. In the early days, PSO was usually performed on a single swarm. Along with the development of variant PSO technologies, multiple-swarm schemes were also adopted for some purposes such as parallel processing, multimodal optimization and multi-objective optimization. In the thesis, we first revisit and discuss some interesting characteristics of PSO for multiple sub-swarm processing. We then propose a multi-sub-swarm algorithm, in which the original particle swarm is divided into several sub-swarms with the same total size, to investigate the variation of performance with different sub-swarm numbers. The algorithm is very suitable to be parallelized in nature. We then propose a hierarchical PSO strategy called HPSO, which executes the PSO algorithm in hierarchical levels and uses some operations to increase the performance. Different execution structures of HPSO are discussed as well. Furthermore, we propose a dynamic migration mechanism for PSO, which can automatically determine when to migrate a portion of particles from one sub-swarm to its neighbor. Finally, we apply the dynamic migration mechanism on the HPSO to check the effects of combination. By additionally using some operations such as migration, merge and re-initialization, the particles can increase diversity effectively and thus obtain good results. Experiments are also made to show the performance of the proposed approaches.
author2 Tzung-Pei Hong
author_facet Tzung-Pei Hong
Jui-Chi Chen
陳睿淇
author Jui-Chi Chen
陳睿淇
spellingShingle Jui-Chi Chen
陳睿淇
A Study on the Performance of Multiple Sub-Swarms for PSO
author_sort Jui-Chi Chen
title A Study on the Performance of Multiple Sub-Swarms for PSO
title_short A Study on the Performance of Multiple Sub-Swarms for PSO
title_full A Study on the Performance of Multiple Sub-Swarms for PSO
title_fullStr A Study on the Performance of Multiple Sub-Swarms for PSO
title_full_unstemmed A Study on the Performance of Multiple Sub-Swarms for PSO
title_sort study on the performance of multiple sub-swarms for pso
publishDate 2015
url http://ndltd.ncl.edu.tw/handle/r38j7k
work_keys_str_mv AT juichichen astudyontheperformanceofmultiplesubswarmsforpso
AT chénruìqí astudyontheperformanceofmultiplesubswarmsforpso
AT juichichen duōqúnzǔzhīlìziqúnyǎnsuànfǎzhīxiàonéngyánjiū
AT chénruìqí duōqúnzǔzhīlìziqúnyǎnsuànfǎzhīxiàonéngyánjiū
AT juichichen studyontheperformanceofmultiplesubswarmsforpso
AT chénruìqí studyontheperformanceofmultiplesubswarmsforpso
_version_ 1719128518303940608