A continuous casting rhythm dynamic control method

Abstract

The application discloses a continuous casting rhythm dynamic control method, and relates to the technical field of steelmaking production scheduling, wherein the implementation of the method comprises the following steps: inquiring the unfinished heats of the current casting heat by the smelting state, calculating the expected casting time of the uncast heats according to the typical casting speed, and calculating the start and end time of the heat plan casting in sequence in the positive direction according to the actual time of the process; referring to the steelmaking manufacturing standards and the ladle transfer time, combining the start and end time of the heat plan casting to preset the start and end time of other processes and stations, forming an initial scheduling scheme; defining the calculation rules of the scheduling scheme evaluation function and the generation mode of the adjacent scheduling schemes; optimizing the initial scheduling scheme to generate a final scheduling scheme; and generating a continuous casting rhythm decision prompt according to the final scheduling scheme. The application generates the continuous casting rhythm adjustment suggestion and early warning based on the whole process information of steelmaking-continuous casting, controls the finished product quality, stabilizes the production rhythm, and reduces accidents and abnormalities.

Description

Technical Field

[0001] This invention relates to the field of steelmaking production scheduling technology, specifically to a method for lean control of continuous casting production rhythm. Background Technology

[0002] This study focuses on the scheduling problem of steelmaking and continuous casting, with the control of continuous casting production rhythm as the research topic. Continuous casting is the process of transforming molten steel from a liquid to a solid state to form a steel billet of a specific shape. During continuous casting, the tundish acts as a buffer and stabilizer for the molten steel flow, ensuring a continuous supply of molten steel; otherwise, casting interruptions may occur, resulting in significant economic losses. Therefore, before the completion of an ongoing casting task, a heat of processed molten steel must be hoisted to the continuous casting turret. After the current casting task is completed, the turret swaps the positions of the two ladles, and new molten steel is injected into the tundish to complete continuous casting. When the normal production rhythm cannot complete continuous casting, steelmaking and continuous casting need to coordinate and adjust their production rhythms. (1) Steelmaking can transport molten steel to the rotary table in advance by compressing the refining cycle and the transfer time between processes.

[0003] (2) Continuous casting extends the remaining time of the current molten steel casting by adjusting the casting speed and reducing the number of castings.

[0004] When adjusting the production rhythm in steelmaking, it is necessary to consider whether the molten steel still meets manufacturing standards in terms of composition and temperature. When adjusting the casting speed and flow rate in continuous casting, the impact on billet quality must be considered. How to ensure overall production quality while promptly developing a rhythm adjustment plan under abnormal rhythm conditions is a key challenge in steelmaking-continuous casting production. In summary, the following problems urgently need to be addressed in the current continuous casting production rhythm control: (1) Frequent changes in production make it difficult to share data between steelmaking and continuous casting, and information cannot be synchronized in a timely manner.

[0005] (2) It is difficult to discern potential anomalies from a large amount of production data and make advance adjustments to minimize the impact.

[0006] (3) Steelmaking and continuous casting, based on their respective assessment indicators, had different suggestions on the pace adjustment, and ultimately could not reach a consensus, missing the best opportunity to solve the problem. Summary of the Invention

[0007] This invention provides a method for dynamic control of continuous casting rhythm. When the steelmaking production conditions change, the detection and calculation process can be automatically triggered, and based on the information of the entire steelmaking-continuous casting process, suggestions and warnings for adjusting the continuous casting rhythm can be generated to control the quality of finished products, stabilize the production rhythm, and reduce accidents and anomalies.

[0008] In a first aspect, the present invention provides a method for dynamic control of continuous casting rhythm, comprising: Based on the operating signals of the secondary steelmaking system equipment, update the actual process time and smelting status of each furnace. The incomplete furnaces in the smelting status query are used to calculate the estimated casting time of the uncast furnaces according to the typical casting speed, and the planned casting start and end time of the furnaces are calculated in a forward manner according to the actual process time. Based on steelmaking manufacturing standards and ladle transfer time, and combined with the planned start and end times of casting for each furnace, the start and end times of other processes and workstations are preset to form an initial scheduling plan. Define the calculation rules for the scheduling scheme evaluation function and the method for generating adjacent scheduling schemes; The initial scheduling scheme is optimized based on the calculation rules of the scheduling scheme evaluation function and the generation method of adjacent scheduling schemes to generate the final scheduling scheme. Continuous casting rhythm decision prompts are generated based on the final scheduling scheme.

[0009] In some instances, the process of querying the smelting status for incomplete heats involves calculating the estimated casting time for uncasted heats based on typical casting speeds, and then sequentially extrapolating the planned start and end times of the heats based on the actual process times. This includes: Obtain the current casting speed, current flow rate, and remaining weight of molten steel for the current casting furnace; The remaining casting time for the current casting heat is calculated based on the current casting speed, current flow rate, remaining weight of molten steel for the current casting heat, and weight per meter of steel grade for the current casting heat. Based on the current time and the remaining casting time for the current casting heat, the estimated casting end time for the current casting heat is calculated. Based on the steel grade per meter weight, typical casting speed, current flow rate, and expected casting weight of the remaining uncast heats, calculate the expected casting time of the remaining uncast heats. Based on the casting end time of the previous heat and the casting time of the remaining uncast heats, calculate the casting start and end times of the remaining uncast heats.

[0010] In some instances, the reference to steelmaking manufacturing standards and ladle transfer time, combined with the planned casting start and end times for each furnace, pre-sets the start and end times of other processes and workstations to form an initial scheduling plan, including: Let Px be the preceding process of the continuous casting process in the unfinished heat Hx; If the status of Px is in progress or completed, then update the unfinished heat Hx to the next heat and return to the previous step of the continuous casting process where Px is the unfinished heat Hx. If the status of Px is planned, the expected end time of Px is calculated by working backward from the planned start time of the process following Px and the standard value of the transfer time from Px to the process following Px. Based on the processing cycle standard of Px process and the expected end time of Px, the expected start time of Px is calculated backwards. Set Px's processing station to any enabled station; If Px has no preceding process, then update the incomplete casting heat Hx to the next heat and return to the step of setting Px to the preceding process of the continuous casting process of the incomplete casting heat Hx. Otherwise, update Px to the preceding process of Px.

[0011] In some instances, the rules for calculating the scheduling scheme evaluation function include: Define the evaluation function H=h(X), initialize the evaluation function H=0, and iterate through all unfinished processes Px in the unfinished casting batches; Obtain the casting machine priority coefficient fx for the casting cycle to which Px belongs. If it is a single casting machine, then fx=1. If Px has a preceding process and the transfer time from the preceding process to Px is less than the lower limit of the transfer cycle, with a difference of t units of time, then a penalty is imposed for insufficient transfer time: p1 is the transit time penalty coefficient; If Px is not a continuous casting process and the Px processing cycle is less than the lower limit of the standard cycle, with a difference of d units of time, then the penalty is insufficient processing cycle: p2 is the processing cycle penalty coefficient; If Px is not a continuous casting process and its time overlaps with that of another process Py at the same station (the overlap time is c units of time), and the priority coefficient of the casting machine for the casting cycle to which Py belongs is fy, then a station conflict penalty is applied. p3 is the time conflict penalty system; if it is a single casting machine, then fy=1. If Px is a continuous casting process and there is a time interval / overlap between Px and the previous continuous casting process, with a duration of g units of time, then the penalty for the continuous casting interval is: p4 is the continuous casting interval penalty coefficient; If Px is a continuous casting process and the Px cycle is greater than the typical casting speed and full-flow casting cycle, with a deviation of dc unit time, then the penalty for adjusting the continuous casting cycle time is: p5 is the continuous casting cycle penalty coefficient.

[0012] In some instances, the method for generating adjacent scheduling schemes includes: Define an adjacent scheme Xnbr=f(X,n), where X is the set of unfinished casting batches. An adjacent scheme Xnbr of X is defined as follows: Assign a deep copy of X to Xnbr; randomly generate an integer x in the range [1, n] using the average probability distribution, where n is the upper limit of the number of processes to be adjusted in a single operation; enter the loop, with the number of loops being x; randomly select a process Px in Xnbr that is in the planned state using the average probability distribution; if Px is not a continuous casting process, randomly select the adjustment factors of Px using the average probability distribution and make the following adjustments: change the Px station to a random station of the same process; randomly generate an increment d in the range [-1, 1] using the average probability distribution, update the processing cycle of Px, and ensure that the Px station and the transfer time of the preceding and following processes remain unchanged; if Px has a preceding process, randomly generate an increment t in the range [-1, 1] using the average probability distribution, update the transfer time of Px and the preceding process, and ensure that the Px processing cycle and the transfer time of the following process remain unchanged; If Px is a continuous casting process, the adjustment factors for Px are randomly selected using a weighted distribution and adjusted as follows: Obtain the current set casting speed Vx for Px, assuming the typical casting speed of Px is Vstd and the lower limit of the casting speed is Vmin; randomly generate the casting speed adjustment value Dv = -dv or dv using an average probability distribution, where dv is the casting speed adjustment step size; update Vx = max(Vmin, min(Vstd, Vx + Dv)); recalculate the casting time and casting end time of Px; obtain the current set flow rate for Px, assuming the lower limit of the flow rate of Px is Smin; update the set flow rate of Px Sx = max(Sx - 1, Smin); update the set flow rate of subsequent continuous casting processes Sy = min(Sx, Sy); recalculate the cycle and start and end times of all continuous casting processes after the casting speed / flow rate adjustment, ensuring that the time interval between adjacent continuous casting processes is 0; Update the start time of other processes to ensure that the transfer cycle between processes remains unchanged; end the loop and obtain the adjacent scheme Xnbr.

[0013] In some instances, the optimization of the initial scheduling scheme based on the calculation rules of the scheduling scheme evaluation function and the generation method of adjacent scheduling schemes to generate the final scheduling scheme includes: Initialize the upper limit n of the number of adjustment processes generated by adjacent schemes, and initialize the calculation end judgment condition jmax. If no better scheme is found for jmax consecutive loops, the calculation ends. Let the current solution Xcurr=X, calculate the evaluation function Hcurr=h(Xcurr); Let the loop count i = 0, the interval from the last update loop j = 0, update i = i + 1, and update n = max(1, ni / 1000); Generate neighboring schemes Xcurr Xnbr=f(Xcurr,n), and calculate the evaluation function Hnbr=h(Xnbr); If Hnbr>Hcurr, then Xcurr=Xnbr, Hcurr=Hnbr, j=0, return to the step of updating i=i+1 and updating n=max(1,n-i / 1000); If Hnbr<=Hcurr, then j=j+1, and if j<jmax, return to the step of updating i=i+1 and updating n=max(1,n-i / 1000); Obtain the final solution Xfinal=Xcurr.

[0014] In some examples, the generating of the continuous casting rhythm decision prompt according to the final scheduling solution includes: If there are cases where the processing period is below the lower limit, the transfer time is below the lower limit, process conflict, and continuous casting time interval in Xfinal, a shutdown prompt is issued; If there are no cases where the processing period is below the lower limit, the transfer time is below the lower limit, process conflict, and continuous casting time interval in Xfinal, then set the casting speed and the number of strands according to Xfinal, and issue a continuous casting rhythm prompt.

[0015] In a second aspect, the present invention provides a computer device, comprising a memory, a processor, and a computer program stored on the memory and operable on the processor, wherein the processor implements the steps of any one of the methods described above when executing the computer program.

[0016] In a third aspect, the present invention provides a computer-readable storage medium having a computer program stored thereon, wherein the computer program, when executed by a processor, implements the steps of any one of the methods described above.

[0017] In general, compared with the prior art, the above technical solutions conceived by the present invention can achieve the following beneficial effects: (1) When the working conditions of steelmaking production change, the detection and calculation process can be automatically triggered, and based on the whole process information of steelmaking-continuous casting, continuous casting rhythm adjustment suggestions and early warnings are generated, so as to control the finished product quality, stabilize the production rhythm, and reduce abnormal accidents.

[0018] (2) The whole process is automated, and the calculation process is triggered by automatically monitoring the change of production conditions, so as to update the continuous casting rhythm adjustment prompt in real time.

[0019] (3) The continuous casting rhythm adjustment suggestions are given from the perspective of the overall steelmaking scheduling, and the consideration factors include the production rhythm of each steelmaking process, the process manufacturing standards, and the ladle turnover time.

[0020] (4) It is applicable to multi-caster production scenarios, which involves the setting of production guarantee priority for casters and the joint adjustment of caster rhythms.

[0021] (5) Reduce computation time and improve result quality at the algorithm level. As the number of iterations increases, the search method gradually changes from exploration to exploit. Attached Figure Description

[0022] To more clearly illustrate the technical solutions in the embodiments of the present invention, the accompanying drawings used in the description of the embodiments will be briefly introduced below. Obviously, the accompanying drawings described below are only some embodiments of the present invention. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0023] Figure 1 This is a schematic diagram of the continuous casting rhythm dynamic control method provided in an embodiment of the present invention; Figure 2 This is a flowchart of the continuous casting rhythm optimization calculation provided in an embodiment of the present invention; Figure 3 This is a flowchart of the calculation evaluation function provided in the embodiments of the present invention; Figure 4 This is a flowchart of the neighbor generation scheme provided in an embodiment of the present invention; Figure 5 This is a schematic diagram of an embodiment of the computer device provided in this invention. Detailed Implementation

[0024] The technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of the present invention, and not all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of the present invention.

[0025] In the following description, specific embodiments of the invention will be illustrated with reference to steps and symbols performed by one or more computers, unless otherwise stated. Therefore, these steps and operations will be referred to several times as being performed by a computer, and computer execution as referred to herein includes operations by a computer processing unit representing electronic signals of data in a structured format. This operation transforms the data or maintains it at a location in the computer's memory system, which can be reconfigured or otherwise alter the operation of the computer in a manner well known to those skilled in the art. The data structure maintained by the data is the physical location of the memory, which has specific characteristics defined by the data format. However, the principles of the invention described above are not intended to be limiting, and those skilled in the art will understand that many of the following steps and operations can also be implemented in hardware.

[0026] The terms "module" or "unit" as used herein can be considered as software objects executing on the computing system. Different components, modules, engines, and services described herein can be considered as implementations on the computing system. The apparatus and methods described herein are preferably implemented in software, but can also be implemented in hardware, both of which are within the scope of this invention.

[0027] Those skilled in the art will understand that, unless specifically stated otherwise, the singular forms “a,” “an,” and “the” used herein may also include the plural forms. It should be further understood that the term “comprising” as used in this specification means the presence of features, integers, steps, operations, elements, and / or components, but does not exclude the presence or addition of one or more other features, integers, steps, operations, elements, components, and / or groups thereof. It should be understood that when we say an element is “connected” or “coupled” to another element, it can be directly connected or coupled to the other element, or there may be intermediate elements. Furthermore, “connected” or “coupled” as used herein can include wireless connections or wireless coupling. The term “and / or” as used herein includes all or any units and all combinations of one or more associated listed items.

[0028] In this embodiment of the invention, a method for dynamic control of continuous casting rhythm is provided, such as... Figure 1 As shown, it includes the following steps: S101: Based on the operating signals of the secondary steelmaking system equipment, update the actual process time and smelting status of each furnace. S102: Based on the smelting status query, the unfinished furnaces in the casting process are calculated according to the typical casting speed, and the planned casting start and end times of the furnaces are calculated in a forward manner according to the actual process time. S103: Refer to steelmaking manufacturing standards and ladle transfer time, and combine the start and end times of the planned casting of the furnace to preset the start and end times of other processes and work positions to form an initial scheduling plan; S104: Define the calculation rules for the scheduling scheme evaluation function and the method for generating adjacent scheduling schemes; S105: Optimize the initial scheduling scheme based on the calculation rules of the scheduling scheme evaluation function and the generation method of adjacent scheduling schemes to generate the final scheduling scheme; S106: Generate continuous casting rhythm decision prompts based on the final scheduling scheme.

[0029] In another embodiment of the present invention, the following situation 1 is provided: continuous casting rhythm control under single casting machine production conditions, such as... Figure 2 As shown: Let casting sequence C1={H1,H2,...,Hc,...,Hn} be the casting sequence currently being produced by caster M1, {H1,H2,...,Hc-1} has finished production, the current casting heat is Hc (c<n), the set of unfinished heats to be cast is X={Hc,...,Hn}, and n is the number of heats.

[0030] Step 1: Initialize the estimated casting start time and end time of all heats in X.

[0031] (1) Acquire real-time data of caster M1, including the current casting speed Vc (m / min / strand), the number of strands Sc (strand), and the remaining weight Wc (t) of molten steel to be cast for the heat Hc in process.

[0032] (2) Calculate the estimated casting end time Tend_c of Hc. Based on the meter weight Nc (t / m, which can be calculated according to the steel grade density and cross-section specification) of the Hc steel grade, calculate the remaining casting duration of Hc . According to the current time and the remaining casting duration Dc of Hc, calculate the estimated casting end time Tend_c of Hc.

[0033] (3) Calculate the casting start and end times of Hx (x=c+1, x=c+2,...,x=n) in sequence. Based on the meter weight Nx of the Hx steel grade, the typical casting speed Vx, the current number of strands Sc, and the estimated casting weight Wx, calculate the estimated casting duration of Hx . According to the casting end time of Hx-1 and the casting duration Dx of Hx, calculate the casting start time Tstart_x and end time Tend_x of Hx.

[0034] Step 2: Initialize the planned start and end times of the unfinished processes of the heat Hx (x=c, x=c+1,...,x=n) in sequence.

[0035] (1) Let Px be the previous process of the continuous casting process of heat Hx.

[0036] (2) If the status of Px is in progress or completed, Hx=Hx+1, and return to (1).

[0037] (3) If the status of Px is planned, back-deduce the estimated end time of Px according to the planned start time of the subsequent process of Px and the standard value of the transfer time from Px to the subsequent process.

[0038] (4) Back-deduce the estimated start time of Px according to the standard processing cycle of the Px process and the estimated end time of Px.

[0039] (5) Set the processing station of Px as any enabled station.

[0040] (6) If Px has no previous process, Hx=Hx+1, proceed to (1); otherwise, update Px to the previous process of Px.

[0041] A preliminary production plan, Xstart, has been developed for X. However, there may be practical problems in its execution, such as workstation conflicts. The workstations and time nodes of the plan need to be further optimized.

[0042] Step 3: Optimize the algorithm framework and define the evaluation function H=h(X). The evaluation function reflects the factors affecting the quality of the plan; the higher the evaluation function, the higher the plan quality. Factors affecting the quality of steelmaking production planning plans include: process processing cycle, inter-process transfer time, process time conflicts, casting interval, and casting rhythm (casting speed). In summary, if... Figure 3 As shown, the evaluation function can be defined as follows: (1) Initialize the evaluation function H=0.

[0043] (2) Traverse all unprocessed processes Px in X: 1. Penalty for insufficient transfer time: If Px has a preceding process, and the transfer time from the preceding process to Px is less than the lower limit of the transfer cycle, with a difference of t units of time, then a penalty for insufficient transfer time is imposed. p1 is the transit time penalty coefficient.

[0044] 2. Penalty processing cycle: If Px is not a continuous casting process, and the Px processing cycle is less than the lower limit of the standard cycle, with a difference of d units of time, then the penalty processing cycle is insufficient. p2 is the processing cycle penalty coefficient.

[0045] 3. Penalty for Time Conflict: If Px is not a continuous casting process, and Px overlaps with the time of other processes at the same station, with an overlap time of c units of time, then a station conflict penalty will be applied. p3 is the time conflict penalty coefficient.

[0046] 4. Penalty for continuous casting interval: If Px is a continuous casting process (Px is not the first furnace), and there is a time interval / overlap between Px and the previous continuous casting process, with a duration of g units of time, then the penalty for the continuous casting interval is: p4 is the continuous casting interval penalty coefficient.

[0047] 5. Penalty for Continuous Casting Cycle Adjustment: If Px is a continuous casting process, and the Px cycle is longer than the cycle of the main casting and full-flow casting processes, with a deviation of dc unit time, then the penalty for continuous casting cycle adjustment duration is as follows: p5 is the continuous casting cycle penalty coefficient.

[0048] (3) Return the evaluation function result H.

[0049] The penalty coefficient determines the severity of the penalty. During the execution of the casting schedule, time conflicts at workstations and continuous casting time intervals are considered production accidents, therefore p3 and p4 need to be set to higher values.

[0050] Step 4: Optimize the algorithm framework and define the adjacent solution Xnbr=f(X,n) Adjacent schemes reflect factors that can be adjusted during actual implementation, including process handling stations, process cycles, inter-process transfer times, and continuous casting speed. In summary, as... Figure 4 As shown, a neighboring scheme Xnbr of X can be defined as follows: (1) Assign a deep copy of X to Xnbr. A deep copy means that when copying an object, not only is the object itself copied, but all member variables of reference types inside the object are also copied recursively, resulting in a new object that is completely independent of the original object. Modifying any content of the new object (including nested sub-objects) will not affect the original object.

[0051] (2) An integer x in the range of [1, n] is randomly generated using the average probability distribution, where n is the upper limit of the number of processes to be adjusted in a single operation.

[0052] (3) Enter the loop, and the number of loops is x.

[0053] (4) Randomly select one process Px in Xnbr with a planned state using the average probability distribution.

[0054] (5) If Px is not a continuous casting process, the adjustment factors for Px are randomly selected and adjusted using the average probability distribution: 1. Processing station: Change the Px station to a random station with the same process.

[0055] 2. Processing cycle: The average probability distribution is randomly distributed in the interval [-1,1], and the increment d is used to update the processing cycle of Px (ensuring that the transfer time of Px station and the preceding and following processes remains unchanged).

[0056] 3. Transfer time: If Px has a previous process, the average probability distribution is randomly incremented by t in the interval [-1,1], and the transfer time between Px and the previous process is updated (ensuring that the processing cycle of Px and the transfer time of the subsequent process remain unchanged).

[0057] (6) If Px is a continuous casting process, the adjustment factors for Px are randomly selected using a weighted distribution and then adjusted: 1. Adjust the continuous casting speed (a) Obtain the current set pulling speed Vx of Px, and set the pulling speed of Px as Vstd and the lower limit of pulling speed as Vmin; (b) The average probability distribution random speed adjustment value Dv = -dv or dv (dv is the speed adjustment step size); (c) Update Vx = max(Vmin, min(Vstd, Vx + Dv)); (d) Recalculate the Px casting time and the Px casting end time; 2. Adjust the number of continuous casting strands (a) Obtain the currently set number of strands of Px, and set the lower limit of the number of strands of Px as Smin; (b) Update the set number of strands of Px as Sx=max(Sx-1, Smin); (c) Update the set number of strands Sy of the subsequent continuous casting process, where Sy=min(Sx, Sy); (7) After recalculating the adjustment of the casting speed / number of strands, recalculate the cycle, start time and end time of all continuous casting processes, so as to ensure that the time interval between adjacent continuous casting processes is 0.

[0058] (8) Update the start time of other processes to ensure that the transfer cycle between processes remains unchanged.

[0059] (9) End the loop and return the adjacent scheme Xnbr.

[0060] Step 5: Optimize Xstart using an optimization algorithm to form the final scheduling scheme Xfinal.

[0061] For the initial scheme Xstart generated through the above steps, as well as the defined evaluation function and adjacent schemes, the optimization algorithm for Xstart is as follows: (1) Initialize the upper limit n of the number of adjusted processes for adjacent scheme generation; initialize the calculation end judgment condition jmax, and end the calculation if no better scheme is found in jmax consecutive loops; (2) Set the current scheme Xcurr=X; (3) Calculate the evaluation function of Xcurr as Hcurr=h(Xcurr); (3) Set the number of loops i=0, and the loop interval j since the last update of the scheme j=0; (4) Start the loop; (5) Update i=i+1, and update n=max(1, n-i / 1000); (6) Generate the adjacent scheme Xnbr of Xcurr, where Xnbr=f(Xcurr, n); (7) Calculate the evaluation function of Xnbr as Hnbr=h(Xnbr); (8) If Hnbr>Hcurr, then Xcurr=Xnbr, Hcurr=Hnbr, j=0, and return to (5); (9) If Hnbr<=Hcurr, then j=j+1; if j<jmax, return to (5); (10) Return the final scheme Xfinal=Xcurr.

[0062] In step (5), for the upper limit n of the number of adjacent scheme adjustment processes, the algorithm decrements the upper limit n by 1 every 1000 cycles, so that the upper limit of the number of adjacent scheme adjustment processes decreases progressively. The purpose is to gradually shift the search mode from exploration to fine-tuning. In the early stage of algorithm iteration, a larger number of process adjustments will increase the adjustment range of the adjacent scheme to the current scheme, and improve the search breadth of the algorithm. In the later stage of iteration, the optimal features of the scheme have been basically determined, and it is necessary to gradually reduce the search granularity to determine the final scheme through fine-tuning.

[0063] Step 6: Generate continuous casting rhythm decision prompts according to the final scheme Xfinal Xfinal is the scheme with the highest evaluation function found by the optimization algorithm within limited resources. In the process of scheme optimization, the casting machine drawing speed and the adjustment of the number of strands are considered. By checking whether the scheme still has situations where the processing cycle is lower than the lower limit, the transfer time is lower than the lower limit, process conflicts, and continuous casting time intervals, the content of the continuous casting prompt information is determined: (1) If the above situation exists in Xfinal, a shutdown prompt is given; (2) If the above situation does not exist in Xfinal, set the drawing speed and the number of strands according to the scheme, and give a continuous casting rhythm prompt.

[0064] In another embodiment of the present invention, the following Case 2 is provided: continuous casting rhythm control under multi-casting machine production situations Taking dual-machine production as an example, it is assumed that casting sequence C1={H1a,...,H1m}(a<m) is the heats being cast and planned to be cast in the production casting sequence of casting machine M1, and C2={H2b,...,H2n}(b<n) is the heats being cast and planned to be cast in the production casting sequence of casting machine M2. The set of heats that have not been cast is X={H1a,...,H1m,H2b,...,H2n}. Combined with the on-site production guarantee priority of the casting machines, the system can give control suggestions for all enabled casting machines.

[0065] Step 1: Generate the initial scheme of X according to Step 1 and Step 2 in Case 1.

[0066] Step 2: Define the evaluation function, and the penalty coefficient needs to be adjusted in combination with the production guarantee priority of the casting machine: (1) Initialize the evaluation function H=0.

[0067] (2) Traverse all unproduced processes Px of all heats in X: 1. Obtain the casting machine priority coefficient fx of the casting sequence to which Px belongs (the higher the production guarantee priority of the casting machine, the larger the coefficient); 2. Penalty for transfer time: If Px has a previous process, and the transfer time from the previous process to the Px process is lower than the lower limit of the transfer cycle, and the difference is t unit time, then the insufficient transfer time is penalized: , where p1 is the transfer time penalty coefficient.

[0068] 3. Penalty processing cycle: If Px is not a continuous casting process, and the Px processing cycle is less than the lower limit of the standard cycle, with a difference of d units of time, then the penalty processing cycle is insufficient. p2 is the processing cycle penalty coefficient.

[0069] 4. Penalty for Time Conflict: If Px is not a continuous casting process, and Px overlaps with the time of another process Py at the same station, with an overlap time of c units of time, and the priority coefficient of the casting machine for the casting cycle to which Py belongs is fy, then a penalty for station conflict will be imposed. p3 is the time conflict penalty coefficient.

[0070] 5. Penalty for continuous casting interval: If Px is a continuous casting process (Px is not the first furnace), and there is a time interval / overlap between Px and the previous continuous casting process, with a duration of g units of time, then the penalty for the continuous casting interval is: p4 is the continuous casting interval penalty coefficient.

[0071] 6. Penalty for Continuous Casting Cycle Adjustment: If Px is a continuous casting process, and the Px cycle is longer than the cycle of the main casting and full-flow casting processes, with a deviation of dc unit time, then the penalty for continuous casting cycle adjustment duration is: p5 is the continuous casting cycle penalty coefficient.

[0072] (3) Return the evaluation function result H.

[0073] Step 3: Based on steps 1-4 and 5, optimize the initial solution Xstart to obtain the final solution Xfinal.

[0074] Step 4: Based on steps 1-6, generate continuous casting rhythm prompts using Xfinal.

[0075] In another embodiment of the present invention, a computer device is also provided, such as... Figure 5 As shown, it illustrates a structural schematic diagram of a computer device involved in an embodiment of the present invention, specifically: The computer device may include components such as a processor 501 with one or more processing cores, a memory 502 with one or more computer-readable storage media, a power supply 503, and an input unit 504. Those skilled in the art will understand that... Figure 5 The computer device structure shown does not constitute a limitation on the computer device and may include more or fewer components than shown, or combine certain components, or have different component arrangements. Wherein: The processor 501 is the control center of the computer device. It connects various parts of the computer device via various interfaces and lines, and performs various functions and processes data by running or executing software programs and / or modules stored in the memory 502, and by calling data stored in the memory 502, thereby providing overall monitoring of the computer device. Optionally, the processor 501 may include one or more processing cores; preferably, the processor 501 may integrate an application processor and a modem processor, wherein the application processor mainly handles the operation of the storage medium, user interface, and application programs, and the modem processor mainly handles wireless communication. It is understood that the modem processor may also not be integrated into the processor 501.

[0076] The memory 502 can be used to store software programs and modules. The processor 501 executes various functional applications and data processing by running the software programs and modules stored in the memory 502. The memory 502 may mainly include a program storage area and a data storage area. The program storage area may store applications required for operating the storage medium and at least one function (such as sound playback function, image playback function, etc.); the data storage area may store data created according to the use of the computer device. In addition, the memory 502 may include high-speed random access memory and may also include non-volatile memory, such as at least one disk storage device, flash memory device, or other volatile solid-state storage device. Accordingly, the memory 502 may also include a controller to provide the processor 501 with access to the memory 502.

[0077] The computer device also includes a power supply 503 that supplies power to various components. Preferably, the power supply 503 can be logically connected to the processor 501 via a power management storage medium, thereby enabling functions such as charging, discharging, and power consumption management through the power management storage medium. The power supply 503 may also include one or more DC or AC power supplies, recharge storage media, power fault detection circuits, power converters or inverters, power status indicators, and other arbitrary components.

[0078] The computer device may also include an input unit 504, which can be used to receive input digital or character information and generate keyboard, mouse, joystick, optical or trackball signal inputs related to user settings and function control.

[0079] Although not shown, the computer device may also include a display unit, etc., which will not be described in detail here. Specifically, in this embodiment, the processor 501 in the computer device loads the executable files corresponding to the processes of one or more applications into the memory 502 according to the following instructions, and the processor 501 runs the applications stored in the memory 502, thereby implementing the steps in the above method embodiment.

[0080] Those skilled in the art will understand that all or part of the steps in the various methods of the above embodiments can be performed by instructions, or by instructions controlling related hardware. These instructions can be stored in a computer-readable storage medium and loaded and executed by a processor.

[0081] Therefore, embodiments of the present invention provide a computer-readable storage medium having a computer program stored thereon, the computer program being loaded by a processor to execute the steps of any method provided in the embodiments of the present invention.

[0082] For details on the implementation of each of the above operations, please refer to the previous examples, which will not be repeated here.

[0083] The computer-readable storage medium may include: read-only memory (ROM), random access memory (RAM), disk or optical disk, etc.

[0084] Since the computer program stored in the computer-readable storage medium can execute the steps of any of the methods provided in the embodiments of the present invention, the beneficial effects that any of the methods provided in the embodiments of the present invention can achieve can be realized, as detailed in the preceding embodiments, and will not be repeated here.

[0085] The above provides a detailed description of the continuous casting rhythm dynamic control method, equipment, and medium provided by the embodiments of the present invention. Specific examples have been used to illustrate the principles and implementation methods of the present invention. The description of the above embodiments is only for the purpose of helping to understand the method and core ideas of the present invention. At the same time, for those skilled in the art, there will be changes in the specific implementation methods and application scope based on the ideas of the present invention. Therefore, the content of this specification should not be construed as a limitation of the present invention.

Claims

1. A method for dynamic control of continuous casting rhythm, characterized in that, include: Based on the operating signals of the secondary steelmaking system equipment, update the actual process time and smelting status of each furnace. The incomplete furnaces in the smelting status query are used to calculate the estimated casting time of the uncast furnaces according to the typical casting speed, and the planned casting start and end time of the furnaces are calculated in a forward manner according to the actual process time. Referring to steelmaking manufacturing standards and ladle transfer time, and combining the planned casting start and end times of each heat, the initial scheduling scheme Xstart is formed by pre-setting the start and end times and workstations of other processes. This scheme includes: setting Px as the previous process of the continuous casting process for the heat Hx that has not yet been completed; if Px is in progress or completed, then update the heat Hx that has not yet been completed to the next heat, and return to the step of setting Px as the previous process of the continuous casting process for the heat Hx that has not yet been completed; if Px is in a planned state, calculate the expected end time of Px based on the planned start time of the subsequent process and the standard value of the transfer time from Px to the subsequent process; calculate the expected start time of Px based on the processing cycle standard of the Px process and the expected end time of Px; set the processing workstation of Px to any available workstation; if Px has no previous process, then update the heat Hx that has not yet been completed to the next heat, and return to the step of setting Px as the previous process of the continuous casting process for the heat Hx that has not yet been completed; otherwise, update Px to the previous process of Px. The calculation rules for the scheduling scheme evaluation function and the generation method for adjacent scheduling schemes are defined. The calculation rules for the scheduling scheme evaluation function include: defining an evaluation function H=h(X), where X is the set of unfinished casting batches; initializing the evaluation function H=0; traversing all unfinished processes Px of the unfinished casting batches; obtaining the casting machine priority coefficient fx of the casting batch to which Px belongs; if it is a single casting machine, then fx=1; if Px has a preceding process and the transfer time from the preceding process to the Px process is lower than the lower limit of the transfer cycle, with a difference of t units of time, then penalizing insufficient transfer time. p1 is the transfer time penalty coefficient; if Px is not a continuous casting process and the Px processing cycle is less than the lower limit of the standard cycle, the difference is d units of time, then the penalty is insufficient processing cycle: p2 is the processing cycle penalty coefficient; if Px is not a continuous casting process and Px overlaps with the time of other processes Py in the same station, with an overlap time of c units of time, and the casting machine priority coefficient of the casting cycle to which Py belongs is fy, then the station conflict is penalized: p3 is the time conflict penalty system. If it is a single casting machine, then fy=1; if Px is a continuous casting process and there is a time interval / overlap between Px and the previous continuous casting process, with a duration of g units of time, then the penalty for the continuous casting interval is: p4 is the continuous casting interval penalty coefficient; if Px is the continuous casting process and the Px cycle is greater than the typical casting speed and full-flow casting cycle, with a deviation of dc unit time, then the penalty is the continuous casting cycle adjustment time: p5 is the continuous casting cycle penalty coefficient; The adjacent scheme generation method of the scheduling scheme includes: defining an adjacent scheme Xnbr=f(X,n), where an adjacent scheme Xnbr of X is defined as follows: assigning a deep copy of X to Xnbr; randomly generating an integer x in the range [1,n] using an average probability distribution, where n is the upper limit of the number of processes to be adjusted in a single operation; entering a loop with the number of loops being x; randomly selecting a process Px in Xnbr that is in the planned state using an average probability distribution; if Px is not a continuous casting process, randomly selecting the adjustment factor of Px using an average probability distribution and making the following adjustments: changing the Px station to a random station of the same process; randomly generating an increment d in the range [-1,1] using an average probability distribution, updating the processing cycle of Px while ensuring that the Px station and the transfer time of the preceding and following processes remain unchanged; if Px has a preceding process, randomly generating an increment t in the range [-1,1] using an average probability distribution, updating the transfer time of Px and the preceding process while ensuring that the processing cycle of Px and the transfer time of the following process remain unchanged. If Px is a continuous casting process, the adjustment factors for Px are randomly selected using a weighted distribution and adjusted as follows: Obtain the current set casting speed Vx for Px, assuming the typical casting speed of Px is Vstd and the lower limit of the casting speed is Vmin; randomly generate the casting speed adjustment value Dv = -dv or dv using an average probability distribution, where dv is the casting speed adjustment step size; update Vx = max(Vmin, min(Vstd, Vx + Dv)); recalculate the casting time and casting end time of Px; obtain the current set flow rate for Px, assuming the lower limit of the flow rate of Px is Smin; update the set flow rate of Px Sx = max(Sx - 1, Smin); update the set flow rate of subsequent continuous casting processes Sy = min(Sx, Sy); recalculate the cycle and start and end times of all continuous casting processes after the casting speed / flow rate adjustment, ensuring that the time interval between adjacent continuous casting processes is 0; update the start time of other processes, ensuring that the transfer cycle between processes remains unchanged; end the loop and obtain the adjacent scheme Xnbr. Optimize the initial scheduling plan Xstart based on the scheduling plan evaluation function calculation rules and the adjacent plan generation method of the scheduling plan to generate the final scheduling plan Xfinal, which includes: initializing the upper limit n of the number of processes adjusted for adjacent plan generation, initializing the calculation end judgment condition jmax, and ending the calculation if no better plan is found in jmax consecutive cycles; setting the current plan Xcurr = Xstart, and calculating the evaluation function of Xcurr as Hcurr=h(Xcurr); setting the number of cycles i=0, the cycle interval from the last update j=0, updating i=i+1, updating n=max(1,n-i / 1000); generating the adjacent plan Xnbr of Xcurr as Xnbr=f(Xcurr,n), and calculating the evaluation function of Xnbr as Hnbr=h(Xnbr); if Hnbr>Hcurr, then Xcurr=Xnbr, Hcurr=Hnbr, j=0, and return to execute the steps of updating i=i+1 and updating n=max(1,n-i / 1000); if Hnbr<=Hcurr, then j=j+1, and if j<jmax, return to execute the steps of updating i=i+1 and updating n=max(1,n-i / 1000); the final plan Xfinal=Xcurr is obtained. Generate a continuous casting rhythm decision prompt according to the final scheduling plan.

2. The method according to claim 1, characterized in that, Query the uncompleted heats of the ongoing casting sequence through the smelting status, calculate the estimated casting duration of the uncast heats according to the typical casting speed, and sequentially deduce the planned casting start and end time of the heats in the forward direction according to the actual process time, including: Obtain the current casting speed of the caster, the current number of strands, and the remaining molten steel weight of the current casting heat. Calculate the remaining casting duration of the current casting heat according to the current casting speed of the caster, the current number of strands, the remaining molten steel weight of the current casting heat and the steel grade meter weight of the current casting heat, and calculate the estimated casting end time of the current casting heat based on the current time and the remaining casting duration of the current casting heat. Calculate the estimated casting duration of the remaining uncast heats according to the steel grade meter weight, typical casting speed, current number of strands and estimated casting weight of the remaining uncast heats, and calculate the casting start and end time of the remaining uncast heats according to the casting end time of the previous heat and the casting duration of the remaining uncast heats.

3. The method according to claim 2, characterized in that, Generating the continuous casting rhythm decision prompt according to the final scheduling plan includes: If there are situations in Xfinal where the processing cycle is lower than the lower limit, the transfer time is lower than the lower limit, process conflicts and continuous casting time intervals, a shutdown prompt is given. If there are no situations in Xfinal where the processing cycle is lower than the lower limit, the transfer time is lower than the lower limit, process conflicts and continuous casting time intervals, then set the casting speed and the number of strands according to Xfinal, and give a continuous casting rhythm prompt.

4. A computer device, comprising a memory, a processor and a computer program stored on the memory and operable on the processor, wherein the processor implements the steps of the method according to any one of claims 1 to 3 when executing the computer program.

5. A computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, implements the steps of the method according to any one of claims 1 to 3.

Images