An New Vector Particle Swarm Optimization for Constrained Optimization Problems

摘要：

A new vector Particle Swarm Optimization (NVPSO) is proposed to solve constrained optimization problems in this paper. In NVPSO, we introduce a shrinkage coefficient to ensure that all dimensions of a particle are within lower and upper bounds, and a new function φ(x) to determine whetherthe particle is within the feasible region. One-dimensional search optimization methods are selected in NVPSO algorithm to produce a new position which is guaranteed to be in the feasible region for the particle which escapes from the feasible region. The whole process is dealt as vector mode. The experimental results show that the principle of NVPSO this paper proposed is simple, relatively effective and efficient.

作者: Chao-li Sun Jian-chao Zeng Jeng-shyang Pan

作者单位: Division of System Simulation and Computer Application, Taiyuan University of Science & Technology, Department of Electronic Engineering, National Kaohsiung University of Applied Sciences, Kaohsiung,

会议类型: 国际会议

会议名称: The Second International Joint Conference on Computational Science and Optimization(CSO 2009)(2009 国际计算科学与优化会议)

会议地点: 三亚

会议语种:英文

页码: 485-488

在线出版日期: 2009-04-24（万方平台首次上网日期，不代表论文的发表时间）