Welcome to IEEE Xplore 2.0: Parallelizing particle swarm optimization

Cart | Sitemap | Help

Abstract


	BROWSE	SEARCH	IEEE XPLORE GUIDE	SUPPORT

View TOC

Parallelizing particle swarm optimization
Bo Li Koichi Wada
Dept. of Comput. Sci., Tsukuba Univ., Ibaraki, Japan;

This paper appears in: Communications, Computers and signal Processing, 2005. PACRIM. 2005 IEEE Pacific Rim Conference on
Publication Date: 24-26 Aug. 2005
On page(s): 288- 291
ISSN:
ISBN: 0-7803-9195-0
INSPEC Accession Number: 8733566
Digital Object Identifier: 10.1109/PACRIM.2005.1517282
Current Version Published: 2005-10-17

Abstract
This paper focuses on a parallel version of particle swarm optimization (PSO) algorithm which can significantly reduces execution time for solving complex large-scale optimization problems. This paper gives an overview of PSO algorithm, and then proposes a design and an implementation of parallel PSO. The proposed algorithm eliminates redundant synchronizations and optimizes message transfer to overlap communication with computation. The experimental results showed that 13.2 times speedup was obtained by the proposed parallel PSO algorithm with 14 processors.

Index Terms
Available to subscribers and IEEE members.

References
Available to subscribers and IEEE members.

Citing Documents
Available to subscribers and IEEE members.

You are not logged in.

Guests may access Abstract records free of charge.