Solving Constrained Optimization Problems by the ε Constrained Particle Swarm Optimizer with Adaptive Velocity Limit Control

The epsiv constrained method is an algorithm transformation method, which can convert algorithms for unconstrained problems to algorithms for constrained problems using the epsiv level comparison that compares the search points based on the constraint violation of them. We proposed the epsiv constrained particle swarm optimizer epsivPSO, which is the combination of the epsiv constrained method and particle swarm optimization. In the epsivPSO, the agents who satisfy the constraints move to optimize the objective function and the agents who don´t satisfy the constraints move to satisfy the constraints. But sometimes the velocity of agents becomes too big and they fly away from feasible region. In this study, to solve this problem, we propose to divide agents into some groups and control the maximum velocity of agents adaptively by comparing the movement of agents in each group. The effectiveness of the improved epsivPSO is shown by comparing it with various methods on well known nonlinear constrained problems