A Decomposition Algorithm for Hot Rolling Planning
A fuzzy C-means clustering and constraint programming based multi-objective optimization decomposition algorithm for the hot rolling planning problem is presented. The slabs of a turn are divided into several clusters by fuzzy C-means clustering; sequence of slabs within each cluster and sequence of clusters are determined by constraint programming; the overall plan is obtained by integrating the sequence of slabs in accordance with the sequence of clusters. Computational experiments based on production data and random data show that the proposed algorithm performs well both in efficiency and effectiveness.
Yan LI Tieke LI
University of Science and Technology Beijing, China
国际会议
2nd IEEE Conference on Industrial Electronics and Applications(ICIEA 2007)(第二届IEEE工业电子与应用国际会议)
哈尔滨
英文
2007-05-23(万方平台首次上网日期,不代表论文的发表时间)