This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2009 WRI World Congress on Computer Science and Information Engineering
A Parallel QPSO Algorithm Using Neighborhood Topology Model
Los Angeles, California USA
March 31-April 02
ISBN: 978-0-7695-3507-4
Quantum-behaved Particle Swarm Optimization algorithm (QPSO) is a new variant of Particle Swarm Optimization (PSO). It is also a population-based search strategy, which has good performance on well-known numerical test problems. QPSO is based on the standard PSO and inspired by the theory of quantum physics. In this paper, we explore the parallelism of QPSO and implement the parallel QPSO based on the Neighborhood Topology Model, which is much closer to the nature world. The performance of the parallel QPSO is compared to PSO and QPSO on a set of benchmark functions. The results show that the parallel QPSO outperforms the other two algorithms.
Index Terms:
Quantum-behaved PSO, Neighborhood Topology Model, Parallel Computing
Citation:
Xiaogen Wang, Jun Sun, Wenbo Xu, "A Parallel QPSO Algorithm Using Neighborhood Topology Model," csie, vol. 4, pp.831-835, 2009 WRI World Congress on Computer Science and Information Engineering, 2009
Usage of this product signifies your acceptance of the Terms of Use.