Remember Me
Or use your Academic/Social account:


Or use your Academic/Social account:


You have just completed your registration at OpenAire.

Before you can login to the site, you will need to activate your account. An e-mail will be sent to you with the proper instructions.


Please note that this site is currently undergoing Beta testing.
Any new content you create is not guaranteed to be present to the final version of the site upon release.

Thank you for your patience,
OpenAire Dev Team.

Close This Message


Verify Password:
Verify E-mail:
*All Fields Are Required.
Please Verify You Are Human:
fbtwitterlinkedinvimeoflicker grey 14rssslideshare1
al-Rifaie, Mohammad Majid; Blackwell, Tim M.
Publisher: IGI Global
Languages: English
Types: Article
  • The results below are discovered through our pilot algorithms. Let us know how we are doing!

    • [1] J. Kennedy and R. C. Eberhart, “Particle swarm optimization,” in Proceedings of the IEEE International Conference on Neural Networks, vol. IV. Piscataway, NJ: IEEE Service Center, 1995, pp. 1942-1948.
    • [2] M. Clerc and J. Kennedy, “The particle swarm-explosion, stability, and convergence in a multidimensional complex space,” Evolutionary Computation, IEEE Transactions on, vol. 6, no. 1, pp. 58-73, 2002.
    • [3] I. C. Trelea, “The particle swarm optimization algorithm: convergence analysis and parameter selection,” Information Processing Letters, vol. 85, no. 6, pp. 317-325, 2003.
    • [4] Y. Yang and M. Kamel, “Clustering ensemble using swarm intelligence,” in Swarm Intelligence Symposium, 2003. SIS'03. Proceedings of the 2003 IEEE. IEEE, 2003, pp. 65-71.
    • [5] A. P. Engelbrecht, Fundamentals of Computational Swarm Intelligence. Hoboken, NJ: Wiley, 2005.
    • [6] F. van den Bergh and E. A. P., “A study of particle swarm optimization particle trajectories,” Information Sciences, vol. 176, no. 8, pp. 937-971, 2006.
    • [7] T. Blackwell and D. Bratton, “Origin of bursts,” in GECCO '07: Proceedings of the 2007 GECCO conference companion on Genetic and evolutionary computation. New York, NY, USA: ACM, 2007, pp. 2613-2620.
    • [8] R. Poli, “Mean and variance of the sampling distribution of particle swarm optimizers during stagnation,” Evolutionary Computation, IEEE Transactions on, vol. 13, no. 4, pp. 712-721, 2009.
    • [9] F. Van den Bergh and A. P. Engelbrecht, “A convergence proof for the particle swarm optimiser,” Fundamenta Informaticae, vol. 105, no. 4, pp. 341-374, 2010.
    • [10] J. Kennedy, “Bare bones particle swarms,” in Proceedings of Swarm Intelligence Symposium, 2003 (SIS'03). IEEE, 2003, pp. 80-87.
    • [11] T. Richer and T. Blackwell, “The Lévy particle swarm,” in IEEE congress on evolutionary computation, 2006, pp. 3150-3157.
    • [12] J. Peña, “Theoretical and empirical study of particle swarms with additive stochasticity and different recombination operators,” in Proceedings of the 10th annual conference on Genetic and evolutionary computation, ser. GECCO '08. New York, NY, USA: ACM, 2008, pp. 95-102. [Online]. Available: http://doi.acm.org/10.1145/1389095. 1389109
    • [13] R. A. Krohling, “Gaussian particle swarm with jumps,” in Evolutionary Computation, 2005. The 2005 IEEE Congress on, vol. 2. IEEE, 2005, pp. 1226-1231.
    • [14] T. Blackwell, “A study of collapse in bare bones particle swarm optimisation,” IEEE Transactions on Evolutionary Computing, vol. 16, no. 3, pp. 354-372, 2012.
    • [15] M. M. al-Rifaie and T. Blackwell, “Bare bones particle swarms with jumps,” in ANTS 2012, Lecture Notes in Computer Science series, M. Dorigo and et al., Eds., vol. 7461. Springer, Heidelberg, 2012, pp. 49-60.
    • [16] Y. Shi and R. C. Eberhart, “Empirical study of particle swarm optimization,” in Proceedings of the IEEE International Conference on Evolutionary Computation. Piscataway, NJ: IEEE Press, 1999, pp. 1945-1949.
    • [17] F. V. den Bergh, “An analysis of particle swarm optimizers,” Ph.D. dissertation, University of Pretoria, South Africa, 2002.
    • [18] P. N. Suganthan, N. Hansen, J. J. Liang, K. Deb, Y. P. Chen, A. Auger, and S. Tiwari, “Problem definitions and evaluation criteria for the CEC 2005 special session on real-parameter optimization,” Nanyang Technological University, Singapore and Kanpur Genetic Algorithms Laboratory, IIT Kanpur, Tech. Rep., 2005.
    • [19] S. Helwig, J. Branke, and S. Mostaghim, “Experimental analysis of bound handling techniques in particle swarm optimization,” 2012.
    • [20] M. Clerc, “From theory to practice in particle swarm optimization,” Handbook of Swarm Intelligence, pp. 3-36, 2010.
    • [21] --. (2013) Particle swarm central, http://www.particleswarm.info. [Online]. Available: http://www.particleswarm.info/
    • [22] J. Liang, A. Qin, P. Suganthan, and S. Baskar, “Comprehensive learning particle swarm optimizer for global optimization of multimodal functions,” Evolutionary Computation, IEEE Transactions on, vol. 10, no. 3, pp. 281-295, 2006.
    • [23] J. Liang and P. Suganthan, “Dynamic multi-swarm particle swarm optimizer,” in Swarm Intelligence Symposium, 2005. SIS 2005. Proceedings 2005 IEEE. IEEE, 2005, pp. 124-129.
    • [24] K. Parsopoulos and M. Vrahatis, “Upso: A unified particle swarm optimization scheme,” Lecture Series on Computer and Computational Sciences, vol. 1, pp. 868-873, 2004.
    • [25] --, Particle swarm optimization and intelligence: advances and applications. Information Science Reference Hershey, 2010.
    • [26] R. Mendes, J. Kennedy, and J. Neves, “The fully informed particle swarm: simpler, maybe better,” Evolutionary Computation, IEEE Transactions on, vol. 8, no. 3, pp. 204-210, 2004.
    • [27] M. Epitropakis, V. Plagianakos, and M. Vrahatis, “Evolving cognitive and social experience in particle swarm optimization through differential evolution: A hybrid approach,” Information Sciences, 2012.
  • No related research data.
  • No similar publications.

Share - Bookmark

Cite this article