Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
By Topic

A New Particle Swarm Optimization Algorithm for Short-Term Scheduling of Single-Stage Batch Plants with Parallel Lines

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

2 Author(s)
Jin Zhu ; Res. Inst. of Autom., East China Univ. of Sci. & Technol., Shanghai ; Xingsheng Gu

This is paper proposes a new particle swarm optimization (NPSO) algorithm to short-term scheduling of single-stage batch plants with parallel units using the continuous-time domain representation. The model is formulated as a mixed-integer linear programming (MILP) problem. The key to the improvement of the algorithm is the introduction of mutation operators, crossover operators and some heuristic rules which can get better initialization population and no effect on the optimality of the scheduling problem. Computational examples show that NPSO are clearly more appropriate than GA and PSO algorithm in resolution for batch plants to minimize earliness for scheduling problems with due date constraints, and NPSO becomes more effective after involving heuristic rules

Published in:

Intelligent Systems Design and Applications, 2006. ISDA '06. Sixth International Conference on  (Volume:2 )

Date of Conference:

16-18 Oct. 2006