Swarm intelligence
Particle Evolutionary Swarm Optimization Algorithm (PESO)
ENC '05 Proceedings of the Sixth Mexican International Conference on Computer Science
An effective co-evolutionary particle swarm optimization for constrained engineering design problems
Engineering Applications of Artificial Intelligence
Evolutionary algorithms, homomorphous mappings, and constrained parameter optimization
Evolutionary Computation
Evolutionary algorithms for constrained parameter optimization problems
Evolutionary Computation
Self-adaptive velocity particle swarm optimization for solving constrained optimization problems
Journal of Global Optimization
Expert Systems with Applications: An International Journal
An Efficient Evolutionary Programming
ISISE '08 Proceedings of the 2008 International Symposium on Information Science and Engieering - Volume 02
GSA: A Gravitational Search Algorithm
Information Sciences: an International Journal
A New Vector Particle Swarm Optimization for Constrained Optimization Problems
CSO '09 Proceedings of the 2009 International Joint Conference on Computational Sciences and Optimization - Volume 01
A new method for constrained optimization problems to produce initial values
CCDC'09 Proceedings of the 21st annual international conference on Chinese control and decision conference
A new heuristic approach for non-convex optimization problems
Information Sciences: an International Journal
Stochastic ranking for constrained evolutionary optimization
IEEE Transactions on Evolutionary Computation
Information Sciences: an International Journal
Information Sciences: an International Journal
Ockham's Razor in memetic computing: Three stage optimal memetic exploration
Information Sciences: an International Journal
International Journal of Bio-Inspired Computation
A new fitness estimation strategy for particle swarm optimization
Information Sciences: an International Journal
An improved (µ+λ)-constrained differential evolution for constrained optimization
Information Sciences: an International Journal
Diversity enhanced particle swarm optimization with neighborhood search
Information Sciences: an International Journal
Compact Particle Swarm Optimization
Information Sciences: an International Journal
A novel selection evolutionary strategy for constrained optimization
Information Sciences: an International Journal
Integrating the artificial bee colony and bees algorithm to face constrained optimization problems
Information Sciences: an International Journal
Information Sciences: an International Journal
Hi-index | 0.07 |
Increasing attention is being paid to solve constrained optimization problems (COP) frequently encountered in real-world applications. In this paper, an improved vector particle swarm optimization (IVPSO) algorithm is proposed to solve COPs. The constraint-handling technique is based on the simple constraint-preserving method. Velocity and position of each particle, as well as the corresponding changes, are all expressed as vectors in order to present the optimization procedure in a more intuitively comprehensible manner. The NVPSO algorithm [30], which uses one-dimensional search approaches to find a new feasible position on the flying trajectory of the particle when it escapes from the feasible region, has been proposed to solve COP. Experimental results showed that searching only on the flying trajectory for a feasible position influenced the diversity of the swarm and thus reduced the global search capability of the NVPSO algorithm. In order to avoid neglecting any worthy position in the feasible region and improve the optimization efficiency, a multi-dimensional search algorithm is proposed to search within a local region for a new feasible position. The local region is composed of all dimensions of the escaped particle's parent and the current positions. Obviously, the flying trajectory of the particle is also included in this local region. The new position is not only present in the feasible region but also has a better fitness value in this local region. The performance of IVPSO is tested on 13 well-known benchmark functions. Experimental results prove that the proposed IVPSO algorithm is simple, competitive and stable.