首页 | 新闻公告 | 投稿须知 | 编委会 | 关于杂志 | 订阅 | 留言FAQ | 广告服务 | 相关链接 | 下载区 | 联系我们

基于VRPTW-AT模型的钢包优化调度方法
Optimal algorithm for ladle scheduling based on the VRPTW–AT model
摘要点击 3954  全文点击 0  投稿时间:2011-06-15  修订日期:2011-12-02
  查看/发表评论  下载PDF阅读器
中文关键词  炼钢-连铸;钢包调度;VRPTW-AT;分散搜索算法
英文关键词  steelmaking-continuous casting; ladle schedule; VRPTW-AT; SS algorithm
基金项目  
作者单位E-mail
谭园园 东北大学 tanyuanyuan83@sina.cn 
魏震 上海宝信软件股份有限公司  
王森 上海宝信软件股份有限公司  
周维 上海宝信软件股份有限公司  
刘士新 东北大学  
中文摘要
      在炼钢-连铸生产过程中,钢包的优化调度对减少钢铁生产的热能消耗,提高生产效率具有重要作用。将钢包调度问题归结为任务带有时间窗、车辆带有调整时间的车辆路径问题(vehicle routing problem with time windows and adjustment time,VRPTW-AT),根据钢包服务钢水过程的约束建立了钢包调度问题的数学模型,针对模型特点提出了分散搜索(scatter search,简称SS)算法。基于国内某钢铁企业生产实绩做测试案例,对本文SS算法的优化效果与钢厂生产的实际数据进行了对比分析,实验结果表明了模型和算法的有效性。
英文摘要
      In steelmaking-continuous casting production process, 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. Citing 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.
相关附件:   修改说明  Latex稿件  修改说明  修改稿的Latex文件  修改说明  修改稿的Latex文件  修改说明  Latex稿件
关闭

版权所有 © 2007 《系统工程学报》
通讯地址:天津市卫津路92号天津大学25教学楼A区908室 邮编:300072
联系电话/传真:022-27403197 电子信箱: jse@tju.edu.cn