A New particle swarm algorithm for solving constrained optimization problems

Considering that the particle swarm optimization (PSO) algorithm has a tendency to get stuck at the local solutions, an improved PSO algorithm is proposed in this paper to solve constrained optimization problems. In this algorithm, the initial particle population is generated using good point set method such that the initial particles are uniformly distributed in the optimization domain. Then, during the optimization process, the particle population is divided into two sub-populations including feasible sub-population and infeasible sub-population. Finally, different crossover operations and mutation operations are applied for updating the particles in each of the two sub-populations. The effectiveness of the improved PSO algorithm is demonstrated three benchmark functions.