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.
No takes yet. Share an insight, caveat, or question.
Bratton et al. (2008) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: