The Performance Analysis of Particle Swarm Optimization for Solving Continuous Optimization Problem
Nana Li
Abstract
Nana Li
Abstract
Particle swarm algorithm is a stochastic global optimization technique and it is fit for function optimization.The particle swarm algorithm find optimal regions of complex search spaces through the interaction of individuals in a population of particles.In this paper,classical particle swarm optimization algorithm is introduced.Furthermore results of experiments on three benchmark functions are shown and they demonstrate the efficiency of PSO in different ways.
A significance statement is not available in the OpenAlex record.
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 algorithm is a stochastic global optimization technique and it is fit for function optimization.The particle swarm algorithm find optimal regions of complex search spaces through the interaction of individuals in a population of particles.In this paper,classical particle swarm optimization algorithm is introduced.Furthermore results of experiments on three benchmark functions are shown and they demonstrate the efficiency of PSO in different ways.
Key concepts: Multi-swarm optimization, Particle swarm optimization, Benchmark (surveying), Mathematical optimization, Computer science, Metaheuristic, Meta-optimization, Derivative-free optimization