Abstract
Particle Swarm Optimization (PSO) is a bio-inspired evolutionarymeta-heuristic that simulates the social behaviour observed in groups of biological individuals [4]. In standard PSO, the particle swarm is often attracted by sub-optimal solutions when solving complex multimodal problems, causing premature convergence of the algorithm and swarm stagnation [5]. Once particles have converged prematurely, they continue converging to within extremely close proximity of one another so that the global best and all personal bests are within one minuscule region of the search space, limiting the algorithm exploration. This paper presents a modified variant of constricted PSO [1] that uses random samples in variable neighbourhoods for dispersing the swarm whenever a premature convergence state is detected, offering an escaping alternative from local optima.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.