Abstract

The standard particle swarm optimization (pso), which introduces inertia weight w, is an effective method to find the extreme value of the function. However, particle swarm optimization (pso) has some disadvantages. When dealing with optimization problems, pso lacks effective parameter control and is prone to fall into local optimization, which leads to low convergence accuracy. In, this paper, put forward a new improved particle swarm optimization (pso) algorithm, The nonlinear decreasing inertia weight by the CSC function strategy, at the same time to join the beta distribution on random Numbers, thus to balance the global search and local search ability of the algorithm. The learning factor is the changed asynchronously to improve the learning ability of the algorithm. By adopting Griewank, Rastrigrin, J.D. Schaffer three standard test functions to simulate experiment, at the same time and the basic particle swarm algorithm the inertia weight in a fixed value, the linear regressive LDIW and nonlinear regressive comparison. The experimental results show that the nonlinear decreasing strategy with dynamic adjustment of inverse cosecant function can improve the convergence speed and stability.

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.