Using quantum-behaved particle swarm optimization algorithm to solve non-linear programming problems

Authors:
Jun Sun;Jing Liu;Wenbo Xu
Affiliations:
Center of Intelligent and High Performance Computing, School of Information Technology, Southern Yangtze University, Wuxi, tJiangsu, P.R. China;Center of Intelligent and High Performance Computing, School of Information Technology, Southern Yangtze University, Wuxi, tJiangsu, P.R. China;Center of Intelligent and High Performance Computing, School of Information Technology, Southern Yangtze University, Wuxi, tJiangsu, P.R. China
Venue:
International Journal of Computer Mathematics - Distributed Algorithms in Science and Engineering
Year:
2007

Citing 5
Cited 3

Adaptation in natural and artificial systems

Adaptation in natural and artificial systems
Comparison between Genetic Algorithms and Particle Swarm Optimization

EP '98 Proceedings of the 7th International Conference on Evolutionary Programming VII
Evolutionary Optimization Versus Particle Swarm Optimization: Philosophy and Performance Differences

EP '98 Proceedings of the 7th International Conference on Evolutionary Programming VII
Evolutionary algorithms for constrained parameter optimization problems

Evolutionary Computation
The particle swarm - explosion, stability, and convergence in amultidimensional complex space

IEEE Transactions on Evolutionary Computation

Multiple sequence alignment using the Hidden Markov Model trained by an improved quantum-behaved particle swarm optimization

Information Sciences: an International Journal
Quantum-behaved particle swarm optimization: Analysis of individual particle behavior and parameter selection

Evolutionary Computation
Tracking Multiple Optima in Dynamic Environments by Quantum-Behavior Particle Swarm Using Speciation

International Journal of Swarm Intelligence Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we focus on solving non-linear programming (NLP) problems using quantum-behaved particle swarm optimization (QPSO). After a brief introduction to the original particle swarm optimization (PSO), we describe the origin and development of QPSO, and the penalty function method for constrained NLP problems. The performance of QPSO is tested on some unconstrained and constrained benchmark functions and compared with PSO with inertia weight (PSO-In) and PSO with constriction factor (PSO-Co). The experimental results show that QPSO outperforms the traditional PSOs and is a promising optimization algorithm.