Output details

Convergence analysis and improvements of quantum-behaved particle swarm optimization

<24> This is the first and only paper yet to present a convergence analysis of the QPSO algorithm, where we investigate in detail the convergence of the QPSO on a probabilistic metric space, and prove that QPSO can converge to global optimum. The work was funded by National-NSF China projects 61170119, 60973094, a one-year academic visit grant to Oxford University, and several local projects in China. The improved QPSO and later variants have led to new projects funded by NSFC, one Royal Society-NSFC grant (IE121718/2013-2015) and exploring industrial applications (e.g., power dispatch, see subsequent publication in IEEE Trans. Ind. Informatics, http://ieeexplore.ieee.org/xpl/articleDetails.jsp?tp=&arnumber=6527973&queryText%3Dpalade+sun).