Abstract
The Cooperative Particle Swarm Optimization (CPSO) is a variant of the original PSO. It divides the solution vector into sub-vectors. Aiming to the stagnation problem of CPSO, this paper presents an improved cooperative particle swarm optimization algorithm (ICPSO). In order to retain the diversity of the swarm, it employs a comprehensive learning strategy to determine the position and velocity of each particle. It adds a factor of selection probability and discourages premature convergence to some extent. Through standard job-shop scheduling problem test, we demonstrate that the improved CPSO algorithm has an improvement in performance over the traditional CPSO. It has not only quicker speed of convergence but also less makespan.
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.
