Hybrid PSO Algorithm with Iterated Local Search Operator for Equality Constraints Problems

Abstract

This paper presents a hybrid PSO algorithm (Par-ticle Swarm Optimization) with an ILS (Iterated Local Search) operator for handling equality constraints problems in mono-objective optimization problems. The ILS can be used to locally search around the best solutions in some generations, exploring the attraction basins in small portions of the feasible set. This process can compensate the difficulty of the evolutionary algorithm to generate good solutions in zero-volume regions. The greatest advantage of the operator is the simple implementation. Experiments performed on benchmark problems shows improvement in accuracy, reducing the gap for the tested problems.