Multi-product clonal selection algorithm and its application to batch plants scheduling
LIN Ke-hong1,2, HE Yi-jun1, CHEN De-zhao1
(1.Department of Chemical and Biochemical Engineering,Zhejiang University, Hangzhou 310027, China;
2. School of Pharmaceutical and Chemical Engineering, Taizhou University, Linhai 317000, China)
The traditional multi-product multi-stage and multi-machine batch plants scheduling under zero-wait policy (MMMSZ) was only applied to small-scale practical issues. A novel multi-product clonal selection algorithm (MCSA) was proposed according to the feature. The better production program and a lot of entire product batches were created from the production plan. The entire product batches were considered as the antibodies, and the improved clonal selection algorithm was called. MCSA can solve many kinds of problem, search more solution space, efficiently deal with the constraints, and is applicable to the small-scale problem. Large-scale multi-product clonal selection algorithm (LMCSA) was created by employing the periodic scheduling strategy in order to conquer the dimension disaster. MCSA and LMCSA were used to solve two examples of batch plants scheduling. Experimental results show that both algorithms can get the sub-optimal solution with appropriate time and their comprehensive performance is good.
LIN Ge-Hong, HE Yi-Jun, CHEN De-Zhao. Multi-product clonal selection algorithm and its application to batch plants scheduling. J4, 2010, 44(2): 338-343.
［1］ KONDILI E, PANTELIDES C C, SARGENT R W H. A general algorithm for short-term scheduling for batch operations:Ⅰ MILP formulation ［J］. Computers and Chemical Engineering, 1993, 17(2) :211227.
［2］ MENDEZ C A, CERDA J, GROSSMANN I E, et al. State-of-the-art review of optimization methods for short-term scheduling of batch processes ［J］. Computers and Chemical Engineering, 2006, 30(6-7) :913916.
［3］ LOHL T, SCHULZ C, ENGELL S. Sequencing of batch operations for a highly coupled production process: genetic algorithms versus mathematical programming ［J］. Computers and Chemical Engineering, 1998, 22(supplement) :579585.
［4］ WANG K F, LOHL T, STOBBE M, et al. A genetic algorithm for online-scheduling of a multi-product polymer batch plant. ［J］. Computers and Chemical Engineering, 2000, 24(supplement): 393400.
［5］ HE Y, HUI C W. Genetic algorithm for large-size multi-stage batch plant scheduling ［J］. Chemical Engineering Science, 2007, 62(5): 15041523.
［6］ JAYARAMAN V K. Ant colony framework for optimal design and scheduling of batch plants ［J］. Computers and Chemical Engineering, 2000, 24(8): 19011912.
［7］ ENGIN O, DOYEN A. A new approach to solve hybrid flow shop scheduling problems by artificial immune system ［J］. Future Generation Computer Systems, 2004, 20(6): 10831095.
［8］ DASGUPTA D. Introduction of artificial immune system ［EB/OL］. ［2008-07-29］. http://ais.cs.memphis.edu/.
［9］ DASGUPTA D. Advances in artificial immune systems［C］//IEEE Computational Intelligence Magazine. ［S. l.］: ［s. n.］, 2006: 4049.
［10］ HART E, TIMMIS J. Application areas of AIS: the past, the present and the future ［C］//International Conference on Artificial Immune Systems. Berlin: Springer, 2005: 483497.
［11］ VOUDOURIS V T, GROSSMANN I E. MILP model for scheduling and design of a special class of multipurpose batch plants ［J］. Computers and Chemical Engineering, 1996, 20(11): 13351360.
［12］ 潘明,钱宇,李秀喜. 一种改进的顺序型多目的间歇工厂生产调度的MILP模型［J］.化工学报, 2006, 57(4): 861866.
PAN Ming,QIAN Yu,LI Xiu-xi. Modified MILP model for scheduling of sequential multipurpose batch plants ［J］. Journal of Chemical Industry and Engineering (China), 2006, 57(4): 861866.
［13］ GAMS development corporation. introduction of solvers in GAMS ［EB/OL］. ［2008-07-24］. http://www.gams.com/solvers/index.htm.
