Constrained optimization via particle evolutionary swarm optimization algorithm (PESO)
Author(s) -
Ángel E. Muñoz Zavala,
Arturo Hernández Aguirre,
Enrique R. Villa Diharce
Publication year - 2005
Publication title -
citeseer x (the pennsylvania state university)
Language(s) - English
Resource type - Conference proceedings
ISBN - 1-59593-010-8
DOI - 10.1145/1068009.1068041
Subject(s) - mathematical optimization , multi swarm optimization , particle swarm optimization , imperialist competitive algorithm , benchmark (surveying) , evolutionary algorithm , premature convergence , perturbation (astronomy) , computer science , metaheuristic , optimization problem , convergence (economics) , evolutionary computation , meta optimization , algorithm , mathematics , physics , geodesy , quantum mechanics , economic growth , economics , geography
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.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom