考虑轧辊成本的轧制计划编制与调整

Rolling planning and adjusting problem with roller cost

在分析轧辊车削成本的基础上对轧制计划编制和调整问题进行深入研究,建立以最小化轧辊车削量为目标的0-1整数规划模型.针对问题特征,构造基于替换邻域搜索的两阶段算法:第1阶段,对轧制单元实施最佳匹配和交叉使用调整;第2阶段,通过搜索轧制单元的轧辊替换邻域,用车削量较少的轧辊替代车削量较大的轧辊,从而优化第1阶段的有效解.通过实际生产数据验证,两阶段算法能够在满足轧制工艺规程的基础上有效降低轧辊车削量,算法和模型均可行且有效.

The problem of rolling planning and adjusting is considered. By analyzing the essential operation properties of the problem, a 0-1 integer programming model is established with the objective of minimizing the total cutting quantity of rolling plan. A two-stage algorithm based on exchange neighborhood searching is constructed. In the first stage, the initial solution is gained through matching and cross-using. In the second stage, the solution in the first stage is optimized by searching the roller neighborhood and selecting the alternative roller with less cutting quantity. The algorithm is verified by the actual production data, and the results show that the cutting quantity is reduced significantly, and the algorithm and model are feasible and effective.