Solving constrained optimization problems with a hybrid particle swarm optimization algorithm

摘要

This article presents a particle swarm optimization algorithm for solving general constrained optimization problems. The proposed approach introduces different methods to update the particle's information, as well as the use of a double population and a special shake mechanism designed to avoid premature convergence. It also incorporates a simple constraint-handling technique. Twenty-four constrained optimization problems commonly adopted in the evolutionary optimization literature, as well as some structural optimization problems are adopted to validate the proposed approach. The results obtained by the proposed approach are compared with respect to those generated by algorithms representative of the state of the art in the area.