A New Logistic Dynamic Particle Swarm Optimization Algorithm Based on Random Topology
暂无分享,去创建一个
[1] José Neves,et al. The fully informed particle swarm: simpler, maybe better , 2004, IEEE Transactions on Evolutionary Computation.
[2] P. Suganthan. Particle swarm optimiser with neighbourhood operator , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).
[3] James Kennedy,et al. Small worlds and mega-minds: effects of neighborhood topology on particle swarm performance , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).
[4] Jianming Deng,et al. Two Improvement Strategies for Logistic Dynamic Particle Swarm Optimization , 2011, ICANNGA.
[5] Maurice Clerc,et al. The particle swarm - explosion, stability, and convergence in a multidimensional complex space , 2002, IEEE Trans. Evol. Comput..
[6] James Kennedy,et al. Dynamic-probabilistic particle swarms , 2005, GECCO '05.
[7] Thomas Stützle,et al. Convergence behavior of the fully informed particle swarm optimization algorithm , 2008, GECCO '08.
[8] Ganesh K. Venayagamoorthy,et al. Particle Swarm Optimization in Wireless-Sensor Networks: A Brief Survey , 2011, IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews).
[9] Stan Matwin,et al. A review on particle swarm optimization algorithm and its variants to clustering high-dimensional data , 2013, Artificial Intelligence Review.
[10] Riccardo Poli,et al. Particle swarm optimization , 1995, Swarm Intelligence.
[11] Mohamed E. El-Hawary,et al. A Survey of Particle Swarm Optimization Applications in Electric Power Systems , 2009, IEEE Transactions on Evolutionary Computation.
[12] Maurice Clerc,et al. Back to random topology , 2007 .