| 考虑轧辊成本的轧制计划编制与调整 |
| |
| 引用本文： | 董广静,李铁克,王柏琳,栾治伟,张春生.考虑轧辊成本的轧制计划编制与调整[J].控制与决策,2017,32(1):63-70. |
| |
| 作者姓名： | 董广静 李铁克 王柏琳 栾治伟 张春生 |
| |
| 作者单位： | 北京科技大学东凌经济管理学院,北京100083;北京科技大学钢铁生产制造执行系统技术教育部工程研究中心,北京100083\;首都师范大学教育学院,北京100037,北京科技大学东凌经济管理学院,北京100083;北京科技大学钢铁生产制造执行系统技术教育部工程研究中心,北京100083\,北京科技大学东凌经济管理学院,北京100083;北京科技大学钢铁生产制造执行系统技术教育部工程研究中心,北京100083\,北京科技大学东凌经济管理学院,北京100083;北京科技大学钢铁生产制造执行系统技术教育部工程研究中心,北京100083\,中国人民大学信息资源管理学院,北京100872 |
| |
| 基金项目： | 国家自然科学基金项目(71231001)； 中央高校基本科研业务费专项资金项目(FRF-SD-12-012B,FRF-SD-12-011B) |
| |
| 摘 要： | 在分析轧辊车削成本的基础上对轧制计划编制和调整问题进行深入研究, 建立以最小化轧辊车削量为目标的0-1整数规划模型. 针对问题特征, 构造基于替换邻域搜索的两阶段算法: 第1阶段, 对轧制单元实施最佳匹配和交叉使用调整; 第2阶段, 通过搜索轧制单元的轧辊替换邻域, 用车削量较少的轧辊替代车削量较大的轧辊, 从而优化第1阶段的有效解. 通过实际生产数据验证, 两阶段算法能够在满足轧制工艺规程的基础上有效降低轧辊车削量, 算法和模型均可行且有效.
|
| 关 键 词： | 轧制计划 车削成本 替换邻域 调整 |
| 收稿时间： | 2015/9/13 0:00:00 |
| 修稿时间： | 2015/9/13 0:00:00 |
Rolling planning and adjusting problem with roller cost |
| |
| DONG Guang-jing,LI Tie-ke,WANG Bai-lin,LUAN Zhi-wei and ZHANG Chun-sheng.Rolling planning and adjusting problem with roller cost[J].Control and Decision,2017,32(1):63-70. |
| |
| Authors: | DONG Guang-jing LI Tie-ke WANG Bai-lin LUAN Zhi-wei and ZHANG Chun-sheng |
| |
| Affiliation: | Dongling School of Economics and Management,University of Science and Technology Beijing,Beijing 100083, China;Engineering Research Center of MES Technology for Iron & Steel Production,Ministry of Education,University of Science and Technology Beijing,Beijing 100083, China;School of Education,Capital Normal University,Beijing 100037,China,Dongling School of Economics and Management,University of Science and Technology Beijing,Beijing 100083, China;Engineering Research Center of MES Technology for Iron & Steel Production,Ministry of Education,University of Science and Technology Beijing,Beijing 100083, China,Dongling School of Economics and Management,University of Science and Technology Beijing,Beijing 100083, China;Engineering Research Center of MES Technology for Iron & Steel Production,Ministry of Education,University of Science and Technology Beijing,Beijing 100083, China,Dongling School of Economics and Management,University of Science and Technology Beijing,Beijing 100083, China;Engineering Research Center of MES Technology for Iron & Steel Production,Ministry of Education,University of Science and Technology Beijing,Beijing 100083, China and School of Information Resources Management,Renmin University of China,Beijing 100872,China |
| |
| Abstract: | 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. |
| |
| Keywords: | |
|
| 点击此处可从《控制与决策》浏览原始摘要信息 |
|
点击此处可从《控制与决策》下载全文 |
|
