JOURNAL ARTICLE

An Improved Particle Swarm Optimization for Continuous Problems

Abstract

This paper describes an improved particle swarm optimization (PSO) algorithm that combines stochastic local search (SLS) heuristics,named PSOSLS, to solve costly procedure of search and premature convergence for continuous function optimization problems. The SLS is embedded in the PSO to improve the proposed heuristics. During the global search process, our algorithm can enhance the local search ability of particle swarm optimization thought adding random perturbation to local search. Some optimization tests on many different benchmark optimization problems show that PSOSLS can search for global optima in difficult multimodal optimization problems and reach better solutions than original PSO algorithm.

Keywords:
Multi-swarm optimization Mathematical optimization Particle swarm optimization Metaheuristic Local optimum Computer science Premature convergence Benchmark (surveying) Local search (optimization) Heuristics Derivative-free optimization Meta-optimization Continuous optimization Simulated annealing Imperialist competitive algorithm Optimization problem Convergence (economics) Mathematics

Metrics

1
Cited By
0.00
FWCI (Field Weighted Citation Impact)
15
Refs
0.12
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Citation History

Topics

Metaheuristic Optimization Algorithms Research
Physical Sciences →  Computer Science →  Artificial Intelligence
Evolutionary Algorithms and Applications
Physical Sciences →  Computer Science →  Artificial Intelligence
Advanced Multi-Objective Optimization Algorithms
Physical Sciences →  Computer Science →  Computational Theory and Mathematics

Related Documents

© 2026 ScienceGate Book Chapters — All rights reserved.