Abstract
Particle Swarm Optimization (PSO) algorithm has shown good performance in many optimization problems, but PSO suffers from the problem of early convergence into a local minima. Introduction of opposition based initialization and mutation operators have played an important role to overcome the convergence problem in function optimization. In this study we have reviewed different variants of PSO for function optimization. Researchers have proposed different modifications in PSO to prevent it from getting stuck in local optima. At the end, we have proposed a variant of PSO for better conversion.
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.