Power grid planning support method and power grid planning support system

The method and system provide robust power grid optimization by handling complex constraints and uncertainties through decomposition and constraint generation, facilitating effective power system planning despite the challenges posed by VRE integration.

JP2024163019AActive Publication Date: 2024-11-21HITACHI LTD
View PDF 7 Cites 0 Cited by

Patent Information

Application Number
JP2024062043
Authority / Receiving Office
JP · JP
Patent Type
Applications
Current Assignee / Owner
Priority Date
2023-05-11
Filing Date
2024-04-08
Publication Date
2024-11-21
Estimated Expiration
2044-04-08

AI Technical Summary

Technical Problem

The complexity of power grid optimization problems due to the integration of variable renewable energy sources (VRE) and the need to consider numerous reliability constraints and uncertainties in system planning hinder effective power grid planning.

Method used

A computer-implemented power system planning support method and system that includes receiving objective and constraint functions, performing optimization calculations, and displaying results, with features like decomposition methods and constraint generation to handle complex constraints and uncertainties.

Benefits of technology

Enables robust and efficient solutions to power grid optimization problems, allowing planners to continue their work by providing intermediate results and enabling iterative improvements even when final solutions cannot be obtained.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure 2024163019000001_ABST
    Figure 2024163019000001_ABST
Patent Text Reader

Abstract

To provides a method and a system for supporting power grid planning.SOLUTION: A power grid planning support method includes the steps of: (i) receiving an objective function, the objective function representing a quantity or parameter related to a power grid; (ii) receiving one or more constraint functions, the constraint functions representing constraints on the power grid, the objective function and the constraint functions together representing a model of the power grid; (iii) receiving input data related to the power grid; (iv) performing an optimization calculation defined by the model of the power grid and the input data; and (v) displaying a result of the optimization calculation.SELECTED DRAWING: Figure 2
Need to check novelty before this filing date? Find Prior Art

Description

[Technical field]

[0001] The present invention relates to a power system planning support method and a power system planning support system. [Background technology]

[0002] As energy production and supply transition to carbon neutrality, the demand for and adoption of variable renewable energy sources (VRE) is increasing. Intermittent generation by VRE, different characteristics between VRE and conventional synchronous generators (SG), and long-distance transmission due to the location of VRE and the location of demand are expected to reduce the reliability of the power grid.

[0003] It is therefore desirable to apply optimization techniques to general grid planning to provide the lowest-cost solution within planning-related constraints such as asset capacity, bus voltage ranges, and reliability criteria.

[0004] However, due to the large number of reliability issues brought about by the energy transition and the need to consider many scenarios depending on the grid planning uncertainties, the optimization problems are generally too complex to be solved efficiently. Without a solution, grid planners cannot continue planning the grid.

[0005] US Pat. No. 5,399,633 proposes an apparatus and method for optimizing the cost-effectiveness of grid expansion projects involving the conversion of retired generators to synchronous condensers. [Prior art documents] [Patent documents]

[0006] [Patent Document 1] JP 2022-142649 A Summary of the Invention [Problem to be solved by the invention]

[0007] The proposed method has an iterative process that includes contingency analysis, countermeasures study, benefit analysis, cost analysis, cost-benefit analysis, and transformation planning determination to identify the optimal solution.

[0008] However, as mentioned above, a huge number of patterns of grid conditions must be taken into account to ensure that the resulting solution is the best possible one. The large number of variables, combined with complex constraints related to power flows and reliability, makes convergence problematic.

[0009] The present disclosure has been made in light of the above considerations. [Means for solving the problem]

[0010] Thus, in a first aspect, an embodiment of the present invention provides a power system planning support method implemented on a computer, the method comprising the steps of: (i) receiving an objective function, the objective function representing a quantity or parameter related to the power grid; (ii) receiving one or more constraint functions, the constraint functions representing constraints on the power grid, the objective function and the constraint functions together representing a model of the power grid; (iii) receiving input data related to the power grid; (iv) performing an optimization calculation defined by the model of the power grid and the input data; (v) displaying the results of the optimization calculations.

[0011] Such methods allow grid planners to obtain robust solutions to grid optimization problems.

[0012] Steps (i) to (iii) may be performed in any order.

[0013] Steps (i)-(iii) and (v) may be performed on or using a graphical user interface (GUI).

[0014] The method may further include calculating one or more intermediate results if execution of the optimization calculation returns an indication that the optimization calculation cannot be completed. The method may further include indicating to a user that the optimization calculation cannot be completed and providing the calculated intermediate results to the user.

[0015] The method may further include receiving one or more overrides and / or edits to the constraint(s) received in step (ii), such that step (iv) is performed without the overriden constraint(s) and / or with edited constraint(s).

[0016] The method may further include applying a decomposition technique to the objective function to generate a plurality of sub-problems representing the objective function, where the plurality of sub-problems and the constraint functions represent a model of the power grid.

[0017] Step (ii) may further comprise receiving a plurality of constraint functions, and the method may further comprise receiving an order in which the constraint functions are to be applied.

[0018] The method may further include applying a constraint generation method to one or more of the constraint functions, the constraint generation method applying a subset of the constraints and sequentially adding additional constraints. The method may include receiving a priority for the subset of constraints and / or a maximum number of constraints to be generated at one time.

[0019] Step (i) includes receiving a definition of one or more variables, a definition of one or more constraints, and a definition of one or more datasets.

[0020] A reinforcement learning system can provide one or more constraint functions.

[0021] The method may further include receiving a request to perform a trial calculation prior to performing the optimization calculation, the method further including performing the trial calculation, the trial calculation indicating whether a perfect solution is expected from the optimization calculation defined by the model of the power grid and the input data.

[0022] In a second aspect, an embodiment of the present invention provides a power system planning support system, the system including one or more processors and a memory, the memory including machine executable instructions that, when executed on the processor, cause the processor to perform the following: (i) receiving an objective function, the objective function representing a quantity or parameter related to the power grid; (ii) receiving one or more constraint functions, each constraint function representing a constraint on the power grid, the objective function and the constraint functions together representing a model of the power grid; (iii) receiving input data regarding the power grid; (iv) performing optimization calculations defined by the power grid model and input data; (v) Display the results of the optimization calculation. Steps (i) to (iii) may be performed in any order.

[0023] The machine-executable instructions may cause the processor to calculate one or more intermediate results if execution of the optimization computation results in an indication that the optimization computation cannot be completed. The machine-executable instructions can cause the processor to indicate to a user that the optimization computation cannot be completed and to provide the user with computed intermediate results.

[0024] The machine-executable instructions may cause the processor to receive one or more overrides and / or edits to the constraint(s) received in step (ii), such that step (iv) is performed without the overridden constraint(s) and / or with the edited constraint(s).

[0025] The machine-executable instructions can cause the processor to apply a decomposition method to the objective function and the constraint functions to arrive at a number of sub-problems representing the objective function, where the multiple sub-problems having the decomposed objective function and constraint functions represent a model of the power grid.

[0026] Step (ii) may include receiving a plurality of constraint functions, the method further including receiving an order in which the constraint functions are to be applied.

[0027] The machine-executable instructions may cause the processor to apply a constraint generation method to one or more of the constraint functions, where the constraint generation method applies a subset of the constraints and sequentially adds additional constraints. The machine-executable instructions may cause the processor to receive a priority for the subset of constraints and / or a maximum number of constraints to be generated at one time.

[0028] Step (i) may include receiving definitions of one or more variables, definitions of one or more constants, and definitions of one or more datasets.

[0029] The reinforcement learning system may provide one or more of the constraint functions and / or constraint application methods.

[0030] The machine-executable instructions can cause the processor to receive a request to perform a trial calculation prior to performing the optimization calculation, the method further including performing the trial calculation, the trial calculation indicating whether a perfect solution is expected from the optimization calculation defined by the model of the power grid and the input data.

[0031] The present invention includes combinations of the described embodiments and preferred features unless such combinations are expressly not permitted or explicitly avoided.

[0032] Further aspects of the present invention provide a computer program comprising code which, when executed on a computer, causes the computer to perform the method of the first aspect, a computer readable medium storing a computer program comprising code which, when executed on a computer, causes the computer to perform the method of the first aspect, and a computer system programmed to perform the method of the first aspect. Effect of the Invention

[0033] The present invention allows power grid planners to obtain robust solutions to power grid optimization problems.

[0034] In addition, the user or the system can define the decomposition of the original optimization problem, including the constraint application method, and the process flow for solving the decomposed problem collaboratively, and can obtain the optimal solution from the decomposed problem collaboratively and robustly instead of directly solving the original problem.Even if the final result cannot be obtained (such as in a numerical problem), the user or an external system can make a decision on the next process based on the intermediate results by using the output interface for calculation intermediate results and constraint violations and the calculation intermediate result database.

[0035] In addition, users or external systems can edit the decomposition definition of the original problem based on the intermediate results of the output calculation, and then rerun the optimization calculation to obtain a better solution in the next calculation. Therefore, system planners can continue their planning work because the decomposition definition allows them to robustly obtain the optimal solution for power system planning within the expected value.

[0036] Even if an optimal solution cannot be obtained, it is possible to make a judgment based on intermediate calculation results, change the decomposition definition and rerun the optimization calculation, or otherwise attempt to obtain an optimal solution. [Brief description of the drawings]

[0037] [Figure 1] FIG. 1 is a diagram illustrating an example of a power system planning support system. [Diagram 2]FIG. 2 is a diagram illustrating an example of a processing module of the power guard plan support system. [Diagram 3] FIG. 3 is a diagram showing an example of the initial screen. [Figure 4] FIG. 4 is a diagram showing an example of the model management screen. [Diagram 5] FIG. 5 is a diagram showing an example of an objective function editing screen. [Figure 6] FIG. 6 is a diagram showing an example of a constraint editing screen. [Figure 7] FIG. 7 is a diagram showing an example of a constraint editing screen. [Figure 8] FIG. 8 is a diagram showing an example of a constraint editing screen. [Figure 9] FIG. 9 is a diagram showing an example of the constraint editing screen. [Figure 10] FIG. 10 is a diagram showing an example of the constraint editing screen. [Figure 11] FIG. 11 is a diagram showing an example of the constraint editing screen. [Figure 12] FIG. 12 is a diagram showing an example of the constraint editing screen. [Figure 13] FIG. 13 is a diagram showing an example of the constraint editing screen. [Figure 14] FIG. 14 is a diagram showing an example of the constraint editing screen. [Figure 15] FIG. 15 is a diagram showing an example of a constraint editing screen. [Figure 16] FIG. 16 is a diagram showing an example of a constraint editing screen. [Figure 17] FIG. 17 is a diagram showing an example of a constraint editing screen. [Figure 18] FIG. 18 is a diagram showing an example of a model detail setting screen. [Figure 19] FIG. 19 is a diagram showing an example of the variable management sub-screen. [Figure 20] FIG. 20 is a diagram showing an example of the constant management sub screen. [Figure 21] FIG. 21 is a diagram showing an example of the set management subscreen. [Figure 22] FIG. 22 is a diagram showing an example of the constraint management sub-screen. [Figure 23] FIG. 23 is a diagram showing an example of the data management screen. [Figure 24] FIG. 24 is a diagram showing an example of the data management screen after data mapping. [Diagram 25] FIG. 25 is a diagram showing an example of an input file provided to the power system planning support system. [Figure 26] FIG. 26 is a diagram showing an example of the final result screen. [Figure 27] FIG. 27 is a diagram showing an example of the arrangement result sub-screen. [Figure 28] FIG. 28 is a diagram showing an example of the operation result sub-screen. [Figure 29] FIG. 29 is a diagram showing a further example of the model management screen. [Diagram 30] FIG. 30 is a diagram showing a further example of the constraint editing screen. [Diagram 31] FIG. 31 is a diagram showing an example of a drop-down list on the model management screen. [Diagram 32] FIG. 32 is a diagram showing an example of the model management screen after a constraint application method is selected. [Diagram 33] FIG. 33 is a diagram showing an example of the constraint management sub-screen after the order of constraint application methods has been set. [Diagram 34] FIG. 34 shows an example of the constraint generation property setting sub-screen. [Diagram 35] FIG. 35 shows an example of the Benders decomposition characteristic setting subscreen. [Diagram 36] FIG. 36 shows an example of a master problem definition screen. [Figure 37] FIG. 37 shows an example of a sub-problem definition screen before and after allocation. [Figure 38] FIG. 38 shows an example of a sub-problem definition screen before and after allocation. [Figure 39] FIG. 39 is a diagram showing an example of an objective function editing screen. [Diagram 40] FIG. 40 is a diagram showing an example of the interface definition screen. [Diagram 41] FIG. 41 shows a flow chart of the method. [Diagram 42] FIG. 42 shows a plot of calculation steps versus allowable error when the constraint application method is not applied. [Diagram 43] FIG. 43 shows plots of calculation steps against tolerance when applying two constraint application methods. [Diagram 44] FIG. 44 is a diagram showing an example of the intermediate result screen. [Diagram 45] FIG. 45 is a diagram showing an example of the arrangement result sub-screen. [Diagram 46] FIG. 46 is a diagram showing an example of the operation result sub-screen. [Figure 47] FIG. 47 shows an example of the Constraints and Violations sub-screen. [Figure 48] FIG. 48 shows an example of a detailed view of the Constraints and Violations sub-screen. [Figure 49] FIG. 49 is a diagram showing a further example of a system configuration. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

[0038] Aspects and embodiments of the present invention will now be described with reference to the accompanying figures. Further aspects and embodiments will be apparent to those skilled in the art.

[0039] Generally, it is composed of multiple modules including a calculation model database module, a calculation input database module, a calculation final result database module, as well as a model management module, a constraint application method database module, and a calculation intermediate result database module.

[0040] It also has an interface for inputting constraint conditions from a grid planner (user) or an external system, and for outputting intermediate calculation results and constraint violations to the planner or external system.

[0041] The constraint application method input interface, model management module, and constraint application method database module allow a user or an external system to edit how constraints are applied to solve an optimization problem.

[0042] Using these modules, a user or a system can define the decomposition of the original optimization problem, including the constraint application method, and the process flow for solving the decomposed problem collaboratively, and obtain the optimal solution from the decomposed problem collaboratively and robustly instead of directly solving the original problem. Robust optimization is a modeling technique for optimization problems and its solving method that returns reliable results even when the data defining the problem is inaccurate or uncertain. The output interface for calculation intermediate results and constraint violations, and the calculation intermediate result database allow users or external systems to make decisions on the next step based on the intermediate results, even when a final result cannot be obtained (such as in the case of a numerical problem).

[0043] In addition, users or external systems can edit the decomposition definition of the original problem based on the intermediate results of the output calculation, and then rerun the optimization calculation to obtain a better solution in the next calculation. Therefore, system planners can continue their planning work because the decomposition definition allows them to robustly obtain the optimal solution for power system planning within the expected value.

[0044] Even if an optimal solution cannot be obtained, it is possible to make a judgment based on intermediate calculation results, change the decomposition definition and rerun the optimization calculation, or otherwise attempt to obtain an optimal solution.

[0045] In the present embodiment, explanations may be given using mathematical expressions, but the symbols in the mathematical expressions may be simplified to represent symbols in the drawings that are correctly written.

[0046] FIG. 1 shows an example of a power system planning support system 1. The power system planning support system may also be called a power system planning support tool. In this example, the tool 1 is provided as a general computer having a central control unit 11, an arithmetic and logic unit 12, an input device 13, an output device 14, a main memory device 15, and an auxiliary memory device 16. These units are connected to each other via a computer bus 17. The auxiliary memory device 16 includes one or more databases 18 and one or more programs 19.

[0047] 2, a "processing module" is realized by the central control unit 11 loading a program stored in the auxiliary memory 16 into the main memory 15. The output unit 14 may consist of a display device or may be a component that provides output to a display device or other user terminal (to be displayed by the terminal).

[0048] 2 is a diagram showing an example of a processing module of the power grid planning support system. In this manner, the data flow, processing module, and processing flow are determined by the program 19. The power grid planning support tool 1 has an input module 201, an output module 202, a model management module 203, a calculation module 204, a calculation model database module 210, a calculation input database module 211, a constraint application method database module 212, a calculation intermediate result database module 213, and a calculation final result database module 214. When the power grid planning support system 1 is started, the output module 202 displays an initial screen 301.

[0049] 3 is an example of an initial screen 301. The initial screen 301 includes a new project button 310, a project load button 311, a project save button 312, an execution calculation button 313, a model management button 314, a data management button 315, and a trial calculation button 316. The new project button 310 is used to create a new project. Here, the "project" refers to a collection of models and input / output data related to optimization calculations related to power system planning operations.

[0050] The Load Project button 311 is used to load a previously saved project. The Save Project button 312 is utilized to save the current working project. The Run Calculation button 313 is utilized to execute an optimization calculation defined by a model and data. The Manage Model button 314 is utilized to open a Model Management screen 401 as shown in FIG. 4. The Manage Data button 315 is utilized to open a Data Management screen 2301 as shown in FIG. 23, which is utilized to set parameters and load data. The Trial Calculation button 316 is utilized to check the validity of a user-defined model by calculating the initial few steps of the optimization problem.

[0051] 4 is an example of a model management screen 401. The model management screen 401 includes a model load button 410, a model save button 411, a model details button 412, a close button 413, an objective function edit button 414, a constraint edit button 415, a disable button 416, a constraint add button 417, a constraint application method add dropdown button 418, an objective function table 420, and a constraint table 421. The model load button 410 is used to load a template model or a previously saved model. The model save button 411 is used to save the current working model. The model details button 412 is utilized to open a model details setting screen 1801 for setting model details related to the constraint application method.

[0052] The close button 413 is used to close the model management screen 401. The edit objective function button 414 is used to open the edit objective function screen 501 shown in FIG.

[0053] The Edit Constraints button 415 is used to open the Edit Constraints screen 601 shown in Figures 6-17 and is used to edit the model shown in the Constraints table 421. The Disable button 416 is used to disable one or more constraints shown in the Constraints table 421. The Add Constraints button 417 is used to add a row to the Constraints table 421. The Constraint Application Method drop-down button 418 is used to open a list of possible constraint application methods. The Objective Functions table 420 shows the names of the objective functions for the current working model and the Constraints table 421 shows a list of the names of the constraints for the current working model.

[0054] As an example, the optimization problem for the allocation of reactive power sources is formulated as follows: The objective function of this problem includes the total cost obtained from the generation cost and the asset allocation cost. The total cost is formulated according to Equation 1.

[0055]

number

[0056] Here, a, b, and c are real constants representing the generation cost coefficients. P_g is a real variable that indicates the effective power generation of the generator. G and S are a set of generators and reactive power sources, respectively. C_dep is a real constant indicating the depreciation cost of the asset. u_s is an integer variable that indicates the asset placement state. In this example, us is u_sr and usyc:

[0057]

number

[0058] Here, u_sr and usyc are integer variables that indicate the placement status of the STATCOM (static synchronous compensator) and synchronous condenser, respectively. The constraints for this problem include power flow equations, power flow limits, reactive reserve requirements, short circuit level requirements, asset capacity constraints, asset deployment lead time constraints, asset removal prohibition constraints, and variable ranges and definitions. The power flows are calculated according to Equation 3.

[0059]

number

[0060] where is a complex variable indicating the bus voltage. Y is a complex constant representing the bus admittance of the power system. Y* is the complex conjugate of Y. Pg and Qg are real constants that represent the active and reactive power demands of the bus, respectively. Pg and Qg are real variables that respectively indicate the active and reactive power generation from the generator (gbus=m). Qs is a real variable that indicates reactive power generation from a reactive power source. Qs contains Qst, a real variable representing the reactive power generation from the STATCOM, and Qsyc, a real variable representing the reactive power from the synchronous condensers, calculated using equation 4:

[0061]

number

[0062] (Sbus) is the subset of reactive power sources connected to bus m. BUS is a set of buses, and TIME is a set of times. The set of reactive power sources is the sum of a set of STATCOM (ST) and synchronous condenser (SyC) as follows:

[0063]

number

[0064] The flow limit is formulated as several equations as follows:

[0065]

number

[0066]

number

[0067]

number

[0068]

number

[0069] Here, Yf and Yt are complex constants that represent the branch admittances of the power system. Fmax is a real constant that indicates the flow limit of the branch. BRANCH is a set of branches, and (l, m, n) is an element of BRANCH, indicating that branch l connects from bus m to bus n. The reactive power reserve requirement is formulated as follows:

[0070]

number

[0071]

number

[0072] Here, Qg max and Qg min are real constants indicating the maximum and minimum reactive power capacities of the generator, respectively. Qs max and Qs min are real constants that indicate the maximum and minimum reactive power capacities of the reactive power source, respectively. Qres+ and Q-res- are real constants that indicate the required reactive power reserve in the leading and lagging directions in the area, respectively. AREA is a collection of areas. {garea=a} denotes the subset of generators located in the region .Qres+. {Sarea=a} denotes the subset of reactive power sources within an area. The short circuit level requirements are formulated as a set of equations as follows:

[0073]

number

[0074]

number

[0075]

number

[0076]

number

[0077] Here, Z_ext denotes the complex variable that represents the extended impedance of the power grid. SCR_lim denotes a real constant indicating the limit of the short circuit ratio. Y_ext denotes a complex variable that indicates the extended bus admittance of the power system. I means identity matrix. x_(d_g)^' and x'_(d_SyC) are real constants representing the transient reactances of the generator and the synchronous condenser, respectively. {SyC_bus=m} means the subset of synchronous condensers connected to bus m. The asset capacity constraint is formulated as the following simultaneous equation:

[0078]

number

[0079]

number

[0080]

number

[0081]

number

[0082] And P_g^max and P_g^min are real constants indicating the maximum and minimum active power capacities of the generators, respectively. Q_ST^max and Q_ST^min are average real constants indicating the maximum and minimum reactive power capacities of the STATCOM, respectively; Q_SyC^max and Q_SyC^min are average real constants indicating the maximum and minimum reactive power capacities of the synchronous condenser, respectively. The lead-time constraint for asset allocation is formulated as follows:

[0083]

number

[0084] Here, C_LT is an integer constant that indicates the coefficient of the lead time condition of the reactive power source. For reactive power sources i, if t ≤ T_LT, the corresponding element is 1. If t>T_LT, the corresponding element is 0. The asset removal restriction is formulated as follows:

[0085]

number

[0086] The variable ranges and definitions are as follows:

[0087]

number

[0088]

number

[0089]

number

[0090]

number

[0091] Numbers 2 and 4 are also included in the variable range and definition. Here, VM and theta are real variables indicating the magnitude and angle of the bus voltage, respectively. are average real constants indicating the minimum and maximum values ​​of Vmin and Vmax, respectively. Vm, thetamin, and thetamax are constants indicating the minimum and maximum values ​​of theta, respectively. Us min and Us max are real constants indicating the minimum and maximum values ​​of Us, respectively.

[0092] These equations can be confirmed and edited on the objective function edit screen 501 and the constraint condition edit screen 601. When the user presses the objective function edit button 414 on the model management screen, the objective function edit screen 501 opens.

[0093] FIG. 5 is an example of an objective function editing screen 501, which has a close button 413, an objective function confirmation button 510, an add variable row button 511, a delete variable row button 512, an add constraint row button 513, a delete constraint row button 514, an add set row button 515, a delete set row button 516, an objective function name field 520, an objective function formulation field 521, a variable table 522, a constant table 523, and a set table 524.

[0094] The confirm objective function button 510 is utilized to overwrite the objective function model with the objective function name edited in the objective function name field 520, the formulation edited in the objective function formulation field 521, the variables edited in the variables table 522, the constants edited in the constants table 523, and the sets edited in the sets table 524.

[0095] An add variable row button 511, an add constraint row button 513, and an add set row button 515 are used to add rows to a variable table 522, a constant table 523, and a set table 524, respectively.

[0096] The delete variable row button 512, the delete constant row button 514, and the delete set row button 515 are used to delete rows from the variable table 522, the constant table 523, and the set table 524, respectively.

[0097] An objective function name field 520 indicates the name of the objective function, and an objective function formulation field 521 indicates the formulation of the objective function (for example, as described in [Mathematical Expression 1]). A variable table 522, a constant table 523, and a set table 524 indicate variables, constants, and sets included in the objective function. The objective function name in the objective function name field 520, the formulation in the objective function formulation field 521, the variables in the variable table 522, the constants in the constant table 523, and the sets in the set table 524 are editable.

[0098] Similarly, when the user presses the Edit Constraint button 415 on the model management screen, the Edit Constraint screen 601 for the corresponding constraint opens.

[0099] 6 to 16 are examples of constraint editing screens for each constraint. 6 is an example of a constraint editing screen 601 for a power flow equation. The constraint editing screen 601 has a close button 413, an add variable row button 511, a delete variable row button 512, an add constraint row button 513, a delete constant row button 514, an add set row button 515, a delete set row button 516, a confirm constraint button 610, a variable table 522, a constant table 523, a set table 524, a constraint name field 620, and a constraint formulation table 621.

[0100] The Check Constraints button 610 is utilized to overwrite the current constraint model with the edited constraint name on the constraint name field 620, the edited formulation on the constraint formulation table 621, the edited variables on the variables table 522, the edited constants on the constants table 523, and the edited sets on the sets possible 524. The constraint name field 620 indicates the corresponding constraint name. The constraint formulation table 621 indicates the formulation of the equations, for example as described in [Equation 3]. The variables table 522, the constants table 523, and the sets table 524 indicate the variables, constants, and sets included in the constraint. The constraint name on the constraint name field 520, the formulation on the constraint formulation field 621, the variables on the variables table 522, the constants on the constants table 523, and the sets on the sets table 524 are editable.

[0101] Figures 7 to 17 show examples of constraint editing screens 601 for power flow restrictions, reactive power reserve requirements, short circuit level requirements, asset capacity constraints, asset allocation lead time constraints, asset removal prohibition constraints, and variable range and definition constraints. Figures 7 and 8, 10 and 11, 12 and 13, and 16 and 17 are each the scrolled portion of the same screen.

[0102] When the user presses the model details button 412 on the model management screen 401, a model details setting screen 1801 opens.

[0103] 18 is an example of a model detail setting screen, which includes several common buttons and a subscreen area 1802. The common buttons are a variable management subscreen button 1811, a constant management subscreen button 1812, a set management subscreen button 1813, a constraint management subscreen button 1814, and the close button 413.

[0104] The variable management subscreen button 1811, the fixed management subscreen button 1912, the set management subscreen button 1813, and the constraint management subscreen button 1814 are used to display the variable management subscreen 1901, the fixed management subscreen 2001, the set management subscreen 2101, and the constraint management subscreen 2201, respectively, in the subscreen area 1802.

[0105] 19 is an example of a variable management sub-screen 1901 including a confirm button 1910 and a variable definition table 1920. The confirm button 1910 is used to confirm the variable definition edited on the variable definition table 1920 and update the current working model. The variable definition table 1920 has a variable row and a type row. The variable row shows a list of variables included in the current working model, and the type row shows a list of variable types such as integer, real number, complex number, etc. The elements of this row are editable to set the type of the variable.

[0106] 20 is an example of a constant management subscreen 2001, which includes a confirmation button 1910, a constant right move button 2010, a constant left move button 2011, a constant table (input from data) 2020, and a constant table (user defined) 2021. The constant right move button 2010 is used to move a selected constant from the constant table (input from data) 2020 to the constant table (user defined) 2021. The constant left move button 2011 is used to move a selected constant from the constant table (user defined) 2021 to the constant table (input from data) 2020. The constant table (input from data) 2020 shows a list of constants defined from input data. The constant table (input from data) 2021 has constant rows and definition rows. The constant row of the constant table (input from data) 2021 lists constants whose values ​​are defined from other constants. The definition row of the constants table (input from data) 2021 shows the definition of the constant, and the elements of this row are editable.

[0107] FIG. 21 shows an example of a set management sub-screen 2101, which includes a confirm button 1910, a set table (input from data) 2120, and a set table (user definition) 2121. The set table (input from data) 2120 is a list showing the elements of a set defined from input data. The set table (user defined) 2121 has set rows and definition rows. A set row in the set table (user defined) 2121 indicates a list of sets, whose elements are defined by other sets. A definition row in the set table (user defined) 2121 indicates the definition of a set, and the elements of this row are editable.

[0108] 22 is an example of a constraint management sub-screen 2201, which includes a constraint application method drop-down button 418, a constraint management category drop-down button 2210, and a constraint management category field 2220. The constraint management category drop-down button 2210 is utilized to select a category of constraint management. The constraint management category field 2220 indicates the selected category of constraint management. FIG. 22 shows an example in which the order of constraint application methods is selected as the constraint management category. In this case, a constraint application method order table 22221 used to set the order of the constraint application methods is displayed. A detailed method of using this sub-screen 2201 will be described below.

[0109] FIG. 23 shows an example of a data management screen 2301 , which includes a data set management sub-screen 2302 , an import button 2310 , a close button 413 , a data set drop-down button 2311 , an add data set button 2312 , and a data set name field 2321 . The import button 2310 is utilized to import data from a file specified in the file name file 2324 based on the mapping determined in the data mapping table 2325 . The dataset drop-down button 2311 is utilized to open a drop-down list for selecting a dataset for mapping. The add dataset button 2312 is utilized to add a new dataset. The dataset name field 2321 shows the name of the dataset selected by the drop-down list opened by the dataset drop-down button 2311. The data set management sub-screen 2302 includes a constant and set assignment button 2313 , an open explorer button 2313 , a constant table 2322 , a set table 2323 , a file name field 2324 , and a data mapping table 2325 . The constant and set assignment button 2313 is utilized to assign the selected constant and set in the constant table 2322 and set table 2323 . A constant table 2322 and a set table 2323 list constants and sets, respectively, whose elements are selectable. The open explorer button 2314 is utilized to open a file system explorer window for selecting an input file. The file name field 2324 shows the name of the file selected in the explorer window opened by the open explorer button 2314 . The data mapping table 2325 has a Set & Constraint column and an Input File column. When the user selects a constant in the constant table 2322 or a set in the set table 2323 and then presses the Constant / Set Assignment button, the selected constant or set is displayed in the Set / Constraint column of the data mapping table 2325. For each constant or set listed in the data mapping table 2325, the data placed in the input file should be specified in the input file location of the data mapping table 2325. The user can enter a column number or a row number as the location column element in the input file.

[0110] FIG. 24 is an example of the data management screen 2301 after data mapping. In this example, GenData 2501 in the input file is determined as shown in FIG.

[0111] After all data sets are set, the user can press the import button 2310 and the data will be imported from the file specified in the file name field 2324 based on the mapping determined in the data mapping table 2325 . The validated models and imported data sets are stored in a computational model database module 210 and a computational input database module 211, respectively. When the user presses the execute calculation button 313 after setting the model and data via the model management screen 401, objective function editing screen 501, constraint condition editing screen 601, model detailed setting screen 1801, and data management screen 2301, the calculation module 204 executes calculation using a solver, using the model from the calculation model database module 210 and the data from the calculation input database module 211. When the calculation is completed, the calculation result is displayed on the output screen.

[0112] 26 to 28 show examples of final result screens. Fig. 26 shows an example of a final result screen 2601, which has a final result sub-screen area 2602, a placement result button 2611, an operation result button 2612, an export button 2613, and a close button 413.

[0113] The placement result button 2611 is used to open the placement result sub-screen 2701. The operation result button 2612 is used to open the operation result sub-screen 2801, and the export button 2613 is used to export the result data for further analysis.

[0114] 27 shows an example of an allocation result subscreen 2701. The allocation result subscreen 2701 has a calendar button 2711, a total cost field 2721, a total allocation cost field 2722, a date field 2723, a network diagram field 2724, and an asset allocation plan table 2725. The total cost field 27211 indicates a comparison of the total cost with and without asset intervention. The total placement cost file 2722 shows a comparison of the total placement cost with and without asset intervention. The calendar button 2711 is used to select a date. The date field 2723 indicates the selected date. The network diagram field 2724 shows a network diagram in which assets are allocated based on the calculation results for the date specified in the date field 2723, and the asset allocation plan table 2725 shows an asset allocation plan including information on the date, location, and capacity from the calculation results.

[0115] 28 shows the operation of an operation result sub-screen 2801. The operation result sub-screen 2801 has a total cost file 2721, a total power generation cost field 2821, and a time-series power generation cost field 2822. The total power generation cost field 2821 indicates a comparison of the total power generation cost with and without asset intervention. The time-series power generation cost field 2822 indicates a comparison of time-series power generation costs with and without asset intervention. If the constraint application method is not specified on the model management screen 401, the defined problem is calculated as a single problem. In other words, the user can obtain the calculation result when the calculation is completed. Conversely, if the calculation is not completed (e.g., the calculation times out due to the numerical difficulty of the calculation), the user cannot obtain the calculation result.

[0116] To avoid such situations, users can disable constraints, edit them, or apply one or more constraint enforcement methods. If some constraints have lower priority than others, disabling them can improve the chances of completing the computation.

[0117] FIG. 29 shows the model management screen 401 when the user has disabled the reactive power reserve request. The constraint is not used in the calculation because it has been disabled. If the constraint is strict or complex, modifying the constraint can improve the chances of the calculation completing.

[0118] FIG. 30 is a further example of the constraint editing screen 601 where the reactive power reserve requirement has been modified. As shown in the constraint formulation table, the user has added slack variables s_+ and s_- to the left side of the equations and variables table 522. The user can also modify the objective function, variable ranges and definitions, and data mappings to match this modification. This invalidation and modification feature allows the user the flexibility to experiment and get favorable results without having to directly edit the program source code. The model management module 203 provides automated capabilities to assist in such trial and error based on how constraints are applied.

[0119] FIG. 31 is a diagram showing an example of a drop-down list 3101 on the model management screen 401. As shown in FIG. When the user presses the constraint application method drop-down button 418 on the model management screen 401, a constraint application method drop-down list 3101 opens, and the user can select a constraint application method. In this example, "Benders decomposition" and "Constraint generation" are displayed as candidates. Benders decomposition is a technique used to solve complex optimization problems by decomposing the original problem into a master problem and one or more subproblems.

[0120] Constraint generation is a technique used to solve large-scale optimization problems by starting with a subset of constraints and gradually adding more constraints.

[0121] 32 shows an example of the model management screen 401 after the constraint application method has been selected. In this example, the constraint generation method is applied to the power flow limit and reactive power margin requirement, and the Benders decomposition method is applied to the short circuit level requirement. The constraint application method is not applied to other constraints, so these constraints are treated as normal in the optimization calculation.

[0122] After selecting the constraint application methods, the user can define the order of the constraint application methods via the constraint management sub-screen 2201 of the model detail setting screen 1801 .

[0123] 33 shows an example of the constraint management subscreen 2201 after the order of constraint application methods has been set. According to this order, the optimization calculation proceeds in the following three steps. In the first step, an optimization problem that does not include the constraints specified by the constraint application method is calculated. In the second step, the constraint generation method is applied to the optimization calculation. In the final step, the Benders decomposition method is applied to the optimization calculation. Depending on the conditions, iterative calculations may be performed between the second and final steps.

[0124] The user can set the properties of each constraint application method on the model detail setting screen 1801. As an example of the properties of the constraint generation method, the user can set the property of the priority criteria and the maximum number of constraints to be generated at one time.

[0125] 34 shows an example of a constraint generation property setting sub-screen 3401 of the model detail setting screen 1801. The constraint generation property setting sub-screen 3401 has a priority criterion drop-down button 3411, a priority criterion field 3421, a maximum number of constraints to be generated field 3422, and a priority criterion drop-down list 3423.

[0126] The priority criteria drop-down button 3411 is utilized to open a priority criteria drop-down list 3423 to select a priority criteria for determining which constraints should be generated in the algorithm. Once the user selects a priority criteria, it is displayed in the priority criteria field 3421. The maximum constraints generated field indicates the maximum number of constraints that will be generated by the algorithm at one time, and this field is editable. As an example of the properties of the Benders decomposition method, the decomposition properties can be detailed.

[0127] FIG. 35 is a diagram showing an example of a Benders decomposition property setting subscreen 3501, which includes a master problem definition button 3511, a subproblem definition button 3512, a connector 3513, an interface definition button 3514, an add layer button 3515, and an add subproblem button 3516.

[0128] A master problem definition button 3511 is utilized to confirm the definition of the master problem for applying the Benders decomposition. The subproblem definition button 3512 is used to define a subproblem for applying the Benders decomposition method. Connectors 3513 are utilized to link between the master problem and sub-problems or sub-problems of different layers. The interface definition button (top to bottom) 3514 is utilized to define variables provided from the top layer problem to the bottom layer problem and additional constraints from the bottom layer problem to the top layer problem. The add layer button 3515 is utilized to add a lower layer. The add sub-question button 3516 is utilized to add a sub-question to the layer.

[0129] When the user presses the master question definition button 3511, a master question definition screen 3601 for confirming the definition of the master question is displayed, as shown in FIG.

[0130] The master problem definition screen 3601 includes a close button 413 , an objective function table (original problem) 3620 , a constraint table (original problem) 3621 , an objective function table (master problem) 3622 , and a constraint table (master problem) 3623 . An objective function table (original problem) 3620 and a constraint table (original problem) 3621 respectively show the objective function and constraints in the original problem. An objective function table (master problem) 3622 and a constraint table (master problem) 3623 also show the objective function and constraints of the master problem, respectively. Objective functions and constraints that are not managed by the Benders decomposition are shaded based on the specification on the model management screen 401. In this example, the short-circuit level requirement is included in the original problem, but is not included in the master problem because the user selected the Benders decomposition as the constraint application method for this constraint.

[0131] When the user presses the define sub-problem button 3512, a define sub-problem screen 3701 is displayed as shown in FIG. 37, allowing the user to assign constraints from the original problem to the sub-problem. The sub-problem definition screen 3701 includes a confirm button 1901, a reset button 3710, a close button 413, a reset button 3710, an assignment button (from original problem to sub-problem) 3711, an edit objective function button (sub-problem) 33712, a delete button 3713, an objective function table (original problem) 3620, a constraint table (original problem) 3621, an objective function table (sub-problem) 3720, and a constraint table (sub-problem) 3721. An objective function table (sub-problems) 3720 and a constraint table (sub-problems) 3721 indicate the objective functions and constraints in the sub-problems, respectively. The objective functions and constraints that are not managed by the Benders decomposition are shown with diagonal lines. In this example, the total cost and short circuit level requirements are managed by the Benders decomposition. If the user wants to add the total cost and short circuit level requirements to this subproblem, they can be allocated by pressing the allocate button (from original problem to subproblem) 3711.

[0132] 38 is an example of the sub-problem definition screen 3710 after allocation. If it is desired to delete a constraint after allocation, the constraint can be deleted from the sub-problem by pressing the remove button 3713. If one wishes to start over with the assignments, the reset button 3710 is used to reinitialize the assignments. The Edit Objective Function button (Sub-problem) is utilized to open an Edit Objective Function screen (Sub-problem) 3901, allowing the user to edit the objective function of the sub-problem.

[0133] When the user presses edit objective function button (subproblem) 3717, an edit objective function screen (subproblem) 3901 is displayed, as shown in Fig. 39. Edit objective function screen (subproblem) 3901 has a confirm button 510, a close button 413, a reset button 3710, an add variable row button 511, an add constant row button 513, an add set row button 515, a move button (from variable to constant) 3910, a define variable button 3911, a define constant button 3912, a define set button 3913, an objective function name field 520, an objective function formulation field 521, a variable table 522, a constant table 523, and a set table 524.

[0134] The move button (variable to constant) 3910 is used to change a variable to a constant. The define variable button 3911, define constant button 3912, and define set button 3913 are used to define the properties of an additional variable, constant, and set, respectively.

[0135] If the user wishes to modify the objective function, it can be edited directly in the objective function formulation field 521. In this example, the following penalty terms have been added to the objective function to avoid infeasible conditions:

[0136]

number

[0137] and w_SCR and s_SCR are real constants representing the penalty price and slack variable, respectively. These additional constants and variables are also added to constant table 523 and variable table 522, respectively. Additionally, by using the move (variable to constant) button 3910, u can be treated as a constant rather than a variable, resulting in a simpler subproblem. The user can confirm the edit results by pressing a confirmation button 1910.

[0138] When the user presses the interface definition button (upper → lower) 3514, an interface definition screen 4001 opens as shown in FIG. 40, and the interface between the upper layer problem and the lower layer problem is defined. A constant definition button 4011, a variable table (higher to lower) 4020, a constraint table (lower to higher) 4021, and a constant table 4022 have been added to the interface definition screen 4001. The variable table (from top to bottom) 4020 is editable and defines variables to be provided from a problem in a higher layer to a problem in a lower layer. The constraints table (low to high) 4021 is editable to define constraints that are added to a higher layer problem based on the lower layer problem, and the additional constants table 4022 is editable to define additional constants required by the constraints. The define additional constants button 4011 is used to define the properties of additional constants.

[0139] Once the correction of the problem is complete, all models, data, and constraint application methods are stored in the calculation model database 210, calculation input database 211, and constraint application method database 212, respectively. Then, a trial calculation can be performed by pressing a trial calculation button 316 on the initial screen 301, and the feasibility and validity of the problem can be confirmed. If no errors are found in the trial calculation, the calculation can be performed by pressing the execute calculation button 313 on the initial screen 301. As described above, the optimization calculation in this embodiment proceeds to the execution of three steps, as shown in FIG. 41.

[0140] The first step, designated as S4101, solves the unconstrained optimization problem specified with any constraint application method. In a second step, indicated as step S4102, a constraint generation technique is applied to the optimization calculation. In the third step, shown as step S4103, the Benders decomposition method is applied to the optimization calculation. After the third step, as shown in S3104, constraint violations are checked, and if a constraint violation is confirmed, the process returns to S4102 and the calculation proceeds with the updated constraints. If there is no constraint violation, the calculation is terminated. If the calculation is terminated, the calculation result is stored in the calculation final result database 214 and output to the user.

[0141] FIG. 42 shows a plot of the calculation steps against the tolerance when the constraint application method is not applied. Due to the size and complexity of the original problem, the tolerance does not reach the threshold. Meanwhile, FIG. 43 shows a plot of the calculation steps against the tolerance when the two constraint application methods are applied. Since the optimization problem in each step is smaller and simpler than the original problem, the calculated tolerance finally reaches the tolerance value. Furthermore, the calculation results in steps S4191, S4102, and S4103 are stored in the calculation intermediate result database 213 during the calculation, and are output to the user when the calculation cannot be completed due to the difficulty of the numerical calculation. For example, when the calculation of the substep of S4103 is not completed and the calculation of the previous substep was possible, the calculation intermediate result of S4103 including the violation check result can be output to the user.

[0142] Furthermore, if the calculation in the sub-step S4103 has not been completed and there are no calculation results in the previous sub-step S4103, the intermediate calculation results in S4102 can be output to the user together with the violation check results.

[0143] FIG. 44 shows an example of an intermediate result screen 4401, which includes an intermediate result sub-screen area 4402, a placement result button 2611, an operation result button 2612, a constraints & violations button 4411, an export button (intermediate results) 4412, and a close button 413.

[0144] The constraints & violations button 4414 is used to open a constraints & violations sub-screen 4701, as shown in Fig. 47. The export button (intermediate results) 4413 is used to export intermediate results.

[0145] 45 and 46 are examples of sub-screens of the placement result 2701 and the operation result 2801, respectively, displayed on the interim result screen 4401. The configuration of these sub-screens on the interim result screen 4401 is the same as that on the final result screen 2601.

[0146] The Constraints & Violations subscreen 4701 includes a Details button 4711 and a Constraints & Violations status table 4721. The Constraints & Violations status table 4721 shows a list of constraints, their application status, and any violations against the constraints. If the user wants to check the applied status and details of the violations, the Details button 4711 is used to open the Constraints & Violations details screen 4801 shown in FIG.

[0147] The constraint & violation details screen 4801 has a constraint & violation details table 4821, which shows the constraint application status and violation amount at the object level. If all calculations are not completed, the user can make a decision based on the intermediate results, or change the model or the method of applying constraints and try the next calculation.

[0148] Therefore, the proposed power system planning support tool and method allows users to continue their planning work and provides a flexible environment for obtaining planning solutions.

[0149] FIG. 49 is a further system configuration example in which the power system planning support tool 1 cooperates with a reinforcement learning system 4903 via a communication network 4902. In this example, the user does not select the method of applying the constraint conditions, but the reinforcement learning system 4902 selects it and outputs the calculation result to the reinforcement learning system 4903. The modeling data input interface from the reinforcement learning system 4903 has data including the constraint conditions table 421, the objective function formulation field 521, the variable table 522, the constraint conditions table 523, the set table 524, and the constraint conditions application method order table 2221, the priority criteria field 3421, the maximum number constraint generation field 3422, the objective function table (part problem) 3720, the constraint conditions table (part problem) 3721, the variable table (from higher to lower) 4020, the constraint conditions table (from lower to higher) 4021, and the additional constraint conditions table 4022 in the embodiment. By connecting the power system planning support tool 1 to the reinforcement learning system 4903, a solution can be automatically obtained based on the input from the reinforcement learning system.

[0150] The systems and methods of the above embodiments, in addition to the structural components and user interactions described, can be implemented in a computer system (particularly computer hardware or computer software).

[0151] The term "computer system" includes hardware, software, and data storage for implementing a system or performing a method according to the above-described embodiments. For example, a computer system may be comprised of a central processing unit (CPU), input means, output means, and data storage. A computer system may have a monitor that provides a visual output display. Data storage may be comprised of RAM, disk drives, or other computer-readable media. A computer system may include multiple computing devices connected by a network and capable of communicating with each other over the network.

[0152] The methods of the above embodiments may be provided as a computer program or as a computer program product or a computer readable medium carrying a computer program arranged to perform the above methods when executed on a computer.

[0153] The term "computer-readable medium" includes, but is not limited to, any non-transitory medium or media that can be directly read and accessed by a computer or computer system. Media include, but are not limited to, magnetic storage media, such as floppy disks, hard disk storage media, magnetic tape, optical storage media, such as optical disks and CD-ROMs, electrical storage media, such as RAM, ROM, memory, such as flash memory, and hybrids or combinations of the above, such as magnetic / optical storage media.

[0154] While the present disclosure has been described in conjunction with the exemplary embodiments set forth above, many equivalent modifications and variations will be apparent to those skilled in the art given this disclosure. Accordingly, the exemplary embodiments of the present disclosure set forth above are considered to be illustrative and not limiting. Various modifications to the described embodiments can be made without departing from the spirit and scope of the present disclosure.

[0155] In particular, although the methods of the above embodiments have been described as being implemented on the systems of the described embodiments, the methods and systems of the present disclosure need not be implemented in conjunction with each other and may each be implemented on alternative systems or using alternative methods.

[0156] The features disclosed in this specification, the following claims, or the accompanying drawings may, as appropriate, be expressed in terms of specific forms thereof, or means for performing a disclosed function, or methods or processes for obtaining a disclosed result, and may be utilized to realize the disclosure in its various forms, either separately or in any combination of such features.

[0157] While the present disclosure has been described in conjunction with the exemplary embodiments set forth above, many equivalent modifications and variations will be apparent to those skilled in the art given this disclosure. Accordingly, the exemplary embodiments of the present disclosure set forth above are considered to be illustrative and not limiting. Various modifications to the described embodiments can be made without departing from the spirit and scope of the present disclosure.

[0158] For the avoidance of doubt, the theoretical explanations provided herein are provided for the purpose of enhancing the understanding of the reader and the inventors do not wish to be bound by these theoretical explanations.

[0159] Any section headings used herein are for organizational purposes only and are not to be construed as limiting the subject matter described.

[0160] Throughout this specification, including the claims which follow, unless the context otherwise requires, the words "comprise" and "include," as well as variations such as "comprises," "comprising," and "including," are understood to imply the inclusion of a stated integer or step or group of integers or steps, but not the exclusion of other integers or steps or groups of integers or steps.

[0161] It should be noted that, as used herein and in the appended claims, the singular forms "a," "an," and "the" include plural references unless the context clearly dictates otherwise. Ranges may be expressed herein as from "about" one particular value and / or to "about" another particular value. When such a range is expressed, another embodiment includes from the one particular value and / or to the other particular value. Similarly, when values ​​are expressed as approximations, it is understood that the particular value forms another embodiment by use of the antecedent "about." The term "about" with respect to numerical values ​​is arbitrary and means, for example, ±10%. [Explanation of symbols]

[0162] 1: Power system planning support system, 11: CPU, 12: ALU, 13: input device, 14: output device, 15: Main memory, 16: External storage device, 18: Database, 19 programs, 201: input module, 202: output module, 203: Model Management Module 204: Calculation module, 211: calculation input database module, 212: Constraint application method database module; 213: calculation intermediate result database module; 214: Calculation final result database module.

Claims

1. A power system planning support method executed on a computer, comprising the steps of: (i) receiving an objective function, the objective function representing a quantity or parameter related to a power grid; (ii) receiving one or more constraint functions, the constraint functions representing constraints on the power grid, the objective function and the constraint functions together representing a model of the power grid; (iii) receiving input data related to a power grid; (iv) performing an optimization calculation defined by the power grid model and the input data; and (v) displaying results of the optimization calculation. Power system planning support method.

2. The power system planning support method according to claim 1, and if execution of the optimization calculation results in an indication that the optimization calculation cannot be completed, calculating one or more intermediate results. Power system planning support method.

3. The power system planning support method according to claim 2, and indicating to the user that the optimization calculation cannot be completed; and providing the user with the calculated intermediate results. Power system planning support method.

4. The power system planning support method according to claim 3, receiving one or more overrides and / or edits to the constraint(s) received in step (ii), such that step (iv) is performed without the overriden constraint(s) and / or with edited constraint(s); Power system planning support method.

5. The power system planning support method according to claim 4, The method further includes applying a decomposition method to the objective function and the constraint functions to arrive at a plurality of subproblems representing the objective function, the plurality of subproblems having the decomposed objective function and constraint functions representing a model of the power grid. Power system planning support method.

6. The power system planning support method according to claim 5, The step (ii) includes receiving a plurality of constraint functions, and the power system planning support method further includes receiving an order in which the constraint functions are to be applied. Power system planning support method.

7. The power system planning support method according to claim 6, The method further includes applying a constraint generation method to one or more of the constraint functions, the constraint generation method applying a subset of the constraints and sequentially adding additional constraints. Power system planning support method.

8. The power system planning support method according to claim 7, receiving a priority for the subset of constraints and / or a maximum number of constraints to be generated at one time; Power system planning support method.

9. The power system planning support method according to claim 8, wherein step (i) comprises receiving definitions of one or more variables, definitions of one or more constants, and definitions of one or more datasets; Power system planning support method.

10. The power system planning support method according to claim 9, The reinforcement learning system provides one or more of the constraint functions and / or constraint application methods. Power system planning support method.

11. The power system planning support method according to claim 10, Prior to performing the optimization calculation, the method further includes receiving a request to perform a trial calculation, the method further including performing the trial calculation, the trial calculation indicating whether a perfect solution is expected from the optimization calculation defined by the model of the power grid and the input data. Power system planning support method.

12. A power system planning support system, comprising: One or more processors and a memory; The memory includes machine-executable instructions that, when executed on a processor, cause the processor to: (i) receiving an objective function, the objective function representing a quantity or parameter related to the power grid; (ii) receiving one or more constraint functions, each constraint function representing a constraint on the power grid, the objective function and the constraint functions together representing a model of the power grid; (iii) receiving input data related to the power grid; (iv) performing an optimization calculation defined by the power grid model and the input data; (v) Display the results of the optimization calculation Power system planning support system.

13. The power system planning support system according to claim 12, the memory further includes machine-executable instructions that, when executed on the processor, cause the processor to calculate one or more intermediate results if execution of the optimization calculation results in an indication that the optimization calculation cannot be completed. Power system planning support system.

14. The power system planning support system according to claim 13, The memory further includes machine-executable instructions that, when executed on the processor, cause the processor to indicate to a user that the optimization calculation cannot be completed and to provide calculated intermediate results to the user. Power system planning support system.

15. A non-transitory computer readable storage medium comprising machine executable instructions that, when executed on one or more processors, cause the processors to perform the method of any of claims 1 to 11.

Citation Information

Patent Citations

  • System configuration creation method for power system and device therefor

    JP2008262332A

  • Operation schedule generation device, operation schedule generation method, and program

    JP2016039648A

  • Energy supply-demand planning device and energy supply-demand planning program

    JP2017134556A

  • Power system operation plan generation device and power system operation plan generation method

    JP2022181250A

  • Method, apparatus and storage medium for transmission network expansion planning considering extremely large amounts of operation scenarios

    US20200212681A1