.png){kind=icon}
Return
Production scheduling optimization algorithm for the hot rolling processes
.png){kind=icon}
PRE
AI
DOI：10.1080/00207540600988048.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
hot rolling production scheduling
vehicle routing problem
quantum particle swarm optimization
simulated annealing
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.3
Papers:
1.1W
Citations:
3.7W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSave
ShareSaveShareSaveShareSaveShareSave
View more