Date of Award

12-1-2010

Degree Name

Master of Science

Department

Computer Science

First Advisor

Rahimi, Shahram

Abstract

Population-based global optimization algorithms including Particle Swarm Optimization (PSO) have become popular for solving multi-optima problems much more efficiently than the traditional mathematical techniques. In this research, we present and evaluate a new parallel PSO algorithm that provides a significant performance improvement as compared to the serial PSO algorithm. Instead of merely assigning parts of the task of serial version to several processors, the new algorithm places multiple swarms on the available nodes in which operate independently, while collaborating on the same task. With the reduction of the communication bottleneck as well the ability to manipulate the individual swarms independently, the proposed approach outperforms the original PSO algorithm and still maintains the simplicity and ease of implementation.

Share

COinS
 

Access

This thesis is only available for download to the SIUC community. Others should
contact the interlibrary loan department of your local library.