Abstract

This paper conducts an analysis of various strategies for incorporating the headless chicken macromutation operator into a dynamic particle swarm optimization algorithm. Seven variations of the dynamic headless chicken guaranteed convergence particle swarm optimization algorithm are proposed and evaluated on a diverse set of single-objective dynamic benchmark problems. Competitive performance was demonstrated by the headless chicken PSO algorithms when compared to, amongst others, a quantum particle swarm optimization algorithm.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call