Table of Contents Author Guidelines Submit a Manuscript
The Scientific World Journal
Volume 2013 (2013), Article ID 409167, 8 pages
http://dx.doi.org/10.1155/2013/409167
Research Article

A New Logistic Dynamic Particle Swarm Optimization Algorithm Based on Random Topology

1School of Computer Science and Engineering, Southeast University, Nanjing 211189, China
2Provincial Key Laboratory for Computer Information Processing Technology, Soochow University, Suzhou 215006, China

Received 17 April 2013; Accepted 19 May 2013

Academic Editors: P. Agarwal, S. Balochian, and V. Bhatnagar

Copyright © 2013 Qingjian Ni and Jianming Deng. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. M. R. AlRashidi and M. E. El-Hawary, “A survey of particle swarm optimization applications in electric power systems,” IEEE Transactions on Evolutionary Computation, vol. 13, no. 4, pp. 913–918, 2009. View at Publisher · View at Google Scholar · View at Scopus
  2. A. A. Esmin, R. A. Coelho, and S. Matwin, “A review on particle swarm optimization algorithm and its variants to clustering highdimensional data,” Artificial Intelligence Review, 2013. View at Publisher · View at Google Scholar
  3. R. V. Kulkarni and G. K. Venayagamoorthy, “Particle swarm optimization in wireless-sensor networks: a brief survey,” IEEE Transactions on Systems, Man and Cybernetics C, vol. 41, no. 2, pp. 262–267, 2011. View at Publisher · View at Google Scholar · View at Scopus
  4. J. Kennedy and R. Eberhart, “Particle swarm optimization,” in Proceedings of the IEEE International Conference on Neural Networks, vol. 4, pp. 1942–1948, December 1995. View at Scopus
  5. J. Kennedy, “Small worlds and mega-minds: effects of neighborhood topology on particle swarm performance,” in Proceedings of the Congress on Evolutionary Computation (CEC '99), vol. 3, IEEE, 1999.
  6. P. N. Suganthan, “Particle swarm optimiser with neighbourhood operator,” in Proceedings of the Congress on Evolutionary Computation (CEC '99), vol. 3, IEEE, 1999.
  7. R. Mendes, J. Kennedy, and J. Neves, “The fully informed particle swarm: simpler, maybe better,” IEEE Transactions on Evolutionary Computation, vol. 8, no. 3, pp. 204–210, 2004. View at Publisher · View at Google Scholar · View at Scopus
  8. M. A. M. de Oca and T. Stützle, “Convergence behavior of the fully informed particle swarm optimization algorithm,” in Proceedings of the 10th Annual Genetic and Evolutionary Computation Conference (GECCO '08), pp. 71–78, ACM, July 2008. View at Scopus
  9. R. Mendes, Population topologies and their influence in particle swarm performance [Ph.D. dissertation], Universidade do Minho, 2004.
  10. M. Clerc, “Back to random topology,” Tech. Rep. 2007, 2007. View at Google Scholar
  11. M. Clerc and J. Kennedy, “The particle swarm-explosion, stability, and convergence in a multidimensional complex space,” IEEE Transactions on Evolutionary Computation, vol. 6, no. 1, pp. 58–73, 2002. View at Publisher · View at Google Scholar · View at Scopus
  12. J. Kennedy, “Dynamic-probabilistic particle swarms,” in Proceedings of the Conference on Genetic and Evolutionary Computation Conference, pp. 201–207, ACM, June 2005. View at Publisher · View at Google Scholar · View at Scopus
  13. Q. Ni and J. Deng, “Two improvement strategies for logistic dynamic particle swarm optimization,” in Adaptive and Natural Computing Algorithms, pp. 320–329, Springer, 2011. View at Publisher · View at Google Scholar · View at Scopus