Comprehensive Learning Particle Swarm Optimization Algorithm With Local Search for Multimodal Functions
Citations Over TimeTop 1% of 2018 papers
Abstract
A comprehensive learning particle swarm optimizer (CLPSO) embedded with local search (LS) is proposed to pursue higher optimization performance by taking the advantages of CLPSO's strong global search capability and LS's fast convergence ability. This paper proposes an adaptive LS starting strategy by utilizing our proposed quasi-entropy index to address its key issue, i.e., when to start LS. The changes of the index as the optimization proceeds are analyzed in theory and via numerical tests. The proposed algorithm is tested on multimodal benchmark functions. Parameter sensitivity analysis is performed to demonstrate its robustness. The comparison results reveal overall higher convergence rate and accuracy than those of CLPSO, state-of-the-art particle swarm optimization variants.
Related Papers
- → An efficient hybrid Particle Swarm and Swallow Swarm Optimization algorithm(2014)111 cited
- → A Random Particle Swarm Optimization Algorithm with Application(2013)15 cited
- → A Multi-Subpopulation Particle Swarm Optimization: A Hybrid Intelligent Computing for Function Optimization(2007)15 cited
- Random Particle Swarm Optimization Algorithm and Its Application(2012)
- → Glowworm Optimization(2012)1 cited