Performance enhancement and hardware implementation of Particle Swarm Optimization
by Tewolde, Girma Siele, Ph.D., OAKLAND UNIVERSITY, 2008, 168 pages; 3333075

Abstract:

In our daily life we are faced with all kinds of decision problems, whether we realize it or not, and many of these decision problems involve optimizations. Such problems are also common in all fields of applications. Although there are a rich set of tools available for the various classes of optimization problems, there is yet a continuous effort to improve the existing tools and to come up with new ones that can tackle computationally hard problems. This dissertation investigates a relatively recent nature inspired global optimization algorithm called Particle Swarm Optimization (PSO). PSO has been demonstrated to be an effective tool for a variety of optimization problems. Like other similar meta-heuristics, PSO has a few parameters that need to be properly tuned for each problem to achieve good performance. The first goal of this work is to present an automatic parameter optimization technique for the PSO algorithm to achieve enhanced performance.

Although PSO is shown to be efficient compared to other contemporary population based optimization techniques, for many continuous multimodal and multidimensional problems, it still suffers from performance loss when it is targeted onto embedded application platforms. Examples of such target applications could include small mobile robots, distributed sensor nodes in sensor network applications for environmental monitoring or for search and rescue applications. Implementation technologies in these and other similar application scenarios are commonly targeted on low footprint processors and programmable logic devices. The second goal of this dissertation is to develop a high-performance, efficient, flexible, modular and reusable hardware architecture for the PSO algorithm. The accelerated execution performance of the proposed architecture is demonstrated on standard mathematical benchmark functions as well as on large scale real world problem scenarios. A parallelization scheme for further speedup of the execution performance of the PSO algorithm is also presented and evaluated.

 
AdviserDarrin M. Hanna
SchoolOAKLAND UNIVERSITY
SourceDAI/B 69-10, p. , Dec 2008
Source TypeDissertation
SubjectsElectrical engineering; Computer science
Publication Number3333075
Adobe PDF Access the complete dissertation:
 

» Find an electronic copy at your library.
  Use the link below to access a full citation record of this graduate work:
  http://gateway.proquest.com/openurl%3furl_ver=Z39.88-2004%26res_dat=xri:pqdiss%26rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation%26rft_dat=xri:pqdiss:3333075
  If your library subscribes to the ProQuest Dissertations & Theses (PQDT) database, you may be entitled to a free electronic version of this graduate work. If not, you will have the option to purchase one, and access a 24 page preview for free (if available).

About ProQuest Dissertations & Theses
With over 2.3 million records, the ProQuest Dissertations & Theses (PQDT) database is the most comprehensive collection of dissertations and theses in the world. It is the database of record for graduate research.

The database includes citations of graduate works ranging from the first U.S. dissertation, accepted in 1861, to those accepted as recently as last semester. Of the 2.3 million graduate works included in the database, ProQuest offers more than 1.9 million in full text formats. Of those, over 860,000 are available in PDF format. More than 60,000 dissertations and theses are added to the database each year.

If you have questions, please feel free to visit the ProQuest Web site - http://www.proquest.com - or call ProQuest Hotline Customer Support at 1-800-521-3042.