Quantum-Behaved particle swarm optimization for integer programming

Authors:
Jing Liu;Jun Sun;Wenbo Xu
Affiliations:
Center of Intelligent and High Performance Computing, School of Information Technology, Southern Yangtze University, Jiangsu, China;Center of Intelligent and High Performance Computing, School of Information Technology, Southern Yangtze University, Jiangsu, China;Center of Intelligent and High Performance Computing, School of Information Technology, Southern Yangtze University, Jiangsu, China
Venue:
ICONIP'06 Proceedings of the 13th international conference on Neural Information Processing - Volume Part II
Year:
2006

Citing 4
Cited 2

Swarm intelligence

Swarm intelligence
Recent approaches to global optimization problems through Particle Swarm Optimization

Natural Computing: an international journal
An Evolutionary Algorithm for Integer Programming

PPSN III Proceedings of the International Conference on Evolutionary Computation. The Third Conference on Parallel Problem Solving from Nature: Parallel Problem Solving from Nature
The particle swarm - explosion, stability, and convergence in amultidimensional complex space

IEEE Transactions on Evolutionary Computation

Synchronous parallelization of Particle Swarm Optimization with digital pheromones

Advances in Engineering Software
Solving Integer Programming Problems by Using Artificial Bee Colony Algorithm

AI*IA '09: Proceedings of the XIth International Conference of the Italian Association for Artificial Intelligence Reggio Emilia on Emergent Perspectives in Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

Based on our previously proposed Quantum-behaved Particle Swarm Optimization (QPSO), this paper discusses the applicability of QPSO to integer programming. QPSO is a global convergent search method, while the original Particle Swarm (PSO) cannot be guaranteed to find out the optima solution of the problem at hand. The application of QPSO to integer programming is the first attempt of the new algorithm to discrete optimization problem. After introduction of PSO and detailed description of QPSO, we propose a method of using QPSO to solve integer programming. Some benchmark problems are employed to test QPSO as well as PSO for performance comparison. The experiment results show the superiority of QPSO to PSO on the problems.