Article Preview
Top1. Introduction
Particle Swarm Optimization(PSO) is a colony optimization algorithm which was proposed by Kennedy, who was inspired by the foraging behavior of birds (Kennedy & Eberhart, 1995). Because the method is simple in PSO algorithm, it has fast convergence, PSO algorithm has been widely used; but the algorithm itself is concerned, PSO is not a global optimization algorithm (Van den Bergh, 2001), many scholars have proposed many improved methods, some improvement effects have made (Zheng, Ma & Zhang, 2003; Clerc, 2004). Sun et al. had studied the intelligent population evolution in-depth based on the analysis of particle swarm optimization algorithm, quantum theory was introduced into a PSO algorithm, quantum-behaved particle swarm optimization algorithm was proposed with a global search capability (Quantum-behaved Particle Swarm Optimization, QPSO) (Sun, Feng & Xu, 2004; Sun, Xu & Feng, 2004). Since the proposed PSO algorithm, it has the simple calculation program, and it is easy to implement, and there are less control parameters, etc., it caused research and attention of many scholars in related fields at home and abroad (Goh, Tan, Liu et al., 2010; Omranpour, Ebadzadeh, Shirt et al., 2012), but also it has been applied to some practical problems (Chen, Sun & Ding, 2008; Chai, Sun, Cai et al., 2009; Omkar, Khandelwal, Ananth et al., 2009). QPSO algorithm has only parameter (contraction expansion factor), Sun et al., used a fixed parameter control strategy (Sun & Wu, 2012; Sun, Fang, Wu et al., 2012), later Fang proposed increases evolutionary numbers, the linear or nonlinear decreasing parameter control method were used, the simulation results showed that good improvement effect are achieved in most of the test functions (Fang, 2008). For particle contribution differences in QPSO algorithm, Xi et al. proposed weighting coefficient control algorithm and search process improvement methods, but also it achieved some results (Xi, Sun, & Xu, 2008).