TY - JOUR
T1 - Hybrid Scatter Search Algorithm for Optimal and Energy-Efficient Steelmaking-Continuous Casting
AU - Tan, Yuanyuan
AU - Zhou, Meng Chu
AU - Zhang, Yuan
AU - Guo, Xiwang
AU - Qi, Liang
AU - Wang, Yanhong
N1 - Funding Information:
Manuscript received November 20, 2019; revised January 17, 2020; accepted March 1, 2020. Date of publication April 27, 2020; date of current version October 6, 2020. This article was recommended for publication by Associate Editor M. Dotoli and Editor J. Li upon evaluation of the reviewers. This work was supported in part by the Liaoning Province Education Department Scientific Research Foundation of China under Grant LQGD2019014 and Grant L2019027, in part by the Liaoning Provincial Natural Science Foundation of China under Grant 2019-ZD-0218, in part by the Liaoning Revitalization Talents Program under Grant XLYC1907166, in part by the National Natural Science Foundation of China under Grant 61903229, and in part by by the Deanship of Scientific Research (DSR), King Abdulaziz University, Jeddah, under Grant RG-20-135-38. (Corresponding author: MengChu Zhou.) Yuanyuan Tan, Yuan Zhang, and Yanhong Wang are with the College of Information Science and Engineering, Shenyang University of Technology, Shenyang 110870, China (e-mail: tanyuanyuan83@sina.com; yuanzhang_1225@sina.com; sshuang123456@163.com).
Publisher Copyright:
© 2004-2012 IEEE.
PY - 2020/10
Y1 - 2020/10
N2 - This article studies a steelmaking-continuous casting (SCC) scheduling problem by considering ladle allocation. It takes technological rules in steel manufacturing and ladle-related constraints into account. A scheduling problem is formulated to determine allocation equipment for jobs, production sequence for jobs processed by the same equipment, and modification operations for empty ladles after their service for jobs. To ensure the fastest production and least energy consumption, we present a mixed integer mathematical programming model with the objectives to minimize the maximum completion time, idle time penalties, and energy consumption penalties related to waiting time. To solve it, we develop a two-stage approach based on a combination of scatter search (SS) and mixed integer programming (MIP). The first stage applies an SS algorithm to determine the assignment and sequence variables for charges. For the obtained solution, we construct a temporal constraint network and establish an MIP model at the second stage. We apply ILOG.CPLEX to solve the model and find the final solution. We analyze and compare the performance of the proposed approach with a hybrid method that combines a genetic algorithm with MIP on instances constructed from a real iron-steel plant. To further verify the effectiveness of the proposed algorithm, we compare its results with optimal solutions of the constraint-relaxed original problem. The experimental results show the effectiveness of the proposed approach in solving the SCC-scheduling problem. Note to Practitioners-This article deals with a scheduling problem arising from a steelmaking-continuous casting process in steel manufacturing. It integrates ladles allocation into the scheduling problem to reduce the energy consumption as much as possible. Such a problem in the existing work is handled, respectively, and its solutions tend to cause much energy waste and some mismatched plans. This article takes complex technological constraints into full account and minimizes the maximum job completion time, idle time of equipment, and waiting time of jobs. It establishes a mixed integer mathematical model and proposes a hybrid algorithm that combines scatter search and mixed integer programming to solve it. The extensive results demonstrate that the proposed approach can effectively solve the studied scheduling problem. The obtained solution gives decision makers some desired reference to determine a right schedule when an actual production process is conducted.
AB - This article studies a steelmaking-continuous casting (SCC) scheduling problem by considering ladle allocation. It takes technological rules in steel manufacturing and ladle-related constraints into account. A scheduling problem is formulated to determine allocation equipment for jobs, production sequence for jobs processed by the same equipment, and modification operations for empty ladles after their service for jobs. To ensure the fastest production and least energy consumption, we present a mixed integer mathematical programming model with the objectives to minimize the maximum completion time, idle time penalties, and energy consumption penalties related to waiting time. To solve it, we develop a two-stage approach based on a combination of scatter search (SS) and mixed integer programming (MIP). The first stage applies an SS algorithm to determine the assignment and sequence variables for charges. For the obtained solution, we construct a temporal constraint network and establish an MIP model at the second stage. We apply ILOG.CPLEX to solve the model and find the final solution. We analyze and compare the performance of the proposed approach with a hybrid method that combines a genetic algorithm with MIP on instances constructed from a real iron-steel plant. To further verify the effectiveness of the proposed algorithm, we compare its results with optimal solutions of the constraint-relaxed original problem. The experimental results show the effectiveness of the proposed approach in solving the SCC-scheduling problem. Note to Practitioners-This article deals with a scheduling problem arising from a steelmaking-continuous casting process in steel manufacturing. It integrates ladles allocation into the scheduling problem to reduce the energy consumption as much as possible. Such a problem in the existing work is handled, respectively, and its solutions tend to cause much energy waste and some mismatched plans. This article takes complex technological constraints into full account and minimizes the maximum job completion time, idle time of equipment, and waiting time of jobs. It establishes a mixed integer mathematical model and proposes a hybrid algorithm that combines scatter search and mixed integer programming to solve it. The extensive results demonstrate that the proposed approach can effectively solve the studied scheduling problem. The obtained solution gives decision makers some desired reference to determine a right schedule when an actual production process is conducted.
KW - Energy-efficient production
KW - intelligent optimization
KW - ladle allocation
KW - mixed integer programming (MIP)
KW - scatter search (SS)
KW - steelmaking-continuous casting (SCC)
UR - http://www.scopus.com/inward/record.url?scp=85092579480&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85092579480&partnerID=8YFLogxK
U2 - 10.1109/TASE.2020.2979079
DO - 10.1109/TASE.2020.2979079
M3 - Article
AN - SCOPUS:85092579480
SN - 1545-5955
VL - 17
SP - 1814
EP - 1828
JO - IEEE Transactions on Automation Science and Engineering
JF - IEEE Transactions on Automation Science and Engineering
IS - 4
M1 - 9078850
ER -