Skip to Main Content
 

Global Search Box

 
 
 
 

ETD Abstract Container

Abstract Header

Particle Swarm Optimization

Devarakonda, SaiPrasanth

Abstract Details

2012, Master of Science (M.S.), University of Dayton, Electrical Engineering.
The particle swarm algorithm is a computational method to optimize a problem iteratively. As the neighborhood determines the sufficiency and frequency of information flow, the static and dynamic neighborhoods are discussed. The characteristics of the different methods for the selection of the algorithm for a particular problem are summarized. The performance of particle swarm optimization with dynamic neighborhood is investigated by three different methods. In the present work two more benchmark functions are tested using the algorithm. Conclusions are drawn by testing the different benchmark functions that reflect the performance of the PSO with dynamic neighborhood. And all the benchmark functions are analyzed by both Synchronous and Asynchronous PSO algorithms.
Raul Ordonez (Committee Chair)
John Loomis (Committee Member)
Robert Penno (Committee Member)
121 p.

Recommended Citations

Citations

  • Devarakonda, S. (2012). Particle Swarm Optimization [Master's thesis, University of Dayton]. OhioLINK Electronic Theses and Dissertations Center. http://rave.ohiolink.edu/etdc/view?acc_num=dayton1335827032

    APA Style (7th edition)

  • Devarakonda, SaiPrasanth. Particle Swarm Optimization. 2012. University of Dayton, Master's thesis. OhioLINK Electronic Theses and Dissertations Center, http://rave.ohiolink.edu/etdc/view?acc_num=dayton1335827032.

    MLA Style (8th edition)

  • Devarakonda, SaiPrasanth. "Particle Swarm Optimization." Master's thesis, University of Dayton, 2012. http://rave.ohiolink.edu/etdc/view?acc_num=dayton1335827032

    Chicago Manual of Style (17th edition)