引用本文:张健欣,童朝南.用于编制热轧生产流程的新型Meta-heuristic算法[J].控制理论与应用,2009,26(7):767~770.[点击复制]
ZHANG Jian-xin,TONG Chao-nan.A novel meta-heuristic algorithm for hot rolling scheduling[J].Control Theory and Technology,2009,26(7):767~770.[点击复制]
用于编制热轧生产流程的新型Meta-heuristic算法
A novel meta-heuristic algorithm for hot rolling scheduling
摘要点击 1392  全文点击 1256  投稿时间:2008-05-05  修订日期:2008-08-28
查看全文  查看/发表评论  下载PDF阅读器
DOI编号  
  2009,26(7):767-770
中文关键词  调度  轧制计划  多旅行商问题  Meta-heuristics算法
英文关键词  scheduling  rolling plan  multiple traveling salesperson problem(MTSP)  Meta-heuristics algorithm
基金项目  北京市教委重点学科共建项目(XK100080537)
作者单位E-mail
张健欣* 北京科技大学信息工程学院 zhangjianxin@imut.edu.cn 
童朝南 北京科技大学信息工程学院  
中文摘要
      带钢热轧具有特殊的生产工艺约束, 其生产流程的编制是钢铁企业生产的关键, 因此提出采用并行策略的基于多旅行商问题(MTSP)热轧轧制模型. 该模型不但考虑了板坯在宽度、厚度和硬度跳变时的约束, 还考虑了同一轧制单元内轧制板坯数量的约束. 并设计了新的Meta-heuristics算法求解此模型. 通过对某热轧带钢厂生产数据的仿真实验,表明模型和算法能有效地给出满意的排产结果, 并且具有较高的执行效率.
英文摘要
      Hot strip-rolling is a process with special production constraints; the scheduling of which is a critical work for the strip-production in a steel plant. A multiple traveling salesperson problem(MTSP) model based on a parallel strategy is presented to solve the scheduling problem. This model not only takes into account the variations in slab width, gauge and hardness, but also considers the restriction on the number of slabs in a single batch of rolling. A novel meta-heuristic algorithm is put forward for solving the MTSP. A set of practical data from a steel plant is employed in a simulation; the results show the effectiveness and efficiency of the model and the algorithm.