|国家预印本平台
首页|热轧批量计划编制模型及其求解算法

热轧批量计划编制模型及其求解算法

Model and solving algorithm of hot rolling batch planning

中文摘要英文摘要

针对钢铁企业的热轧批量计划编制问题,考虑了热轧生产工艺规程、同宽板坯轧制长度限制等约束,本文建立了基于不确定旅行商数的多旅行商问题(MTSP)的热轧批量计划数学模型,把轧制单元计划数最小化和紧邻轧制板坯间轧制宽度、厚度、硬度差异而造成的总惩罚值最小化作为优化目标。结合模型的实际情况,本文采用了基于两交换启发式的改进遗传算法对问题进行求解。最后,本文利用某钢厂的实际生产数据进行计算实验,同时对结合传统遗传算法和改进遗传算法的优化情况进行对比和结果分析,模型的正确性和算法的有效性得到了验证。

iming at the hot rolling batch planning problem of iron and steel enterprises,considering the constraints of the hot rolling production process and the limitation of the same wideth slab rolling length, this paper develops a mathematical model of hot rolling batch planning based on multiple traveling salesman problem (MTSP) with uncertain traveling salesman number, the optimization goal is to minimize the number of rolling unit plans and minimize the total penalty value caused by the difference of rolling width, thickness, and hardness between the adjacent rolled slabs. Combining the actual situation of the model, this paper uses an improved genetic algorithm based on two exchange heuristics to solve the problem. Finally, combing with the comparison of optimization situation and result analysis of traditional genetic algorithm and improved genetic algorithm, this paper verifies the correctness of the model and the effectiveness of the algorithm by using the actual production data of a steel plant to carry out caculation experiments.

幸火林、宋伟、徐安军、吴双平

冶金技术计算技术、计算机技术炼钢

热轧批量计划多旅行商问题改进遗传算法

hot rollingbatch planningmultiple traveling salesman problemimproved genetic algorithm

幸火林,宋伟,徐安军,吴双平.热轧批量计划编制模型及其求解算法[EB/OL].(2020-10-30)[2025-08-18].http://www.paper.edu.cn/releasepaper/content/202010-57.点此复制

评论