东北大学学报（自然科学版）

东北大学学报(自然科学版) ›› 2006, Vol. 27 ›› Issue (2): 138-141.DOI: -

• 论著 • 上一篇    下一篇

炼钢组炉问题优化模型及其动态规划算法

黄可为;卢克斌;汪定伟;   

  1. 东北大学信息科学与工程学院;上海宝山钢铁股份有限公司自动化研究所;东北大学信息科学与工程学院 辽宁沈阳110004;上海201900;辽宁沈阳110004
  • 收稿日期:2013-06-23 修回日期:2013-06-23 出版日期:2006-02-15 发布日期:2013-06-23
  • 通讯作者: Huang, K.-W.
  • 作者简介:-
  • 基金资助:
    国家自然科学基金资助项目(70431003)

Dynamic programming algorithm and optimization model of charge design for steelmaking

Huang, Ke-Wei (1); Lu, Ke-Bin (1); Wang, Ding-Wei (1)   

  1. (1) School of Information Science and Engineering, Northeastern University, Shenyang 110004, China; (2) Institute of Automation, Shanghai Baoshan Iron and Steel Co. Ltd., Shanghai 201900, China
  • Received:2013-06-23 Revised:2013-06-23 Online:2006-02-15 Published:2013-06-23
  • Contact: Huang, K.-W.
  • About author:-
  • Supported by:
    -

RichHTML

0

PDF (PC)

915

摘要： 针对炼钢组炉计划编制中的集约优化问题,建立了各优化目标下的数学模型,并利用动态规划法,对该优化问题进行了求解.经算法时间复杂性分析和实际生产数据仿真演算,结果表明在一定的生产条件下,该算法能在合理的时间范围内给出一批合同最优的组炉方案,使得生产余材最小,可显著降低组炉计划余材量,经济效益非常显著.

关键词: 炼钢, 炉次计划, 约束优化, 动态规划, 数学模型, 算法

Abstract: Sometimes the charge design for a converter would consist of some portions as required by different orders in steelmaking process, and they would be combined into one or several melts when scheduling in view of batch production in connection with continuous casting. Some mathematical models are therefore developed to optimize the charge design. To solve the models, a dynamic programming algorithm is proposed to find an optimal solution. The time complexity of the algorithm is analyzed with a simulation example. The computational results show that by the proposed algorithm the optimized charge design for a reasonable time can be obtained to meet the requirements which will minimize the redundant steel and bring steel companies great economic benefits.

中图分类号: