A Framework for Constrained Optimization Problems Based on a Modified Particle Swarm Optimization

Abstract EN

This paper develops a particle swarm optimization (PSO) based framework for constrained optimization problems (COPs).

Aiming at enhancing the performance of PSO, a modified PSO algorithm, named SASPSO 2011, is proposed by adding a newly developed self-adaptive strategy to the standard particle swarm optimization 2011 (SPSO 2011) algorithm.

Since the convergence of PSO is of great importance and significantly influences the performance of PSO, this paper first theoretically investigates the convergence of SASPSO 2011.

Then, a parameter selection principle guaranteeing the convergence of SASPSO 2011 is provided.

Subsequently, a SASPSO 2011-based framework is established to solve COPs.

Attempting to increase the diversity of solutions and decrease optimization difficulties, the adaptive relaxation method, which is combined with the feasibility-based rule, is applied to handle constraints of COPs and evaluate candidate solutions in the developed framework.

Finally, the proposed method is verified through 4 benchmark test functions and 2 real-world engineering problems against six PSO variants and some well-known methods proposed in the literature.

Simulation results confirm that the proposed method is highly competitive in terms of the solution quality and can be considered as a vital alternative to solve COPs.