Abstract

To determine the reasonable parameter settings of particle swarm optimization (PSO) algorithm, this paper discusses the impact of the time-varying inertia weight and velocity-based mutation strategies on the performance of PSO algorithm. The performance of the PSO algorithm with these two kinds of parameters adjustment strategies are tested through four well-known benchmark functions. The simulation results show that the PSO algorithm has better convergence performance with the quickly decreasing inertia weight. Also, the velocity-based mutation strategy will slow down the convergence speed of PSO algorithm if the global solutions over the adjacent generations are close to each other.

Full Text
Paper version not known

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

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.