Date of Award
2012
Publisher
North Dakota State University
Document Type
Master's Paper
Degree Awarded
Master of Science (MS)
Program
Computer Science
Department
Computer Science
College
Engineering
Faculty Advisor
Ludwig, Simone
Description
Particle swarm optimization (PSO) is a heuristic global optimization method, which is based on swarm intelligence. It is inspired by the research on the bird and fish flock movement behavior. The algorithm is widely used and can rapidly be implemented with a few parameters to be tuned. In PSO, individuals, referred to as particles, are “flown” through a hyper-dimensional search space. Changes to the position of particles within the search space are based on the social-psychological tendency of individuals to emulate the success of other individuals. The changes to a particle within the swarm are therefore influenced by the experience, or knowledge, of its neighbors. Many different PSO variants have been proposed in the past. This paper describes a few of these variants that have been implemented, and compares them with standard PSO on a number of benchmark functions measuring both the solution quality and execution time.
Recommended Citation
Daggubati, Satyanarayana, "Comparison of Particle Swarm Optimization Variants" (2012). Computer Science. 293.
https://digitalcommons.ndsu.edu/computer-sci/293
Rights
NDSU Policy 190.6.2
Rights Link
https://www.ndsu.edu/fileadmin/policy/190.pdf
Handle Identifier
https://hdl.handle.net/10365/22285