Show simple item record

dc.contributor.authorMattaparthi, Sowjanya
dc.description.abstractSince the introduction of Particle Swarm optimization by Dr. Eberhart and Dr. Kennedy, there have been many variations of the algorithm proposed by many researchers and various applications presented using the algorithm. In this paper, we applied variants of Particle swarm optimization on various benchmark functions in multiple dimensions, using the computational procedure to find the optimal solutions for those functions. We ran the variants of the algorithm 51 times on each of the 17-benchmark functions and computed the average, variance and standard deviation for 10, 30, and 50 dimensions. Using the results, we found the suitable variants of the algorithm for the benchmark functions by considering the minimum optimal solution produced by each variant.en_US
dc.publisherNorth Dakota State Universityen_US
dc.rightsNDSU Policy 190.6.2
dc.titleParticle Swarm Optimization Algorithm: Variants and Comparisonsen_US
dc.typeMaster's paperen_US
dc.date.accessioned2015-11-24T01:21:55Z
dc.date.available2015-11-24T01:21:55Z
dc.date.issued2015
dc.identifier.urihttp://hdl.handle.net/10365/25404
dc.subject.lcshSwarm intelligence.en_US
dc.subject.lcshMathematical optimization.en_US
dc.subject.lcshProblem solving.en_US
dc.subject.lcshAlgorithms.en_US
dc.rights.urihttps://www.ndsu.edu/fileadmin/policy/190.pdf
ndsu.degreeMaster of Science (MS)en_US
ndsu.collegeEngineeringen_US
ndsu.departmentComputer Scienceen_US
ndsu.programComputer Scienceen_US
ndsu.advisorLudwig, Simone


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record