Multi-stage finite adaptability robust optimization method and system guided by deterministic scene

Through the multi-stage limited adaptability robust optimization method guided by deterministic scenarios, the robust optimization challenges of multi-stage, decision-dependent and nonlinear production scheduling problems in the process industry are solved, and effective modeling of uncertain parameters and Efficient solution improves the robustness and applicability of production scheduling.

CN119087807AActive Publication Date: 2024-12-06CENT SOUTH UNIV

Patent Information

Application Number
CN202411202400.0
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-08-29
Publication Date
2024-12-06
Estimated Expiration
2044-08-29

AI Technical Summary

Technical Problem

When facing the multi-stage, decision-dependent and nonlinear production scheduling problems in the process industry, existing static robust optimization methods have too conservative, low inapplicability, and lack of consideration for time-variability and decision-dependentness of uncertainty sets. question.

Method used

Using a multi-stage finite adaptability robust optimization method guided by deterministic scenarios, we establish the nominal formula of uncertain parameters and the long-period mixed integer optimal control problem in deterministic scenarios. The initial decision-making scheme is solved using the control parameter vectorization method, the candidate solution is constructed, and the worst-case analysis method is converted into a finite-dimensional optimization problem.

Benefits of technology

It realizes efficient solution to the robust optimization model that depends on multi-stage decision-making in the process industry, reduces the conservatism and applicability of robust optimization, and is suitable for production scheduling problems with nonlinear constraints.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119087807A_ABST
    Figure CN119087807A_ABST
Patent Text Reader

Abstract

The invention relates to the field of process industry production scheduling and uncertainty optimization, and particularly discloses a deterministic scene-guided multi-stage finite adaptability robust optimization method, which comprises the following steps of: 1, determining a slow time-varying uncertainty problem in a production scheduling process, establishing a nominal formula of uncertain parameters and a long-period mixed integer optimal control problem in a deterministic scene; 2, a control parameter vectorization method is adopted to solve the deterministic mixed integer optimal control problem, and an initial decision scheme is obtained; and step 3, taking an initial decision scheme in a deterministic scene as a benchmark, adopting a candidate path generation algorithm to obtain a series of candidate solutions, constructing a candidate solution set and the like, establishing a robust optimization model for an uncertainty production scheduling process with multi-stage and decision dependence characteristics in the process industry, and providing an efficient solution method.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the technical field of production scheduling and uncertainty optimization, and in particular to a deterministic scenario-guided multi-stage finite adaptability robust optimization method, and also to a deterministic scenario-guided multi-stage finite adaptability robust optimization system. Background Art

[0002] In process industries, enterprises' production and operation often involve various uncertainties, such as fluctuations in raw material prices, fluctuations in demand, and sudden equipment failures. Uncertain factors are directly related to the safety, stability, and efficiency of the production process. In actual production processes, production scheduling is a key process to coordinate various processes in the production process, ensure the smooth implementation of production plans, and maximize production efficiency and quality. However, due to the long-term, dynamic, and multi-source uncertainty characteristics of industrial production processes, the effectiveness of scheduling decisions is often affected by multi-source uncertainties.

[0003] The uncertainty of industrial processes is a widely concerned issue in the field of production scheduling and uncertainty optimization. Robust optimization, as a common method for dealing with uncertainty problems, has been widely used in production scheduling processes such as crude oil scheduling optimization.

[0004] The commonly used robust optimization methods are mostly static robust optimization, where all decision variables are determined before the execution of the plan and scheduling, and will not be adjusted during the scheduling execution. However, the static robust optimization method has the following disadvantages:

[0005] First, since all decisions need to be determined in advance based on the worst-case scenario, there may be a problem of being too conservative;

[0006] Secondly, it lacks consideration of the time-varying nature of uncertainty sets and decision-making dependencies, and is not suitable for optimization scenarios involving binary variables, such as equipment maintenance cycle scheduling problems.

[0007] Finally, the applicability to production scheduling problems with nonlinear constraints is low, and developing robust optimization methods with multi-stage decision-dependency under uncertainty is one of the challenging problems facing process industries.

[0008] The robust optimization method with multi-stage decision dependence has three obvious properties: Property 1: the decision process contains multiple stages, and different stages correspond to different uncertainty sets, which are time-varying; Property 2: the decision and the range of values ​​of uncertainty parameters influence each other, and the construction of uncertainty sets is decision-dependent; Property 3: the production scheduling model is considered to have nonlinear scenarios. Based on Property 1, the multi-stage adjustable robust method enables variables to be adaptively adjusted after the uncertainty is observed, which alleviates the problem of conventional robust optimization being too conservative to a certain extent; Based on Property 2, the candidate solution set production algorithm and the finite adaptability method transform the infinite-dimensional robust optimization into a finite-dimensional problem by constructing multiple candidate paths and dividing the uncertainty set in advance; Based on Property 3, the dual reconstruction of the robust optimization model is avoided through the worst-case analysis method, so that the heuristic algorithm can be directly used to solve it. Summary of the invention

[0009] In view of this, the present invention provides a deterministic scenario-guided multi-stage finite adaptability robust optimization method for modeling and solving uncertain production scheduling processes with multi-stage and decision-dependent characteristics in process industries.

[0010] In order to achieve the above object, the basic scheme of the present invention provides a deterministic scenario-guided multi-stage limited adaptive robust optimization method, comprising the following steps:

[0011] Step 1: clarify the slow time-varying uncertainty problem in the production scheduling process, establish the nominal formula of the uncertainty parameters and the long-period mixed integer optimal control problem in the deterministic scenario;

[0012] Step 2, using the control parameter vectorization method to solve the deterministic mixed integer optimal control problem and obtain an initial decision solution;

[0013] Step 3: Based on the initial decision plan in the deterministic scenario, a candidate path generation algorithm is used to obtain a series of candidate solutions and construct a candidate solution set;

[0014] Step 4: Establish a multi-stage decision-dependent robust optimization model for the production scheduling process, construct an uncertainty set of slowly time-varying parameters, and at the same time, divide the uncertainty set of decision dependencies into finite partitions based on a finite adaptive algorithm to generate finite evolution paths of uncertainty parameters;

[0015] Step 5: For different evolution paths and time-varying uncertainty sets, the multi-stage robust optimization problem is solved based on the worst-case analysis method.

[0016] In one possible design, step 1 includes,

[0017] Step 1.1: Identify the key slow time-varying parameters that have a significant impact on system performance and have uncertainty during production scheduling Add to the performance degradation of the device over time to obtain the nominal formula:

[0018]

[0019] Where α(t)>0,λ(t)>0 are parameters that affect the degree and rate of parameter change, θ(t) is a slow time-varying parameter, and θ0 is the parameter value at the initial moment;

[0020] Step 1.2, considering the impact of slow time-varying parameters on system performance, establish a long-period mixed integer optimal control problem in a deterministic scenario:

[0021]

[0022] Where, the objective function J(·) consists of two parts: t∈[t0,t f ] and the terminal time t f The final value term φ0[x(t f )], x is the state variable, u is the binary decision variable, q is the continuous decision variable, θ is the slowly varying parameter, g(·) is the inequality constraint; F(·) is the state equation of the system, and U is the value range of the decision variable u.

[0023] In a possible design, step 2 includes transforming the dynamic optimization problem in a deterministic scenario into a finite-dimensional nonlinear programming problem by using the control parameter vectorization method, and converting the optimization period t∈[t0,t f ] is discretized into several intervals t0<t1<t2<…<t L-1 <t L , an approximation strategy based on piecewise constant functions, t l The distance between and t0 is described as:

[0024] t l =t0+l×(t f -t0) / L,l=0,1,...,L

[0025] At the same time, the control vector and the objective function are approximately expressed as:

[0026]

[0027] In the formula, u l (t) is the lth interval t∈[t l-1 ,t l ] is the approximate value of the control trajectory, X l (t) is a parameterized function whose value is:

[0028]

[0029] In a possible design, in step 3, guided by the decision of the deterministic scenario, a candidate path generation algorithm is defined to obtain a series of candidate solutions, construct a candidate solution set, and make full use of empirical knowledge to guide uncertainty optimization.

[0030] In a possible design, step 3 is specifically to obtain the optimal solution of the mixed integer optimal control problem in a deterministic scenario, and then use the optimal solution as a benchmark to obtain the candidate decision solution set in the lth stage through the candidate path generation algorithm.

[0031] In a possible design, in step 4, based on the time-varying characteristics of the uncertainty parameters and the decision dependencies, a multi-stage decision-dependent robust optimization model and a time-varying uncertainty set are established, and based on the candidate solution set and finite adaptive algorithm in step 3, the decision-dependent time-varying uncertainty set is segmented into finite-dimensional uncertain parameter evolution paths, providing a means for decomposing the decision-dependent robust optimization problem.

[0032] In one possible design, step 4 includes,

[0033] Step 4.1, considering the interdependence between decision and uncertainty set in the process of process industry production scheduling, a robust optimization model of multi-stage decision dependence and time-varying uncertainty set is established. The robust optimization model is

[0034]

[0035] In the formula, u 1 ,...,u L and q 1 ,...,q L is the decision from stage 1 to stage l, and u l ∈{0,1} N is a binary decision variable connecting two consecutive stages l and l+1. is the first stage (u l ,q l ) depends on u l-1 and l The cost function of each stage is defined as ξ l ∈Ξ l is the uncertainty vector of the first stage, and the uncertainty set in the first stage is represented by l Indicates that this depends on the decision variable u in the previous stage l-1 Without loss of generality, the uncertainty set is described by a polyhedral uncertainty set:

[0036]

[0037] In the formula, the parameter W∈R N×K and is the nominal value of the uncertainty vector at stage l, is the value of the uncertain parameter observed in stage l-1. It means element-wise multiplication, i.e., Schur product;

[0038] Step 4.2, based on the candidate solution set and finite adaptive algorithm guided by deterministic scenarios, the decision-dependent time-varying uncertainty set is divided into finite-dimensional uncertain parameter evolution paths:

[0039]

[0040] In the formula, is the uncertainty set of the p-th path in stage l; for the entire decision stage, the uncertainty set in the p-th path is defined as:

[0041]

[0042] In a possible design, in step 5, the multi-stage decision-dependent robust optimization model is converted into an optimization problem for solving the worst path, and the complex robust optimization is converted into an optimization problem that can be directly solved based on the worst-case analysis method.

[0043] In one possible design, step 5 is specifically as follows:

[0044] Step 5.1, through the deterministic scenario-guided limited adaptive method, the multi-stage decision-dependent robust optimization model is transformed into an optimization problem for solving the worst path:

[0045]

[0046] Where P is the set of all candidate paths;

[0047] Step 5.2, based on the worst-case analysis, convert the robust optimization into multiple deterministic optimization problems that can be solved directly:

[0048]

[0049] η f -ΔJ r0 ≤0

[0050] η g ≤0

[0051]

[0052] Where ηf is the objective robustness, which is used to measure the sensitivity of the objective function to uncertainty; η g is the constraint robustness, which is used to reflect the sensitivity of uncertainty constraints; f c Used to describe the value of the objective function.

[0053] The present invention provides a system, comprising a memory, a control processor, and a computer program stored in the memory and executable on the control processor, wherein the control processor executes the program to implement the deterministic scenario-guided multi-stage finite adaptive robust optimization method as described above.

[0054] Compared with the prior art, the present invention has the following beneficial effects:

[0055] The present invention establishes a robust optimization model and proposes an efficient solution method for the uncertain production scheduling process with multi-stage and decision-dependent characteristics in the process industry. The present invention takes into account the uncertainty problems with long periodicity, dynamics, decision-dependency and other characteristics in the process industry, and establishes a multi-stage decision-dependent robust optimization model for the production scheduling process. At the same time, by integrating the mixed integer optimal control process, a candidate path generation method for slow time-varying industrial processes is proposed. Guided by deterministic scenarios, multiple feasible paths are constructed using a finite adaptability method, and the complex multi-stage robust optimization problem is converted into a finite-dimensional optimization process. Furthermore, based on the worst-case analysis, the above-mentioned robust optimization problem is converted into a form that can be directly solved. BRIEF DESCRIPTION OF THE DRAWINGS

[0056] In order to more clearly illustrate the technical solutions in the embodiments of the present application, the drawings required for use in the description of the embodiments will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present application. For those skilled in the art, other drawings can be obtained based on these drawings without creative work.

[0057] Figure 1 shows a schematic diagram of an industrial crude oil heat exchanger network;

[0058] Figure 2 A schematic diagram of a process flow of a deterministic scenario-guided multi-stage limited adaptability robust optimization method proposed in an embodiment of the present application is shown;

[0059] Figure 3 Schematic diagrams of the scaling values ​​of each heat exchanger under deterministic and uncertain scenarios are shown, wherein Figures (a)-(e) are scaling trend diagrams of heat exchangers 1-5;

[0060] Figure 4Schematic diagrams of utility energy consumption under deterministic and uncertain scenarios are shown, where Figures (a)-(b) are schematic diagrams of energy consumption of cold fluids C1 and C2, and Figures (c)-(d) are schematic diagrams of energy consumption of hot fluids H1 and H2;

[0061] Figure 5 Schematic diagram of an immunoassay showing uncertain parameters. DETAILED DESCRIPTION

[0062] To further illustrate each embodiment, the present invention provides drawings, which are part of the disclosure of the present invention and are mainly used to illustrate the embodiments and can be used in conjunction with the relevant descriptions in the specification to explain the operating principles of the embodiments. With reference to these contents, ordinary technicians in the field should be able to understand other possible implementations and advantages of the present invention. The components in the figures are not drawn to scale, and similar component symbols are generally used to represent similar components.

[0063] A deterministic scenario-guided multi-stage finite adaptive robust optimization method is used to model and solve the uncertain production scheduling process with multi-stage and decision-dependent characteristics in the process industry. The energy management and cleaning scheduling problem of the heat exchanger network commonly used in the process industry heat transfer process is taken as an example. The schematic diagram of the process equipment is shown in Figure 1 As shown. The heat exchange network contains 2 hot streams and 2 cold streams, and heat is exchanged through the 5 heat exchangers listed. When a device is cleaned, the energy management of the entire heat exchange network will be reconstructed. In industrial applications, the hot stream is usually processed finished oil, namely H1 and H2 in the figure. On the other hand, the cold fluid is crude oil, namely C1 and C2, which need to be heated to a set temperature to meet the requirements of subsequent processing. In addition, C1 and C2 are coolers, which further cool the outlet temperature of the hot fluid to the target temperature. H1 and H2 are heaters, which are responsible for raising the temperature of the crude oil after heat exchange to the required value. Initially, the structure of the heat exchange network was determined in the design stage, and each heat transfer unit was equipped with its own heat load. However, as the equipment is running, the accumulation of scale inevitably leads to a continuous decrease in the heat transfer efficiency of the heat exchanger. Therefore, the energy consumption of the cooler and heater increases. In order to achieve the heat transfer target, we need to determine the cleaning plan for each heat exchanger and the additional heat required for C1, C2 and H1, H2 in each scheduling cycle.

[0064] The slow time-varying uncertainty parameter in the heat transfer process is the accumulated fouling value of the heat exchanger, which is difficult to measure online in industry, but has a great impact on the energy management and cleaning scheduling of the heat transfer process. This embodiment is a long-term production scheduling problem, which includes multiple decision-making stages. At the same time, the decision of cleaning and maintenance will directly affect the distribution of uncertainty parameters, which has decision dependence, and the heat transfer process has typical nonlinearity.

[0065] For the production scheduling problem under uncertain conditions, this embodiment adopts the following steps to model and solve:

[0066] Step 1: Establish the nominal formula of uncertainty parameters and the long-period mixed integer optimal control problem in a deterministic scenario; specifically,

[0067] Step 1.1, select the heat transfer coefficient with scaling accumulation as the key slow time-varying parameter, and obtain the nominal formula of the heat transfer coefficient as follows:

[0068]

[0069] Where U is the heat transfer coefficient and U0 is its initial value. Function Shows the accumulation of scale over time.

[0070] Step 1.2, considering the impact of scaling accumulation on heat transfer efficiency, establish a long-period mixed integer optimal control problem under deterministic scenarios:

[0071]

[0072] The objective function J(·) consists of two parts: t∈[t0,t f ] and the terminal time t f The final value term φ0[x(t f )], x is the state variable, u is the binary decision variable, q is the continuous decision variable, θ is the slowly varying parameter, g(·) is the inequality constraint; F(·) is the state equation of the system. U is the value range of the decision variable u.

[0073] Step 2: Use the control parameter vectorization method to transform the dynamic optimization problem in the deterministic scenario into a finite-dimensional nonlinear programming problem, and set the optimization period t∈[t0,t f ] is discretized into several intervals t0<t1<t2<…<t L-1 <t L . Based on the approximation strategy of piecewise constant function, t l The distance between and t0 is described as:

[0074] t l =t0+l×(t f -t0) / L,l=0,1,...,L

[0075] At the same time, the control vector and the objective function are approximately expressed as:

[0076]

[0077]

[0078] In the formula, ul (t) is the lth interval t∈[t l-1 ,t l ] is an approximation of the control trajectory in . l (t) is a parameterized function whose value is:

[0079]

[0080] Step 3: After obtaining the optimal solution of the mixed integer optimal control problem in a deterministic scenario, the candidate decision solution set in the first stage is obtained by using the candidate path generation algorithm based on the optimal solution.

[0081]

[0082] Step 4: Establish a multi-stage decision-dependent robust optimization model for the heat transfer process and construct an uncertainty set for scaling accumulation. At the same time, the decision-dependent uncertainty set is divided into finite partitions based on the finite adaptability algorithm to generate finite evolution paths for uncertainty parameters. Specifically,

[0083] Step 4.1, consider the interdependence between energy management and cleaning decisions and the fouling uncertainty set, and establish a time-varying uncertainty set:

[0084]

[0085] In the formula, and They represent the upper and lower bounds of the fouling value of the nth heat exchanger, respectively, and they are defined as:

[0086]

[0087] Step 4.2, based on the candidate solution set and finite adaptive algorithm guided by deterministic scenarios, the decision-dependent time-varying uncertainty set is divided into finite-dimensional uncertain parameter evolution paths:

[0088]

[0089] In the formula, is the uncertainty set of the p-th path in stage l. For the entire decision stage, the uncertainty set in the p-th path is defined as:

[0090]

[0091] Step 5: For different evolution paths of scaling parameters, the multi-stage robust optimization problem is solved based on the worst-case analysis method. Specifically,

[0092] Step 5.1, through the deterministic scenario-guided limited adaptive method, the multi-stage decision-dependent robust optimization model is transformed into an optimization problem for solving the worst path:

[0093]

[0094] Where P is the set of all candidate paths.

[0095] Step 5.2, based on the worst-case analysis, convert the robust optimization into multiple deterministic optimization problems that can be solved directly:

[0096]

[0097] η f -ΔJ r0 ≤0

[0098] η g ≤0

[0099]

[0100] Where η f is the objective robustness, which is used to measure the sensitivity of the objective function to uncertainty; η g is the constraint robustness, which is used to reflect the sensitivity of uncertainty constraints; f c Used to describe the value of the objective function.

[0101] Based on the same inventive concept, the present invention provides a multi-stage finite adaptability robust optimization method guided by a deterministic scenario. In a deterministic scenario, a group of candidate solutions are obtained according to a candidate path generation algorithm to construct a solution set, and then a robust optimization model in a multi-stage decision is constructed and solved using a finite adaptability algorithm. Then, a time-varying uncertainty set is constructed and a worst-case analysis strategy is used to transform the robust optimization problem. The method can model and solve the robust optimization problem that production scheduling relies on in multi-stage decisions under uncertainty conditions in process industries.

[0102] In this embodiment, Figure 3 The variation of the fouling value of each heat exchanger under deterministic and uncertain scenarios is shown. Figure 3 (a) to Figure 3 (e) shows the variation patterns of fouling values ​​of the five heat exchangers in deterministic and uncertain scenarios, respectively, which are related to the optimized cleaning decisions. Figure 3The worst-case decisions in (a) are at the 3rd, 5th, and 12th months, so the fouling curve has a clear downward trend (because the fouling is cleaned). The deterministic case is cleaned at the 3rd, 6th, and 12th month, respectively. The description of the remaining heat exchangers is similar. Significant differences can be observed between the results obtained in the worst-case and the deterministic cases, highlighting the significant impact of uncertainty on fouling behavior. In addition, the variation trend of fouling is intricately intertwined with the scheduling decisions, showing a clear dependency between fouling changes and decisions. The significant variation in fouling resistance values ​​between the worst-case and deterministic cases further emphasizes the need for a robust optimization approach that can adapt to the fluctuations in uncertain fouling to ensure optimal performance of the heat exchanger in practical applications.

[0103] In this embodiment, Figure 4 The energy consumption of the utility is shown for the worst-case and deterministic scenarios, where Figure 4 (a) to Figure 4 (d) shows the energy consumption of cold fluid C1, cold fluid C2, hot fluid H1, and hot fluid H2 in the deterministic and uncertain scenarios, respectively. These energy consumption changes are consistent with the optimized cleaning decision results, that is, Figure 3 The comparison shows that the worst-case energy scheduling is significantly robust and in line with the resilient design principle. The robust optimization method helps to mitigate the potential impact of uncertainty on the system and ensure a more resilient and adaptive energy management strategy.

[0104] In this embodiment, Figure 5 The results of the immunity test of uncertain parameters are presented, which further validates the effectiveness of the present invention in reducing uncertainty risks. In the immunity test of uncertain parameters, the present invention has an energy margin at the end of the scheduling cycle. This margin emphasizes the adaptability of the scheduling method in decision-making, especially when considering the worst-case scenario. Insufficient energy management reserves due to uncertainty may threaten the stability of the entire plant operation, thereby affecting production efficiency. In severe cases, the destruction of the thermal and electrical balance may lead to unforeseen production consequences.

[0105] The present invention also provides a deterministic scenario-guided multi-stage finite adaptive robust optimization system, comprising a memory, a control processor, and a computer program stored in the memory and executable on the control processor, wherein the control processor executes the program to implement the aforementioned deterministic scenario-guided multi-stage finite adaptive robust optimization method.

[0106] The present invention also provides a computer-readable storage medium, which stores computer-executable instructions, and the computer-executable instructions are used to enable a computer to implement the aforementioned deterministic scenario-guided multi-stage limited adaptive robust optimization method.

[0107] Although the above methods are illustrated and described as a series of actions for simplicity of explanation, it should be understood and appreciated that these methods are not limited by the order of the actions, because according to one or more embodiments, some actions may occur in different orders and / or concurrently with other actions from the illustrations and descriptions herein or not illustrated and described herein but understandable to those skilled in the art. It will be further appreciated by those skilled in the art that the various illustrative logic blocks, modules, circuits, and algorithm steps described in conjunction with the embodiments disclosed herein may be implemented as electronic hardware, computer software, or a combination of the two. To clearly explain this interchangeability of hardware and software, various illustrative components, frames, modules, circuits, and steps are generally described in the form of their functionality above. Whether such functionality is implemented as hardware or software depends on the specific application and the design constraints imposed on the overall system. The technical staff can implement the described functionality in different ways for each specific application, but such implementation decisions should not be interpreted as resulting in a departure from the scope of the present invention. The various illustrative logic blocks, modules, and circuits described in conjunction with the embodiments disclosed herein may be implemented or executed with a general purpose processor, a digital signal processor (DSP), an application specific integrated circuit (ASIC), a field programmable gate array (FPGA) or other programmable logic device, discrete gate or transistor logic, discrete hardware components, or any combination thereof designed to perform the functions described herein. A general purpose processor may be a microprocessor, but in an alternative, the processor may be any conventional processor, a battery compartment control board, a micro-battery compartment control board, or a state machine. The processor may also be implemented as a combination of computing devices, such as a combination of a DSP and a microprocessor, multiple microprocessors, one or more microprocessors in cooperation with a DSP core, or any other such configuration. The steps of the methods or algorithms described in conjunction with the embodiments disclosed herein may be embodied directly in hardware, in a software module executed by a processor, or in a combination of the two. The software module may reside in RAM memory, flash memory, ROM memory, EPROM memory, EEPROM memory, registers, hard disk, removable disk, CD-ROM, or any other form of storage medium known in the art. An exemplary storage medium is coupled to a processor so that the processor can read and write information from / to the storage medium. In an alternative, the storage medium may be integrated into the processor. The processor and the storage medium may reside in an ASIC. The ASIC may reside in a user terminal. In an alternative, the processor and the storage medium may reside in a user terminal as discrete components. In one or more exemplary embodiments, the functions described may be implemented in hardware, software, firmware, or any combination thereof. If implemented as a computer program product in software, each function may be stored on a computer-readable medium or transmitted therefrom as one or more instructions or codes.Computer-readable media include both computer storage media and communication media, including any media that facilitates a computer program to be transferred from one place to another. Storage media can be any available media that can be accessed by a computer. As an example and not limitation, such computer-readable media may include RAM, ROM, EEPROM, CD-ROM or other optical disk storage, disk storage or other magnetic storage devices, or any other media that can be used to carry or store the agreed program code in the form of instructions or data structures and can be accessed by a computer. Any connection is also properly referred to as computer-readable media. For example, if software is transmitted from a web site, a central control computer, or other remote sources using coaxial cable, fiber optic cable, twisted pair, digital subscriber line (DSL), or wireless technologies such as infrared, radio, and microwaves, then the coaxial cable, fiber optic cable, twisted pair, DSL, or wireless technologies such as infrared, radio, and microwaves are included in the definition of medium. Disk and disc as used herein include compact disc (CD), laser disc, optical disc, digital versatile disc (DVD), floppy disk and Blu-ray disc, wherein disk often reproduces data magnetically, while disc reproduces data optically with lasers. Combinations of the above should also be included within the scope of computer-readable media.

[0108] Although the above methods are illustrated and described as a series of actions for simplicity of explanation, it should be understood and appreciated that these methods are not limited by the order of the actions, because according to one or more embodiments, some actions may occur in a different order and / or concurrently with other actions from those illustrated and described herein or not illustrated and described herein but understandable to those skilled in the art.

[0109] The above description is only a preferred embodiment of the present invention and does not limit the present invention in any form. Although the present invention has been disclosed as a preferred embodiment as above, it is not used to limit the present invention. Any technical personnel in this field can make some changes or modify the technical contents disclosed above into equivalent embodiments without departing from the scope of the technical solution of the present invention. However, any brief modifications, equivalent changes and modifications made to the above embodiments based on the technical essence of the present invention without departing from the content of the technical solution of the present invention are still within the scope of the technical solution of the present invention.

Claims

1. A deterministic scenario-guided multi-stage limited adaptive robust optimization method, characterized in that: The following steps are involved: Step 1: clarify the slow time-varying uncertainty problem in the production scheduling process, establish the nominal formula of the uncertainty parameters and the long-period mixed integer optimal control problem in the deterministic scenario; Step 2, using the control parameter vectorization method to solve the deterministic mixed integer optimal control problem and obtain an initial decision solution; Step 3: Based on the initial decision plan in the deterministic scenario, a candidate path generation algorithm is used to obtain a series of candidate solutions and construct a candidate solution set; Step 4: Establish a multi-stage decision-dependent robust optimization model for the production scheduling process, construct an uncertainty set of slowly time-varying parameters, and at the same time, divide the uncertainty set of decision dependencies into finite partitions based on a finite adaptive algorithm to generate finite evolution paths of uncertainty parameters; Step 5: For different evolution paths and time-varying uncertainty sets, the multi-stage robust optimization problem is solved based on the worst-case analysis method.

2. The deterministic scenario-guided multi-stage limited adaptive robust optimization method according to claim 1, characterized in that: Step 1 includes, Step 1.1: Identify the key slow time-varying parameters that have a significant impact on system performance and have uncertainty during production scheduling Add to the performance degradation of the device over time to obtain the nominal formula: In the formula, α(t) affects the degree of parameter change, and λ(t) affects the rate of parameter change. θ(t) is a slowly varying parameter, and θ0 is the parameter value at the initial moment; Step 1.2, considering the impact of slow time-varying parameters on system performance, establish the long-period mixed integer optimal control problem in a deterministic scenario, as shown in the following formula: g(x(t),u(t),q(t),θ(t),t)≤0,t0≤t≤t f u(t)∈U,U={0,1} Where, the objective function J(·) consists of two parts: t∈[t0,t f ] and the terminal time t f The final value term φ0[x(t f )], x is the state variable, u is the binary decision variable, q is the continuous decision variable, θ is the slowly varying parameter, g(·) is the inequality constraint; F(·) is the state equation of the system, and U is the value range of the decision variable u.

3. The deterministic scenario-guided multi-stage limited adaptive robust optimization method according to claim 2, characterized in that: Step 2 includes transforming the dynamic optimization problem in a deterministic scenario into a finite-dimensional nonlinear programming problem by using the control parameter vectorization method, and converting the optimization period t∈[t0,t f ] is discretized into several intervals t0<t1<t2<…<t L-1 <t L , an approximation strategy based on piecewise constant functions, t l The distance between and t0 is described as: t l =t0+l×(t f -t0) / L,l=0,1,...,L At the same time, the control vector and the objective function are approximately expressed as, In the formula, u l (t) is the lth interval t∈[t l-1 ,t l ] is the approximate value of the control trajectory, X l (t) is a parameterized function whose value is, 4. A deterministic scenario-guided multi-stage limited adaptive robust optimization method according to any one of claims 1 to 3, characterized in that: In step 3, guided by the decision of the deterministic scenario, a candidate path generation algorithm is defined to obtain a series of candidate solutions, construct a candidate solution set, and make full use of empirical knowledge to guide uncertainty optimization.

5. The deterministic scenario-guided multi-stage limited adaptive robust optimization method according to claim 4, characterized in that: Specifically, step 3 is to obtain the optimal solution of the mixed integer optimal control problem in a deterministic scenario, and then use the optimal solution as a benchmark to obtain the candidate decision solution set in the lth stage through the candidate path generation algorithm. Here p is the subscript of the path, which indicates the number of the evolutionary path.

6. The deterministic scenario-guided multi-stage limited adaptive robust optimization method according to claim 5, characterized in that: In step 4, based on the time-varying characteristics of the uncertainty parameters and the decision dependency, a multi-stage decision-dependent robust optimization model and a time-varying uncertainty set are established. Based on the candidate solution set and the finite adaptive algorithm in step 3, the decision-dependent time-varying uncertainty set is segmented into finite-dimensional uncertain parameter evolution paths, providing a means for decomposing the decision-dependent robust optimization problem.

7. A deterministic scenario-guided multi-stage limited adaptive robust optimization method according to claim 5 or 6, characterized in that: Step 4 includes, Step 4.1, considering the interdependence between decision and uncertainty set in the process of process industry production scheduling, a robust optimization model of multi-stage decision dependence and time-varying uncertainty set is established, where the robust optimization model is In the formula, u 1 ,...,u L and q 1 ,...,q L is the decision from stage 1 to stage l, and u l ∈{0,1} N is a binary decision variable connecting two consecutive stages l and l+1, is the feasible region of stage l (ul,ql), depending on u l-1 and ξl, the cost function of each stage is defined as ξ l ∈Ξ l is the uncertainty vector of the lth stage, and the uncertainty set in the lth stage is represented by Ξ l Indicates that this depends on the decision variable u in the previous stage l-1 ; Without loss of generality, the uncertainty set is described by a polyhedral uncertainty set: In the formula, the parameter W∈R N×K and is the nominal value of the uncertainty vector at stage l, is the value of the uncertain parameter observed in the l-1th stage, symbol It means element-wise multiplication, i.e., Schur product; Step 4.2, based on the candidate solution set and finite adaptive algorithm guided by deterministic scenarios, the decision-dependent time-varying uncertainty set is divided into finite-dimensional uncertain parameter evolution paths. In the formula, is the uncertainty set of the p-th path in stage l. For the entire decision stage, the uncertainty set in the p-th path is defined as:

8. The deterministic scenario-guided multi-stage limited adaptive robust optimization method according to claim 7, characterized in that: In step 5, the multi-stage decision-dependent robust optimization model is converted into an optimization problem for solving the worst path, and the complex robust optimization is converted into an optimization problem that can be directly solved based on the worst-case analysis method.

9. The deterministic scenario-guided multi-stage limited adaptive robust optimization method according to claim 8, characterized in that: Step 5 is specifically as follows: Step 5.1, through the deterministic scenario-guided limited adaptive method, the multi-stage decision-dependent robust optimization model is transformed into an optimization problem for solving the worst path: Where P is the set of all candidate paths; Step 5.2, based on the worst-case analysis, convert the complex robust optimization into an optimization problem that can be solved directly: or f -ΔJ r0 ≤0 or g ≤0 Where η f is the objective robustness, which is used to measure the sensitivity of the objective function to uncertainty; η g is the constraint robustness, which is used to reflect the sensitivity of uncertainty constraints; f c Used to describe the value of the objective function.

10. A system, characterized in that: It includes a memory, a control processor, and a computer program stored in the memory and executable on the control processor, wherein the control processor executes the program to implement the deterministic scenario-guided multi-stage finite adaptive robust optimization method as described in any one of claims 1 to 9.

Citation Information

Patent Citations

  • Robust single machine scheduling method based on interval uncertainty

    CN108181810A

  • Flexible power distribution network robust optimization scheduling method based on convex hull uncertainty set

    CN116599031A

  • Data-driven distributionally robust optimization

    US20140052408A1

Cited By

  • Robot hybrid intelligent self-adaptive control method and system adopting reinforcement learning

    CN120715906A