列队竞争算法求解多目的厂间歇过程调度问题  

Solution of Scheduling Problem of Multipurpose Batch Processes with Line-up Competition Algorithm

作　　者：孔令启[1] 李玉刚[2] 岳金彩[2] 郑世清[2] 韩方煜[2] 

机构地区：[1]华南理工大学化工与能源学院,广东广州510640 [2]青岛科技大学计算机与化工研究所,山东青岛266042

出　　处：《青岛科技大学学报（自然科学版）》2006年第5期419-422,437,共5页Journal of Qingdao University of Science and Technology:Natural Science Edition

基　　金：国家重点基础研究发展计划(973计划)项目(G2000026300)

摘　　要：由于组合爆炸特性,多目的厂的调度问题很难求解大规模甚至中等规模的问题,本研究采用一种新的随机型进化搜索算法———列队竞争算法对该问题进行求解,引入新的选择策略和变异方法。计算表明,同已有的方法相比,该方法求解效率高、收敛速度快、使用简单方便,可有效的克服计算负荷和求解质量之间的冲突,是一种求解多目的厂间歇过程调度问题的有效算法。The production scheduling of multipurpose batch processes is difficult to solve for large or medium scale problems due to combinatorial explosion. A novel stochastic optimization technique based on line-up competition algorithm （LCA）, a simple evolutionary algorithm, was proposed in this paper to overcome this difficulty, and herein selection strategy and mutation are introduced. An example of multipurpose batch scheduling with zero-wait （ZW） mode was studied. The results showed that the LCA had the properties of high efficiency, fast convergence and simply to use compared with the former algorithms, and the algorithm could be used as a novel algorithm for multipurpose scheduling and other combinatorial optimization problems.

关 键 词：列队竞争算法 多目的厂 间歇过程调度 组合优化 进化算法 

分 类 号：TQ021.8[化学工程]