Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2013, Article ID 409606, 10 pages
http://dx.doi.org/10.1155/2013/409606
Research Article

Convergence Analysis of a Class of Computational Intelligence Approaches

1College of IOT Engineering, Hohai University, Changzhou 213022, China
2Jiangsu Key Laboratory of Power Transmission and Distribution Equipment Technology, Changzhou 213022, China
3Changzhou Key Laboratory of Sensor Networks and Environmental Sensing, Changzhou 213022, China

Received 11 January 2013; Revised 25 March 2013; Accepted 13 April 2013

Academic Editor: Yang Tang

Copyright © 2013 Junfeng Chen et al. 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. L. Bianchi, M. Dorigo, L. M. Gambardella, and W. J. Gutjahr, “A survey on metaheuristics for stochastic combinatorial optimization,” Natural Computing, vol. 8, no. 2, pp. 239–287, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  2. D. E. Goldberg, Genetic Algorithms in Search Optimization and Machine Learning, Addison-Wesley Publishing, New York, NY, USA, 1989.
  3. R. Storn and K. V. Price, “Differential evolution—a simple and efficient heuristic for global optimization over continuous spaces,” Journal of Global Optimization, vol. 11, no. 4, pp. 341–359, 1997. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  4. S. Das and P. N. Suganthan, “Differential evolution: a survey of the state-of-the-art,” IEEE Transactions on Evolutionary Computation, vol. 15, no. 1, pp. 4–31, 2011. View at Google Scholar
  5. M. Dorigo, Optimization, learning and natural algorithms [Ph.D. thesis], Politecnico di Milano, Milan, Italy, 1992.
  6. R. C. Eberhart and J. Kennedy, “A new optimizer using particle swarm theory,” in Proceedings of the 6th International Symposium on Micromachine and Human Science (MHS '95), Nagoya, Japan, 1995.
  7. C. Blum and A. Roli, “Metaheuristics in combinatorial optimization: overview and conceptual comparison,” ACM Computing Surveys, vol. 35, no. 3, pp. 268–308, 2003. View at Publisher · View at Google Scholar · View at Scopus
  8. W. Deng, R. Chen, B. He et al., “A novel two-stage hybrid swarm intelligence optimization algorithm and application,” Soft Computing, vol. 16, no. 10, pp. 1707–1722, 2012. View at Google Scholar
  9. Y.-T. Kao and E. Zahara, “A hybrid genetic algorithm and particle swarm optimization for multimodal functions,” Applied Soft Computing Journal, vol. 8, no. 2, pp. 849–857, 2008. View at Publisher · View at Google Scholar · View at Scopus
  10. G. Rudolph, “Convergence analysis of canonical genetic algorithms,” IEEE Transactions on Neural Networks, vol. 5, no. 1, pp. 96–101, 1994. View at Publisher · View at Google Scholar · View at Scopus
  11. Z. B. Xu, Z. K. Nie, and W. X. Zhang, “Almost sure strong convergence of a class of genetic algorithms with parent-offspring competition,” Acta Mathematicae Applicatae Sinica, vol. 25, no. 1, pp. 167–175, 2002. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  12. R. Rastegar, “On the optimal convergence probability of univariate estimation of distribution algorithms,” Evolutionary Computation, vol. 19, no. 2, pp. 225–248, 2011. View at Publisher · View at Google Scholar · View at Scopus
  13. W. J. Gütjahr, “A graph-based ant system and its convergence,” Future Generation Computer Systems, vol. 16, no. 9, pp. 873–888, 2000. View at Google Scholar
  14. W. J. Gutjahr, “ACO algorithms with guaranteed convergence to the optimal solution,” Information Processing Letters, vol. 82, no. 3, pp. 145–153, 2002. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  15. T. Stützle and M. Dorigo, “A short convergence proof for a class of ant colony optimization algorithms,” IEEE Transactions on Evolutionary Computation, vol. 6, no. 4, pp. 358–365, 2002. View at Publisher · View at Google Scholar · View at Scopus
  16. A. Badr and A. Fahmy, “A proof of convergence of ant algorithms,” Information Sciences, vol. 160, no. 1–4, pp. 267–279, 2004. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  17. H. Duan, D. Wang, and X. F. Yu, “Markov chains and martingale theory based convergence proof of ant colony algorithm and its simulation platform,” in Proceedings of the 6th World Congress on Intelligent Control and Automation (WCICA '06), pp. 3057–3061, Dalian, China, June 2006. View at Publisher · View at Google Scholar · View at Scopus
  18. 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
  19. I. C. Trelea, “The particle swarm optimization algorithm: convergence analysis and parameter selection,” Information Processing Letters, vol. 85, no. 6, pp. 317–325, 2003. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  20. F. van den Bergh and A. P. Engelbrecht, “A study of particle swarm optimization particle trajectories,” Information Sciences, vol. 176, no. 8, pp. 937–971, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  21. R. Poli, “Dynamics and stability of the sampling distribution of particle swarm optimisers via moment analysis,” Journal of Artificial Evolution and Applications, vol. 2008, Article ID 761459, 10 pages, 2008. View at Publisher · View at Google Scholar
  22. H. B. Liu, A. Abraham, and V. Snasel, “Convergence analysis of swarm algorithm,” in Proceedings of the World Congress on Nature & Biologically Inspired Computing (NaBIC '09), pp. 1714–1719, Coimbatore, India, 2009.
  23. Y.-P. Chen and P. Jiang, “Analysis of particle interaction in particle swarm optimization,” Theoretical Computer Science, vol. 411, no. 21, pp. 2101–2115, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  24. W. X. Zhang and Y. Liang, Mathematical Foundation of Genetic Algorithms, Xi’an Jiaotong University Press, Xi’an, China, 2003.
  25. R. M. Dudley, Real Analysis and Probability, Cambridge University Press, Cambridge, UK, 1992.
  26. Y. L. Ling, Applied Stochastic Processes, Tsinghua University Press, Beijing, China, 2002.