Comparison of Particle Swarm Optimization Variants

dc.contributor.authorDaggubati, Satyanarayana
dc.date.accessioned2012-11-28T21:50:30Z
dc.date.available2012-11-28T21:50:30Z
dc.date.issued2012
dc.description.abstractParticle 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.en_US
dc.identifier.urihttps://hdl.handle.net/10365/22285
dc.publisherNorth Dakota State Universityen_US
dc.rightsNDSU Policy 190.6.2
dc.rights.urihttps://www.ndsu.edu/fileadmin/policy/190.pdf
dc.subject.lcshSwarm intelligence.en_US
dc.subject.lcshMathematical optimization.en_US
dc.titleComparison of Particle Swarm Optimization Variantsen_US
dc.typeMaster's paperen_US
ndsu.advisorLudwig, Simone
ndsu.advisorNygard, Kendall
ndsu.collegeEngineeringen_US
ndsu.degreeMaster of Science (MS)en_US
ndsu.departmentComputer Scienceen_US
ndsu.programComputer Scienceen_US

Files

Original bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
Satyanarayana Daggubati.pdf
Size:
636.8 KB
Format:
Adobe Portable Document Format
Description:
Satyanarayana Daggubati

License bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed to upon submission
Description: