Scheduling Model for the Practical Steelmaking-continuous Casting Production and Heuristic Algorithm Based on the Optimization of “Furnace-caster Matching” Mode
“…Specifically, each element in the charge permutation is a charge. Supposed that there is a charge permutation [2,5,3,6,4,7,1,8], the sequence of operating the charges at the first stage is charge 2, 5, 3, 6, 4, 7, 1 and 8.…”
Section: Encoding and Decodingmentioning
confidence: 99%
“…Additionally, the LF stage has two parallel machines while the RH stage has only one machine. Supposing that production permutation of charges is [2,5,3,6,4,7,1,8], on the basis of the FIFO-based forward heuristic, the charge 2 is assigned to LD1 and charge 3 is assigned to LD2, as presented in Figure 3a. After that, the forward heuristic allocates charge 1 to LD1 and charge 5 to LD2 and this procedure terminates until all the charges have been assigned.…”
Section: Stepmentioning
confidence: 99%
“…If taking the small-size instance in Section 4.2 as an example, Table 3 exhibits the detailed procedure of generating a feasible permutation by the heuristic initialization. Supposing that a random batch sequence is [2,3,1], the resulting charge permutation is [2,5,3,6,4,7,1,8]. To have a diverse swarm, parts of the initial individuals are obtained utilizing the above heuristic initialization and the others are achieved randomly.…”
Section: Stepmentioning
confidence: 99%
“…As is common knowledge, SCC is the key process in the steel production system to manufacture billet or slabs with user-defined chemical compositions [4]. In this process, hot metal is first smelted into molten steel with a strictly predefined chemical composition, then it is cast into solidified parts.…”
Steelmaking and the continuous-casting (SCC) scheduling problem is a realistic hybrid flow shop scheduling problem with continuous-casting production at the last stage. This study considers the SCC scheduling problem with diverse products, which is a vital and difficult problem in steel plants. To tackle this problem, this study first presents the mixed-integer linear programming (MILP) model to minimize the objective of makespan. Then, an improved migrating birds optimization algorithm (IMBO) is proposed to tackle this considered NP-hard problem. In the proposed IMBO, several improvements are employed to achieve the proper balance between exploration and exploitation. Specifically, a two-level decoding procedure is designed to achieve feasible solutions; the simulated annealing-based acceptance criterion is employed to ensure the diversity of the population and help the algorithm to escape from being trapped in local optima; a competitive mechanism is developed to emphasize exploitation capacity by searching around the most promising solution space. The computational experiments demonstrate that the proposed IMBO obtains competing performance and it outperforms seven other implemented algorithms in the comparative study.
“…Specifically, each element in the charge permutation is a charge. Supposed that there is a charge permutation [2,5,3,6,4,7,1,8], the sequence of operating the charges at the first stage is charge 2, 5, 3, 6, 4, 7, 1 and 8.…”
Section: Encoding and Decodingmentioning
confidence: 99%
“…Additionally, the LF stage has two parallel machines while the RH stage has only one machine. Supposing that production permutation of charges is [2,5,3,6,4,7,1,8], on the basis of the FIFO-based forward heuristic, the charge 2 is assigned to LD1 and charge 3 is assigned to LD2, as presented in Figure 3a. After that, the forward heuristic allocates charge 1 to LD1 and charge 5 to LD2 and this procedure terminates until all the charges have been assigned.…”
Section: Stepmentioning
confidence: 99%
“…If taking the small-size instance in Section 4.2 as an example, Table 3 exhibits the detailed procedure of generating a feasible permutation by the heuristic initialization. Supposing that a random batch sequence is [2,3,1], the resulting charge permutation is [2,5,3,6,4,7,1,8]. To have a diverse swarm, parts of the initial individuals are obtained utilizing the above heuristic initialization and the others are achieved randomly.…”
Section: Stepmentioning
confidence: 99%
“…As is common knowledge, SCC is the key process in the steel production system to manufacture billet or slabs with user-defined chemical compositions [4]. In this process, hot metal is first smelted into molten steel with a strictly predefined chemical composition, then it is cast into solidified parts.…”
Steelmaking and the continuous-casting (SCC) scheduling problem is a realistic hybrid flow shop scheduling problem with continuous-casting production at the last stage. This study considers the SCC scheduling problem with diverse products, which is a vital and difficult problem in steel plants. To tackle this problem, this study first presents the mixed-integer linear programming (MILP) model to minimize the objective of makespan. Then, an improved migrating birds optimization algorithm (IMBO) is proposed to tackle this considered NP-hard problem. In the proposed IMBO, several improvements are employed to achieve the proper balance between exploration and exploitation. Specifically, a two-level decoding procedure is designed to achieve feasible solutions; the simulated annealing-based acceptance criterion is employed to ensure the diversity of the population and help the algorithm to escape from being trapped in local optima; a competitive mechanism is developed to emphasize exploitation capacity by searching around the most promising solution space. The computational experiments demonstrate that the proposed IMBO obtains competing performance and it outperforms seven other implemented algorithms in the comparative study.
“…It is well known that the computational complexity exponentially increases as the problem scale grows, and hence exact algorithms cannot solve the large-sized instance within an acceptable time. Heuristic algorithms focus on problemspecific features and may solve large-scale problems in extremely short computation time [24][25][26]. However, the quality of the derived solutions might not be satisfactory since it is difficult to combine all the features into a simple heuristic algorithm.…”
Section: Figure 1 Production Scheduling and Ladle Dispatching In Sccmentioning
The existing production scheduling mode ignores ladle dispatching resulting in the increase of energy consumption in ladle heating and instability in production. Hence, we study the energy-efficient integration optimization of production scheduling and ladle dispatching in this paper. Specifically, a mixed integer linear programming model is formulated to coordinate the time-dependent correlations between them and quantify the energy consumption of them. Moreover, an enhanced migrating birds optimization algorithm (EMBO) is proposed to tackle this NP-hard integration optimization problem. In this proposed algorithm, a three-level rule-based heuristic decoding is designed to achieve the optimal solutions at the given production sequence; well-designed neighborhood structures are appended to intensify exploration; a simulated annealing-based acceptance criterion is hired to escape from local optima. Additionally, a novel competitive mechanism for birds regrouping is developed to increase the population diversity by information exchange between the left and right lines of Vformation. Mass experimental results demonstrate that the proposed EMBO observably outperforms all the compared algorithms, and the proposed integration optimization decreases the energy-consumption by 1.21% in the context of constant production efficiency.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.