By Topic

Investigation of parallel particle swarm optimization algorithm with reduction of the search area

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Lancinskas, A. ; Dept. of Syst. Anal., Inst. of Math. & Inf., Vilnius, Lithuania ; Z╠îilinskas, J. ; Ortigosa, P.M.

We consider a population based Particle Swarm Optimization (PSO) algorithm and a few modifications to increase quality of optimization. Several strategies are investigated to exchange data between processors in parallel algorithm. Experimental investigation is performed on Multiple Gravity Assist problem. The results are compared with original PSO.

Published in:

Cluster Computing Workshops and Posters (CLUSTER WORKSHOPS), 2010 IEEE International Conference on

Date of Conference:

20-24 Sept. 2010