A New Vector Particle Swarm Optimization for Constrained Optimization Problems

Authors:
Chao-li Sun;Jian-chao Zeng;Jeng-Shyang Pan
Affiliations:
-;-;-
Venue:
CSO '09 Proceedings of the 2009 International Joint Conference on Computational Sciences and Optimization - Volume 01
Year:
2009

Citing 0
Cited 4

An improved vector particle swarm optimization for constrained optimization problems

Information Sciences: an International Journal
Constrained structural design optimization via a parallel augmented Lagrangian particle swarm optimization approach

Computers and Structures
Particle swarm optimisation with stochastic ranking for constrained numerical and engineering benchmark problems

International Journal of Bio-Inspired Computation
A new fitness estimation strategy for particle swarm optimization

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 to determine whether the 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.