Particle Swarm Optimization Algorithm and Comparison with Genetic Algorithm
Tianxiang Gu
Abstract
Tianxiang Gu
Abstract
Particle swarm optimization, rooting from simulation of swarm of bird, solves optimization problem. Firstly, discusses particle swarm optimization algorithm principle and step of implementation, and then analyzes each of parameter. Particle swarm optimization algorithm compares with genetic algorithm through the same mathematic function. The comparative result indicates that Particle swarm optimization algorithm can obtain the optimum solutions more easily than genetic algorithm and it is a good optimization method with strong competition.
OpenAlex reports 12 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Particle swarm optimization, rooting from simulation of swarm of bird, solves optimization problem. Firstly, discusses particle swarm optimization algorithm principle and step of implementation, and then analyzes each of parameter. Particle swarm optimization algorithm compares with genetic algorithm through the same mathematic function. The comparative result indicates that Particle swarm optimization algorithm can obtain the optimum solutions more easily than genetic algorithm and it is a good optimization method with strong competition.
Key concepts: Meta-optimization, Multi-swarm optimization, Particle swarm optimization, Imperialist competitive algorithm, Metaheuristic, Derivative-free optimization, Algorithm, Mathematical optimization