A Novel Binary Quantum-behaved Particle Swarm Optimization Algorithm
To keep the balance between the global search and local search,a novel binary quantum-behaved particle swarm optimization algorithm with comprehensive learning and cooperative approach(CCBQPSO)is presented.In the proposed algorithm,all the particles personal best position can participate in updating the local attractor firstly.Then all the particles previous personal best position and swarms global best position are performed in each dimension of the solution vector.Five test functions are used to test the performance of CCBQPSO.The results of experiment show that the proposed technique can increase diversity of swarm and converge more rapidly than other binary algorithms.
quantum-behaved particle swarm optimization binary comprehensive cooperative
Jing Zhao Ming Li Zhihong Wang Wenbo Xu
School of Information,Qilu University of Technology,Jinan,China College of Science and Technology,Shandong University of Traditional Chinese Medicine,Jinan,China Shandong Yingcai University,Jinan,China School of Internet of Things Engineering,Jiangnan University,Wuxi,China
国际会议
英国伦敦
英文
119-123
2013-09-02(万方平台首次上网日期,不代表论文的发表时间)