Self-adaptive velocity particle swarm optimization for solving constrained optimization problems

  • Authors:

  • Haiyan Lu;Weiqi Chen

  • Affiliations:

  • School of Science, Jiangnan University, Wuxi, P.R. China 214122 and Department of Mathematics, Zhejiang University, Hangzhou, P.R. China 310027;School of Information Technology, Jiangnan University, Wuxi, P.R. China 214122 and China Ship Scientific Research Center, Wuxi, P.R. China 214082

  • Venue:
  • Journal of Global Optimization
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

Particle swarm optimization (PSO) is originally developed as an unconstrained optimization technique, therefore lacks an explicit mechanism for handling constraints. When solving constrained optimization problems (COPs) with PSO, the existing research mainly focuses on how to handle constraints, and the impact of constraints on the inherent search mechanism of PSO has been scarcely explored. Motivated by this fact, in this paper we mainly investigate how to utilize the impact of constraints (or the knowledge about the feasible region) to improve the optimization ability of the particles. Based on these investigations, we present a modified PSO, called self-adaptive velocity particle swarm optimization (SAVPSO), for solving COPs. To handle constraints, in SAVPSO we adopt our recently proposed dynamic-objective constraint-handling method (DOCHM), which is essentially a constituent part of the inherent search mechanism of the integrated SAVPSO, i.e., DOCHM + SAVPSO. The performance of the integrated SAVPSO is tested on a well-known benchmark suite and the experimental results show that appropriately utilizing the knowledge about the feasible region can substantially improve the performance of the underlying algorithm in solving COPs.