摘要
炉次计划是炼钢-连铸批量计划的关键计划之一,主要功能是考虑如何充分利用转炉容量及板坯属性使用最少的炉次组织生产,其编制的好坏直接影响后续计划制定及各工序生产节奏.基于目前炉次计划模型存在无法分辨板坯宽度区间相交程度、炉容量利用效率及炉次内板坯间关系的不足及一维装箱理论没有考虑剩余箱子容量及箱子内物品间关系的问题,将炉次计划归结为考虑炉次剩余容量及板坯间关系的一维装箱问题,并建立数学规划模型.基于炉次计划模型解矩阵的特点及迭代局部搜索(iterated local search,ILS)和变邻域搜索(variable neighborhood search,VNS)的优点,提出了将VNS算法作为ILS算法中局部搜索的混合算法.最后利用现场实际数据对模型和算法的有效性进行了对比验证,结果表明炉次计划模型及混合算法是有效的.
Charge planning is a key steelmaking and continuous casting batch planning. There exist some shortcomings when applying the method in research, for example, not considering whole factors in real production, not distinguishing the degree of intersection of width interval. Based on the description of the charge planning problem, we model the charge planning problem in real production. After analyzing the character- istics of the solution of the model, we present a hybrid algorithm in which we replace the local search in ILS with VNS. Finally, we apply real data to verifying the model and the algorithm. The results illustrate the effectiveness of the model and the algorithm.
出处
《系统工程学报》
CSCD
北大核心
2013年第5期694-701,共8页
Journal of Systems Engineering
基金
国家自然科学基金资助项目(71021061
60974091)
中央高校基本科研业务费资助项目(N100508001
N120708001)
关键词
炉次计划
宽度区间
迭代局部搜索
装箱
变邻域搜索
charge planning
width interval
iterated local search
bin packing
variable neighborhood search