柔性宽度浇次计划编制的一种混合改进算法  

Hybrid improved algorithm for cast planning problem with flexible width

作　　者：杨凡[1] 李歧强[1] 王桂荣[1] 

机构地区：[1]山东大学控制科学与工程学院,济南250061

出　　处：《控制与决策》2015年第2期348-352,共5页Control and Decision

基　　金：国家863计划项目(2007AA04Z157);山东省自然科学基金重点项目(ZR2010FZ001);山东大学研究生自主创新基金项目(2082012yzc12136)

摘　　要：根据连铸工艺特点,炉次的宽度是柔性值,充分利用炉次宽度的柔性可以有效提高中间包的利用率,但同时会增加浇次计划的编制难度.根据柔性宽度浇次计划问题特征,建立其广义车辆路径问题模型,并构建一种混合改进算法进行求解.该算法基于局部-全局方法,将柔性宽度浇次计划问题分解为确定炉次顺序和选取炉次宽度两个子问题,并利用改进的交叉熵法和可达算法分别进行求解.最后通过实例表明了所提出模型和算法的有效性.The widths of charges are flexible values in the cast planning problem, which can be used to increase the utilization of tundishes. But meanwhile, the cast planning becomes more difficult. According to the characteristics of the cast planning problem, the model based on generalized vehicle routing problem and the hybrid improved algorithm are proposed. Based on the local-global approach, the flexible width cast planning problem is decomposed to two sub-problems, charge order and charge widths, which are solved by using the improved cross-entropy method and reaching algorithm respectively. Finally, actual numerical examples are given to demonstrate the effectiveness of the proposed model and algorithm.

关 键 词：浇次计划 柔性制造 广义车辆路径问题 局部-全局方法 

分 类 号：TP31[自动化与计算机技术—计算机软件与理论]