2006Jisuanji gongchengRequires access

Stochastic Particle Swarm Optimization Algorithm

Qidi Wu

Open publisher page 2 citations

Abstract

Particle swarm optimization(PSO) is a new heuristic global optimization algorithm based on swarm intelligence after ant colony algorithm.The algorithm is simple,easy to implement and has good performance of optimization.Now it has been applied in many fields.However,when optimizing multidimensional and multimodal functions,the basic particle swarm optimization is apt to be trapped in local optima.This paper proposes a modified optimization method——stochastic particle swarm optimization(SPSO),which combines the standard version with simulated annealing algorithm.This modified version has stronger exploitation ability at the beginning,so it can keep particle swarm from getting into local optima too early.Simulation results on benchmark complex functions with high dimension show that this hybrid algorithm performs better than the basic particle swarm optimization.

About this research paper

What this paper is about

Particle swarm optimization(PSO) is a new heuristic global optimization algorithm based on swarm intelligence after ant colony algorithm.The algorithm is simple,easy to implement and has good performance of optimization.Now it has been applied in many fields.However,when optimizing multidimensional and multimodal functions,the basic particle swarm optimization is apt to be trapped in local optima.This paper proposes a modified optimization method——stochastic particle swarm optimization(SPSO),which combines the standard version with simulated annealing algorithm.This modified version has stronger exploitation ability at the beginning,so it can keep particle swarm from getting into local optima too early.Simulation results on benchmark complex functions with high dimension show that this hybrid algorithm performs better than the basic particle swarm optimization.

Why it matters

OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Particle swarm optimization(PSO) is a new heuristic global optimization algorithm based on swarm intelligence after ant colony algorithm.The algorithm is simple,easy to implement and has good performance of optimization.Now it has been applied in many fields.However,when optimizing multidimensional and multimodal functions,the basic particle swarm optimization is apt to be trapped in local optima.This paper proposes a modified optimization method——stochastic particle swarm optimization(SPSO),which combines the standard version with simulated annealing algorithm.This modified version has stronger exploitation ability at the beginning,so it can keep particle swarm from getting into local optima too early.Simulation results on benchmark complex functions with high dimension show that this hybrid algorithm performs better than the basic particle swarm optimization.

Key concepts: Multi-swarm optimization, Metaheuristic, Particle swarm optimization, Meta-optimization, Simulated annealing, Parallel metaheuristic, Computer science, Mathematical optimization

Related papers

Back to paper searchBrowse research topicsOriginal source
Stochastic Particle Swarm Optimization Algorithm — Research Paper | ScholarLens