.png){kind=icon}
返回
Production scheduling optimization algorithm for the hot rolling processes
.png){kind=icon}
PRE
AI
DOI：10.1080/00207540600988048.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The hot rolling production scheduling problem is an extremely difficult and time-consuming process, so it is quite difficult to achieve an optimal solution with traditional optimization methods owing to the high computational complexity. To ensure the feasibility of solutions and improve the efficiency of the scheduling, this paper proposes a vehicle routing problem (VRP) to model the problem and develops an easily implemented hybrid approach (QPSO-SA) to solve the problem. In the hybrid approach, quantum particle swarm optimization (QPSO) combines local search and global search to search the optimal results and simulated annealing (SA) employs certain probability to avoid getting into a local optimum. The computational results from actual production data have shown that the proposed model and algorithm are feasible and effective for the hot rolling scheduling problem.
Keyword:
hot rolling production scheduling
vehicle routing problem
quantum particle swarm optimization
simulated annealing
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.3
论文数:
1.1W
被引数:
3.7W
机构
引用论文
.png){kind=icon}
分享收藏
查看更多内容