Computer Engineering and Applications ›› 2007, Vol. 43 ›› Issue (21): 190-192.

• 工程与应用 • Previous Articles     Next Articles

Decomposition algorithm for hot rolling scheduling

LI Yan,LI Tie-ke   

  1. School of Economics and Management,University of Science and Technology Beijing,Beijing 100083,China
  • Received:1900-01-01 Revised:1900-01-01 Online:2007-07-21 Published:2007-07-21
  • Contact: LI Yan

热轧带钢批量计划分解算法

李 岩,李铁克   

  1. 北京科技大学 经济管理学院,北京 100083
  • 通讯作者: 李 岩

Abstract: A fuzzy C-means clustering and constraint programming based multi-objective optimization decomposition algorithm for hot rolling scheduling problem is presented.In the algorithm,slabs of a turn are divided into some clusters by fuzzy C-means clustering; sequence of slabs within each cluser and sequence of clusters are determined by constraint programming; the overall schedule is obtained by the integration of sequence of slabs and clusters.Computational experiments based on production data and random data show that the proposed algorithm performs well both in computational efficiency and effect.

Key words: hot rolling scheduling, fuzzy C-means clustering, constraint programming

摘要: 针对热轧带钢批量计划问题,提出基于模糊聚类和约束规划的多目标优化分解算法。算法利用模糊C均值聚类将一个轧制单元的板坯划分为若干簇,采用约束规划求解簇内板坯顺序和簇间顺序,合成各簇的解得到轧制单元批量计划。基于生产实际数据和随机数据的实验结果表明算法具有满意的计算效率和效果。

关键词: 轧制批量计划, 模糊C均值聚类, 约束规划