基于VRPTW-AT模型的钢包优化调度方法  

Optimization algorithm for ladle scheduling based on the VRPTW-AT model

作　　者：谭园园[1] 魏震[2] 王森[2] 周维[2] 刘士新[1] 

机构地区：[1]东北大学信息科学与工程学院流程工业综合自动化国家重点实验室,辽宁沈阳110819 [2]上海宝信软件股份有限公司,上海201900

出　　处：《系统工程学报》2013年第1期94-100,共7页Journal of Systems Engineering

基　　金：国家自然科学基金资助项目(71171038;71021061);中央高校基本科研业务费资助项目(N100504001)

摘　　要：在炼钢-连铸生产过程中,钢包的优化调度对减少钢铁生产的热能消耗,提高生产效率具有重要作用.将钢包调度问题归结为任务带有时间窗、车辆带有调整时间的车辆路径问题(vehicle routing problem with time windowsand adjustment time,VRPTW-AT).根据钢包服务钢水过程的约束建立了钢包调度问题的数学模型,针对模型特点提出了分散搜索(scatter search,SS)算法.基于国内某钢铁企业生产实绩做测试案例,对SS算法的优化效果与钢厂生产的实际数据进行了对比分析,实验结果表明了模型和算法的有效性.In steelmaking-continuous casting production processes, optimizing the schedule of ladles is an effective way to reduce energy consumption and improve productivity. The ladle scheduling problem can be modeled as a kind of vehicle routing problem with time windows and adjustment time（VRPTW-AT）. According to the process programs of ladles servicing molten steel, a mathematical model is proposed for ladle scheduling problem, and a scatter search（SS） algorithm is presented to solve the model. Using the practical instances from a Chinese iron and steel plant, we compare the results obtained by the SS algorithm with practical scheduling plans. Computational results show that the mathematical model and the SS algorithm are effective for solving the ladle scheduling problem.

关 键 词：炼钢-连铸 钢包调度 VRPTW-AT 分散搜索算法 

分 类 号：C934[经济管理—管理学]