College of Mathematic and Information, China West Normal University, Nanchong 637009, China

---

Abstract—The standard particle swarm optimization (PSO) algorithm converges very fast, while it is very easy to fall into the local extreme point. According to waiting effect among particles with mean-optimal position(MP), the quantum-behaved particle swarm optimization (QPSO) algorithm can prevent the particle from falling into local extreme point prematurely, but its convergence speed and convergence precision are both low. In order to further improve the precision of QPSO algorithm, the evaluation method of  trap characteristic length L(t) of wave function for describing the particle’s state is modified. In QPSO, a random weight to each particle in swarm is introduced, and according to the order of each particle’s best position fitting value, there are three evaluation programs for L(t), which are random-weight mean-optimal position(RMP), reverseorder random-weight mean-optimal position(RRMP) and same-order random-weight mean-optimal position(SRMP). Through the test of several typical functions, its result shows that the convergence accuracy of QPSO with RMP and RRMP is better than those of QPSO with MP, so the evaluation of L(t) with RMP and RRMP is feasible and effective.

Index Terms—Random weight, Random-weight meanoptimal position, Particle swarm optimization, Quantumbehaved particle swarm optimization.

[PDF]

Cite: Dazhi Pan, Ying Ci, Min He, Hongying He, "An Improved Quantum-behaved Particle Swarm Optimization Algorithm Based on Random Weight," Journal of Software vol. 8, no. 6, pp. 1327-1332, 2013.