协同微粒群算法及其在炼钢生产调度中的应用  

Cooperative particle swarm optimization for steel making scheduling

作　　者：高慧敏[1] 谭瑛[1] 曾建潮[1] 

机构地区：[1]太原科技大学系统仿真与计算机应用研究所,山西太原030024

出　　处：《系统工程学报》2008年第4期466-471,共6页Journal of Systems Engineering

基　　金：山西省自然科学基金资助项目(20041048)

摘　　要：给出了炼钢生产调度问题的最优炉次0-1数学规划模型.结合0-1空间优化问题的特点,通过逻辑运算将基本微粒群算法的进化搜索限定在0-1空间,并针对0-1整数规划的约束条件,提出一种协同微粒群算法CPSO.即分别构造两个微粒群,一个以目标函数的最小化为目标,另一个以满足约束条件为目标,同时,两个群体间进行信息交换,协同完成0-1整数规划的求解.该方法已成功应用于炼钢生产调度问题中最优炉次的求解.0-1 integer programming model of steel making scheduling is presented. Boolean algebra is applied to restricting the search space of particle swarm optimization to 0-1 space. To solve the constraint 0-1 integer programming problem, a cooperative particle swarm optimization（CPSO） algo- rithm is proposed, which comprises two particle swarms, one＇ s goal is to minimize the objective function, the other is to meet the constraint condition. Two particle swarms cooperate to solve the 0-1 integer programming problem. The CPSO algorithm has been used to solve the steel making scheduling problem successfully.

关 键 词：微粒群算法 炼钢生产 调度 协同 

分 类 号：O224[理学—运筹学与控制论]