In this study the promising Multiple-choice strategy for PSO (MC-PSO) is enhanced with the blind search based single dimensional mutation. The MC-PSO utilizes principles of heterogeneous swarms with random behavior selection. The performance previously tested on both large-scale and fast optimization is significantly improved by this approach. The newly proposed algorithm is more robust and resilient to premature convergence than both original PSO and MC-PSO. The performance is tested on four typical benchmark functions with variety of dimension settings.
CITATION STYLE
Pluhacek, M., Senkerik, R., Zelinka, I., & Davendra, D. (2015). Multiple choice strategy for PSO algorithm enhanced with dimensional mutation. In Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) (Vol. 9119, pp. 370–378). Springer Verlag. https://doi.org/10.1007/978-3-319-19324-3_34
Mendeley helps you to discover research relevant for your work.