By Topic

Cooperative particle swarm optimizer based on multi-population and its application to Flow-Shop Scheduling Problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Binneng Yu ; Research Institute of Automation, East China University of Science and Technology, Shanghai, 200237, China ; Bin Jiao ; Xingsheng Gu

This paper presents a new optimization algorithm: MP-CPSO, cooperative particle swarm optimizer based on multi-population. MP-CPSO is based on a master-slave model, slave swarms are employed to search best solution in the solution space independently and population size is adjusted adaptively based on multi-population Lotka-Volterra competition equation. The master swarm evolves based on its own knowledge and also the knowledge of the slave swarms. A disturbance factor is added to a particle swarm optimizer (PSO) for improving PSO algorithmspsila performance. When the time of the current global best solution having not been updated is longer than the disturbance factor, the particlespsila velocities will be reset in order to force swarms getting out of local minimum. The experiments of Flow-Shop Scheduling Problem (FSSP) optimizations are presented using MP-CPSO. The results validate the efficiency of the new algorithm presented in this paper.

Published in:

System Simulation and Scientific Computing, 2008. ICSC 2008. Asia Simulation Conference - 7th International Conference on

Date of Conference:

10-12 Oct. 2008