By Topic

Job Shop Scheduling Based on an Improved Cooperative Particle Swarm Optimization

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
$31 $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

1 Author(s)
Jiao Bin ; Electr. Sch., Shanghai Dianji Univ., Shanghai, China

Aiming at the stagnation existing in the cooperative particle swarm optimization, this paper presents an improved cooperative particle swarm optimization algorithm. The algorithm uses an optimized sub-swarms cooperation mode with a disturbance mechanism to ensure the convergence rate. Meanwhile, a comprehensive learning strategy is introduced to strengthen the diversity of population to prevent the stagnation. The new algorithm is applied to job shop scheduling problems. The results of simulation experiments show that the new algorithm conquers the stagnation effectively, improves the global convergence ability, and has better optimization performance than basic cooperative particle swarm optimization.

Published in:

Measuring Technology and Mechatronics Automation (ICMTMA), 2010 International Conference on  (Volume:2 )

Date of Conference:

13-14 March 2010