Simplified forms of the particle swarm algorithm are very beneficial in contributing to understanding how a particle swarm optimization (PSO) swarm functions. One of these forms, PSO with discrete recombination, is extended and analyzed, demonstrating not just improvements in performance relative to a standard PSO algorithm, but also significantly different behavior, namely, a reduction in bursting patterns due to the removal of stochastic components from the update equations.
T. Blackwell and D. Bratton, “Origin of bursts,” in Proceedings of the 9th Annual Conference on Genetic and Evolutionary Computation (GECCO '07), pp. 2613–2620, London, UK, July 2007.
View at: Publisher Site | Google ScholarD. Bratton and J. Kennedy, “Defining a standard for particle swarm optimization,” in Proceedings of IEEE Swarm Intelligence Symposium (SIS '07), pp. 120–127, Honolulu, Hawaii, USA, April 2007.
View at: Publisher Site | Google ScholarD. K. Gehlhaar and D. B. Fogel, “Tuning evolutionary programming for conformationally flexible molecular docking,” in Proceedings of the 5th Annual Conference on Evolutionary Programming (EP '96), L. Fogel, P. Angeline, and T. Back, Eds., pp. 419–429, MIT Press, San Diego, Calif, USA, February 1996.
View at: Google ScholarJ. Jaccard and C. K. Wan, LISREL Approaches to Interaction Effects in Multiple Regression, vol. 114 of Quantitative Applications in the Social Sciences, Sage Publications, Thousand Oaks, Calif, USA, 1996.
View at: Google ScholarJ. Kennedy, “Bare bones particle swarms,” in Proceedings of IEEE Swarm Intelligence Symposium (SIS '03), pp. 80–87, Indianapolis, Ind, USA, April 2003.
View at: Publisher Site | Google ScholarJ. Kennedy, “Probability and dynamics in the particle swarm,” in Proceedings of the Congress on Evolutionary Computation (CEC '04), vol. 1, pp. 340–347, IEEE Press, Portland, Ore, USA, June 2004.
View at: Publisher Site | Google ScholarR. 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 Site | Google ScholarC. K. Monson and K. D. Seppi, “Exposing origin-seeking bias in PSO,” in Proceedings of the Conference on Genetic and Evolutionary Computation (GECCO '05), pp. 241–248, Washington, DC, USA, June 2005.
View at: Publisher Site | Google ScholarJ. Peña, A. Upegui, and E. Sanchez, “Particle swarm optimization with discrete recombination: an online optimizer for evolvable hardware,” in Proceedings of the 1st NASA/ESA Conference on Adaptive Hardware and Systems (AHS '06), pp. 163–170, Istanbul, Turkey, June 2006.
View at: Publisher Site | Google ScholarT. J. Richer and T. Blackwell, “The Lévy particle swarm,” in Proceedings of the IEEE Congress on Evolutionary Computation (CEC '06), pp. 808–815, IEEE Press, Vancouver, BC, Canada, July 2006.
View at: Google Scholar