JOURNAL ARTICLE

Particle Evolutionary Swarm Optimization Algorithm (PESO)

Abstract

We introduce the PESO (particle evolutionary swarm optimization) algorithm for solving single objective constrained optimization problems. PESO algorithm proposes two new perturbation operators: "c-perturbation" and "m-perturbation". The goal of these operators is to fight premature convergence and poor diversity issues observed in particle swarm optimization (PSO) implementations. Constraint handling is based on simple feasibility rules. PESO is compared with respect to a highly competitive technique representative of the state-of-the-art in the area using a well-known benchmark for evolutionary constrained optimization. PESO matches most results and outperforms other PSO algorithms.

Keywords:
Particle swarm optimization Mathematical optimization Multi-swarm optimization Premature convergence Evolutionary algorithm Benchmark (surveying) Imperialist competitive algorithm Perturbation (astronomy) Computer science Metaheuristic Convergence (economics) Evolutionary computation Optimization problem Algorithm Implementation Mathematics

Metrics

16
Cited By
1.18
FWCI (Field Weighted Citation Impact)
14
Refs
0.83
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Citation History

Topics

Metaheuristic Optimization Algorithms Research
Physical Sciences →  Computer Science →  Artificial Intelligence
Advanced Multi-Objective Optimization Algorithms
Physical Sciences →  Computer Science →  Computational Theory and Mathematics
Evolutionary Algorithms and Applications
Physical Sciences →  Computer Science →  Artificial Intelligence
© 2026 ScienceGate Book Chapters — All rights reserved.