Abstract
The particle swarm optimization algorithm with constriction factor (CFPSO) has some demerits, such as relapsing into local extremum, slow convergence velocity and low convergence precision in the late evolutionary. A chaotic optimization-based simple particle swarm optimization equation with constriction factor is developed. Piecewise linear chaotic map is employed to perform chaotic optimization due to its ergodicity and stochasticity. Consequently, the particles are accelerated to overstep the local extremum in sCFPSO algorithm. The experiment results of six classic benchmark functions show that the proposed algorithm improves extraordinarily the convergence velocity and precision in evolutionary optimization, and can break away efficiently from the local extremum. Furthermore, the algorithm obtains better optimization results with smaller populations and evolutionary generations. Therefore, the proposed algorithm improves the practicality of the particle swarm optimization.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
