A method and related device for unit commitment historical solution query under a complex scenario

Abstract

The application discloses a unit combination history solution graph query method and related device under a complex scene, comprising: obtaining a unit combination history solution graph under a complex scene; according to a first preset query condition, querying a target unit combination history solution node in the unit combination history solution graph under the complex scene; according to a second preset query condition, querying a plurality of unit combination history solution nodes similar to a to-be-queried unit combination history solution node in the unit combination history solution graph under the complex scene, and sorting the plurality of unit combination history solution nodes, so that the target history solution can be quickly queried, and quantitative analysis on the similarity relationship between a plurality of unit combination history solutions can be performed.

Description

Technical Field

[0001] This invention belongs to the field of power equipment and relates to a method and related device for querying historical diagrams of unit combinations in complex scenarios. Background Technology

[0002] The Security-Constrained Unit Commitment (SCUC) problem in power systems refers to determining the combination of generators in a power system under various security constraints to ensure the safe and reliable operation of the system. SCUC is often modeled as a Mixed-Integer Linear Programming (MILP) problem.

[0003] Modeling historical solutions for unit combinations involves various data, including grid topology, line parameters, unit configuration, load forecasting, and renewable energy forecasting. Furthermore, the values ​​of effective constraints (unit start-up / shutdown status / ramp-up, etc.) and optimization variables (unit output) in similar historical solutions are often quite similar. Traditional methods of describing historical solutions for unit combinations typically treat them as structured data, storing them in files or relational databases. However, this approach fails to intuitively establish the relationship between "historical solution - constraints - operating status," cannot quickly query target historical solutions, and cannot support quantitative analysis of the similarity relationships between multiple sets of historical solutions for unit combinations. Summary of the Invention

[0004] The purpose of this invention is to overcome the shortcomings of the prior art and provide a method and related device for querying historical solutions of unit combinations in complex scenarios. This method and related device can quickly query target historical solutions and perform quantitative analysis of the similarity relationship between multiple sets of historical solutions of unit combinations.

[0005] To achieve the above objectives, this invention discloses a method for querying historical diagrams of unit combinations in complex scenarios, comprising:

[0006] Obtain historical diagrams of unit combinations in complex scenarios;

[0007] Based on the first preset query conditions, query the target unit combination historical solution node in the unit combination historical solution map under the complex scenario.

[0008] According to the second preset query conditions, several historical solution nodes of unit combination that are similar to the historical solution node of the unit combination to be queried are queried in the historical solution graph of unit combination in the complex scenario, and the queried several historical solution nodes of unit combination are sorted.

[0009] The further improvement of the unit combination historical interpretation query method in complex scenarios described in this invention lies in:

[0010] Furthermore, the process of obtaining historical diagrams of unit combinations in complex scenarios is as follows:

[0011] Obtain structural information of the power network and unit start-up and shutdown constraints;

[0012] System nodes are constructed based on the structural information of the power network and the start-up and shutdown constraints of the generating units. The system nodes include the historical solution nodes of the generating unit combination, the start-up and shutdown constraint nodes, the generating unit nodes, the bus nodes, and the time segment nodes.

[0013] Based on the historical solution nodes of the unit combination, start-stop constraint nodes, unit nodes, bus nodes, and time segment nodes, construct the historical solution graph of the unit combination under the complex scenario.

[0014] Furthermore, the process of constructing a historical solution graph for complex scenarios based on the historical solution nodes, start-stop constraint nodes, unit nodes, bus nodes, and time segment nodes is as follows:

[0015] Construct the edge relationships between bus nodes and unit nodes, unit nodes and start / stop constraint nodes, time period nodes and start / stop constraint nodes, and unit combination historical solution nodes and start / stop constraint nodes.

[0016] Based on the edge relationships between bus nodes and unit nodes, unit nodes and start / stop constraint nodes, time period nodes and start / stop constraint nodes, and the edge relationships between unit combination historical solution nodes and start / stop constraint nodes, a historical solution graph of unit combination under complex scenarios is constructed.

[0017] Furthermore, the process of querying the target unit combination historical solution node in the unit combination historical solution map under the complex scenario according to the first preset query conditions is as follows:

[0018] Based on the first preset query conditions, the path counting method on multiple bipartite graphs is used to query the target unit combination historical solution node in the unit combination historical solution graph under the complex scenario.

[0019] Furthermore, the process of querying several historical solution nodes of unit combinations similar to the historical solution node of the unit combination to be queried in the historical solution map of the unit combination under the complex scenario according to the second preset query conditions, and sorting the several historical solution nodes of the unit combination found is as follows:

[0020] According to the second preset query conditions, a weighted summation network flow algorithm is used to query several historical solution nodes of unit combination that are similar to the historical solution node of the unit combination to be queried in the historical solution graph of unit combination in the complex scenario, and sort the queryed several historical solution nodes of unit combination.

[0021] This invention discloses a system for querying historical diagrams of unit combinations in complex scenarios, comprising:

[0022] The acquisition module is used to acquire historical diagrams of unit combinations in complex scenarios;

[0023] The first query module is used to query the target unit combination historical solution node in the unit combination historical solution map under the complex scenario according to the first preset query conditions.

[0024] The second query module is used to query, according to the second preset query conditions, several historical solution nodes of unit combination that are similar to the historical solution node of the unit combination to be queried in the historical solution map of unit combination in the complex scenario, and sort the several historical solution nodes of unit combination found.

[0025] The further improvement of the complex scenario unit combination historical interpretation query system described in this invention lies in:

[0026] Furthermore, the acquisition module includes:

[0027] The acquisition unit is used to acquire the structural information of the power network and the start-up and shutdown constraints of the generating units.

[0028] The first construction unit is used to construct system nodes based on the structural information of the power network and the start-up and shutdown constraints of the generating units. The system nodes include historical solution nodes of generating unit combinations, start-up and shutdown constraint nodes, generating unit nodes, bus nodes, and time segment nodes.

[0029] The second construction unit is used to construct the historical solution map of unit combination under the complex scenario based on the historical solution nodes of unit combination, start-stop constraint nodes, unit nodes, bus nodes and time segment nodes.

[0030] Furthermore, the second building unit includes:

[0031] The third construction unit is used to construct the edge relationships between bus nodes and unit nodes, the edge relationships between unit nodes and start / stop constraint nodes, the edge relationships between time period nodes and start / stop constraint nodes, and the edge relationships between unit combination historical solution nodes and start / stop constraint nodes.

[0032] The fourth construction unit is used to construct a historical solution graph of unit combination under complex scenarios based on the edge relationships between bus nodes and unit nodes, unit nodes and start-stop constraint nodes, time period nodes and start-stop constraint nodes, and the edge relationships between historical solution nodes of unit combination and start-stop constraint nodes.

[0033] Furthermore, the process of querying the target unit combination historical solution node in the unit combination historical solution map under the complex scenario according to the first preset query conditions is as follows:

[0034] Based on the first preset query conditions, a path counting system on multiple bipartite graphs is used to query the target unit combination historical solution node in the unit combination historical solution graph under the complex scenario.

[0035] Furthermore, the process of querying several historical solution nodes of unit combinations similar to the historical solution node of the unit combination to be queried in the historical solution map of the unit combination under the complex scenario according to the second preset query conditions, and sorting the several historical solution nodes of the unit combination found is as follows:

[0036] According to the second preset query conditions, a weighted summation network flow algorithm is used to query several historical solution nodes of unit combination that are similar to the historical solution node of the unit combination to be queried in the historical solution graph of unit combination in the complex scenario, and sort the queryed several historical solution nodes of unit combination.

[0037] This invention discloses a computer device, including a memory, a processor, and a computer program stored in the memory and executable on the processor. When the processor executes the computer program, it implements the steps of the method for querying the historical diagram of unit combination under complex scenarios.

[0038] This invention discloses a computer-readable storage medium storing a computer program, which, when executed by a processor, implements the steps of the method for querying historical diagrams of unit combinations under complex scenarios.

[0039] The present invention has the following beneficial effects:

[0040] The complex scenario unit combination historical solution query method and related device described in this invention utilizes the complex scenario unit combination historical solution map to quickly query the target historical solution. Based on preset query conditions, it can quickly determine several unit combination historical solution nodes similar to the node to be queried, and sort the queried nodes to achieve quantitative analysis of the similarity relationship between multiple sets of unit combination historical solutions. It is highly practical and can be used to support the extraction of training samples for safety constraint unit combination initial solution generation graph neural networks and constraint validity discrimination models. Attached Figure Description

[0041] The accompanying drawings, which form part of this specification, are used to provide a further understanding of the invention. The illustrative embodiments of the invention and their descriptions are used to explain the invention and do not constitute an undue limitation of the invention. In the drawings:

[0042] Figure 1 This is a flowchart of the method of the present invention;

[0043] Figure 2 This is a schematic diagram illustrating the historical interpretation of unit combination under complex scenarios in this invention;

[0044] Figure 3 This is a schematic diagram illustrating the historical solution in the query period i where the number of started units is at least m.

[0045] Figure 4 This is a schematic diagram illustrating the process of searching for other historical solutions with the same start and stop states as historical solution s in this invention.

[0046] Figure 5 This is a schematic diagram illustrating the process of searching for other historical solutions that are consistent with the start and stop states of historical solution s in this invention.

[0047] Figure 6 This is a system structure diagram of the present invention. Detailed Implementation

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

[0049] In the description of this invention, it should be understood that the terms "comprising" and "including" indicate the presence of the described features, integrals, steps, operations, elements and / or components, but do not exclude the presence or addition of one or more other features, integrals, steps, operations, elements, components and / or collections thereof.

[0050] It should also be understood that the terminology used in this specification is for the purpose of describing particular embodiments only and is not intended to limit the invention. As used in this specification and the appended claims, the singular forms “a,” “an,” and “the” are intended to include the plural forms unless the context clearly indicates otherwise.

[0051] It should also be further understood that the term "and / or" as used in this specification and the appended claims refers to any combination and all possible combinations of one or more of the associated listed items, and includes such combinations. For example, A and / or B can represent three cases: A alone, A and B simultaneously, and B alone. Additionally, the character " / " in this invention generally indicates that the preceding and following objects have an "or" relationship.

[0052] It should be understood that although terms such as first, second, third, etc., may be used in the embodiments of the present invention to describe the preset range, these preset ranges should not be limited to these terms. These terms are only used to distinguish the preset ranges from one another. For example, without departing from the scope of the embodiments of the present invention, the first preset range may also be referred to as the second preset range, and similarly, the second preset range may also be referred to as the first preset range.

[0053] Depending on the context, the word "if" as used here can be interpreted as "when," "when," "in response to determination," or "in response to detection." Similarly, depending on the context, the phrase "if determination" or "if detection (of the stated condition or event)" can be interpreted as "when determination," "in response to determination," "when detection (of the stated condition or event)," or "in response to detection (of the stated condition or event)."

[0054] To make the objectives, technical solutions, and advantages of the embodiments of the present invention clearer, the technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some, not all, of the embodiments of the present invention. The components of the embodiments of the present invention described and shown in the accompanying drawings can generally be arranged and designed in various different configurations. Therefore, the following detailed description of the embodiments of the present invention provided in the accompanying drawings is not intended to limit the scope of the claimed invention, but merely to illustrate selected embodiments of the invention. All other embodiments obtained by those skilled in the art based on the embodiments of the present invention without inventive effort are within the scope of protection of the present invention.

[0055] The accompanying drawings illustrate various structural schematic diagrams according to embodiments disclosed in this invention. These drawings are not to scale, and some details have been enlarged for clarity, and some details may have been omitted. The shapes of the various regions and layers shown in the drawings, as well as their relative sizes and positional relationships, are merely exemplary and may deviate from reality due to manufacturing tolerances or technical limitations. Furthermore, those skilled in the art can design regions / layers with different shapes, sizes, and relative positions as needed.

[0056] Example 1

[0057] refer to Figure 1 The method for querying historical diagrams of unit combinations in complex scenarios according to the present invention includes the following steps:

[0058] 1) Based on the structural information of the power network and the constraints of unit start-up and shutdown, a graph model of the current power grid state is performed to obtain a historical solution graph of unit combinations under complex scenarios, such as... Figure 2 As shown.

[0059] The specific operation of step 1) is as follows:

[0060] 11) Construct system nodes, including unit combination history solution nodes, start-stop constraint nodes, unit nodes, bus nodes, and time segment nodes.

[0061] The unit combination historical solution node represents a certain unit combination historical solution body, which contains or is associated with all the information of the historical solution.

[0062] The start / stop constraint node corresponds to the full permutation of all unit nodes and time period nodes, representing the start / stop status of a certain unit during a certain time period.

[0063] The bus node represents a bus in the power grid.

[0064] The unit node represents the unit that participates in the unit combination optimization solution.

[0065] The time period nodes represent either 96 or 24 time periods in the day-ahead unit combination optimization solution.

[0066] refer to Figure 2 , Figure 2 Let C represent a power system with N buses, M generating units, and C historical solutions. Therefore, the number of bus nodes is N, the number of generating unit nodes is M, the number of time period nodes is 96, the number of start-stop constraint nodes is 96×M, and the number of generating unit combination historical solution nodes is S.

[0067] 12) Establish edge relationships, where the edges in the unit combination historical solution diagram model represent the correlation between nodes.

[0068] Among them, the correlation between the bus node-unit node, the unit node-start / stop constraint node, and the time segment node-start / stop constraint node in the three binary graphs is not affected by the historical solution of the unit combination, that is, the number of edges in these three binary graphs is constant.

[0069] The number of edges in the binary graph formed by the bus node and the unit node is M, and each unit node is connected by one edge.

[0070] The number of edges in the binary graph formed by the unit node and the start-stop constraint node is 96×M, and each start-stop constraint node is connected to one edge, and each unit node is connected to 96 edges.

[0071] The number of edges in the binary graph formed by the time period node and the start / stop constraint node is 96×M, and each start / stop constraint node is connected to one edge, and each time period node is connected to M edges.

[0072] The edge relationship between the historical solution node of unit combination and the start-stop constraint node is the key feature obtained by event-based discretization of the continuous optimization variables and objective function in the unit combination solution. For example, the objective function ≤ c1, the output of unit i > c2, etc. c1 and c2 are constants obtained after event-based discretization. When the preset conditions are met, an edge relationship is established between the start-stop constraint node and the historical solution node of unit combination.

[0073] 2) Using a path counting method on multiple bipartite graphs, query the historical solution graph of unit combination in the complex scenario to obtain the historical solution to be queried.

[0074] In the historical solution diagram of unit combination in complex scenarios, the historical solution node of unit combination is only connected to the start-stop constraint node. Therefore, the query of historical solution of unit combination and the search for similar solution can be carried out by filtering relevant constraints and finding the corresponding start-stop constraint node.

[0075] The query for historical solutions to unit combinations involves combining and querying based on set conditions to obtain a set of historical solution nodes for unit combinations in complex scenarios that meet the query criteria in the historical solution graph. For example, querying historical solutions where at least m units were started in time period i, or querying historical solutions where unit j was started for at least t time periods, etc.

[0076] refer to Figure 3 For example, to query historical solutions where the number of started units is at least m in time period i, let the number of bus nodes be N, the number of unit nodes be M, the number of time period nodes be 96, the number of start / stop constraint condition nodes be 96×M, and the number of unit combination historical solution nodes be S.

[0077] For historical solutions where the number of generating units started in time period i is at least m, the key node for this query condition is time period node i, such as... Figure 3 As shown in the red dashed box on the left.

[0078] Starting from time period node i, recursively traverse along the edges to the start / stop constraint node, then the number of start / stop constraint nodes involved in the query is m; then recursively traverse to the unit combination historical solution node, and determine the number of start / stop constraint nodes related to the unit combination historical solution node. This can be determined by the number of paths to the unit combination historical solution node, i.e.:

[0079]

[0080] Among them, M m N represents the m start / stop constraint nodes. k Let m be the number of paths from the historical solution node k of the unit combination to the start / stop constraint node M. Let m be the query condition. Sum the number of paths from the time period node i to each historical solution node of the unit combination, and determine whether the summation result is greater than or equal to m. When the summation result is greater than or equal to m, the corresponding historical solution node of the unit combination is the node obtained by query.

[0081] The historical solution query method described above has low computational complexity, fast operation speed, and involves few parameters, and can realize historical solution query under complex conditions.

[0082] 3) The weighted summation network flow algorithm is used to query and sort similar historical solution nodes.

[0083] The historical similarity search for unit combination solutions involves searching for historical solutions that are similar to the unit combination historical solution nodes in terms of their operating constraints, state events, etc. For example, "searching for other historical solutions whose start / stop states are completely consistent with those of unit combination historical solution node 's'." It also supports weighted searches based on constraints and state events to achieve similarity ranking of historical solutions. For example, refer to... Figure 4 Search for other historical solutions whose start-stop states are completely consistent with those of the historical solution node s of the unit combination. The key node for this historical similarity solution search is the historical solution node s of the unit combination. Search for all of its start-stop constraints, and count their number as c.

[0084] Starting from each of the c start / stop constraint nodes, sum the number of edges connected to each unit's combined historical solution node, i.e.:

[0085]

[0086] Where, N c M represents the historical solution node for the c unit combinations. j Let c be the number of paths from start / stop constraint node j to historical solution node N, and c be the query condition. When the summation result is greater than or equal to c, the corresponding unit combination historical solution node is the node obtained by the query.

[0087] Additionally, refer to Figure 5 When the query condition is changed to search for other historical solutions with similar start / stop states to the historical solution node s of the unit combination, if the difference is less than a certain value, they can be considered similar.

[0088]

[0089] Where a is the similarity condition limit, N c M represents the historical solution node for the c unit combinations. j Let c be the number of paths from start / stop constraint node j to historical solution node N, and c be the query condition. Determine if the condition is greater than or equal to c. If it is greater than or equal to c, then the corresponding historical solution node for the unit combination is the node obtained from the query.

[0090] If there are c paths from the historical solution node s of the unit combination to any other specific historical solution node of the unit combination, then the unit combination historical solution node is completely consistent with the unit start-up and shutdown status of historical solution c; if there is no such node, the historical solutions can be sorted by the sum of the number of paths to obtain the most similar historical solution node of the unit combination.

[0091] Based on this, a network flow algorithm is needed to calculate the weights. Specifically, a weighted search of similar historical solution nodes can be achieved by assigning weights to constraint nodes, i.e.:

[0092]

[0093] Among them, P c b represents the weight of the historical solution node corresponding to the unit combination, and b is the limit value of the similarity weighting condition.

[0094] Meanwhile, the historical solution query of unit combination and the search for similar solutions can be combined through logical operations, supporting joint search under complex conditions.

[0095] Example 2

[0096] refer to Figure 6 The complex scenario unit combination historical diagram query system of the present invention includes:

[0097] The acquisition module is used to acquire historical diagrams of unit combinations in complex scenarios;

[0098] The first query module is used to query the target unit combination historical solution node in the unit combination historical solution map under the complex scenario according to the first preset query conditions.

[0099] The second query module is used to query, according to the second preset query conditions, several historical solution nodes of unit combination that are similar to the historical solution node of the unit combination to be queried in the historical solution map of unit combination in the complex scenario, and sort the several historical solution nodes of unit combination found.

[0100] In this embodiment, the acquisition module includes:

[0101] The acquisition unit is used to acquire the structural information of the power network and the start-up and shutdown constraints of the generating units.

[0102] The first construction unit is used to construct system nodes based on the structural information of the power network and the start-up and shutdown constraints of the generating units. The system nodes include historical solution nodes of generating unit combinations, start-up and shutdown constraint nodes, generating unit nodes, bus nodes, and time segment nodes.

[0103] The second construction unit is used to construct the historical solution map of unit combination under the complex scenario based on the historical solution nodes of unit combination, start-stop constraint nodes, unit nodes, bus nodes and time segment nodes.

[0104] In this embodiment, the second building unit includes:

[0105] The third construction unit is used to construct the edge relationships between bus nodes and unit nodes, the edge relationships between unit nodes and start / stop constraint nodes, the edge relationships between time period nodes and start / stop constraint nodes, and the edge relationships between unit combination historical solution nodes and start / stop constraint nodes.

[0106] The fourth construction unit is used to construct a historical solution graph of unit combination under complex scenarios based on the edge relationships between bus nodes and unit nodes, unit nodes and start-stop constraint nodes, time period nodes and start-stop constraint nodes, and the edge relationships between historical solution nodes of unit combination and start-stop constraint nodes.

[0107] In this embodiment, the process of querying the target unit combination historical solution node in the unit combination historical solution map under the complex scenario according to the first preset query conditions is as follows:

[0108] Based on the first preset query conditions, a path counting system on multiple bipartite graphs is used to query the target unit combination historical solution node in the unit combination historical solution graph under the complex scenario.

[0109] In this embodiment, the process of querying several historical solution nodes of unit combinations similar to the historical solution node of the unit combination to be queried in the historical solution map of the unit combination under the complex scenario according to the second preset query conditions, and sorting the several historical solution nodes of the unit combination found is as follows:

[0110] According to the second preset query conditions, a weighted summation network flow algorithm is used to query several historical solution nodes of unit combination that are similar to the historical solution node of the unit combination to be queried in the historical solution graph of unit combination in the complex scenario, and sort the queryed several historical solution nodes of unit combination.

[0111] The module division in this embodiment is illustrative and represents only one logical functional division. In actual implementation, other division methods may be used. Furthermore, the functional modules in each embodiment of this application can be integrated into a single processor, exist as separate physical entities, or be integrated into a single module. The integrated modules described above can be implemented in hardware or as software functional modules.

[0112] Example 3

[0113] A computer device includes a memory, a processor, and a computer program stored in the memory and executable on the processor. When the processor executes the computer program, it implements the steps of a method for querying historical solution maps of complex scenarios involving unit combinations. For example, the method includes: acquiring historical solution maps of unit combinations in complex scenarios; querying a target historical solution node for a unit combination in the historical solution map of complex scenarios according to a first preset query condition; querying several historical solution nodes of unit combinations similar to the target historical solution node in the historical solution map of complex scenarios according to a second preset query condition, and sorting the queried historical solution nodes. The memory may include main memory, such as high-speed random access memory, and may also include non-volatile memory, such as at least one disk storage device. The processor, network interface, and memory are interconnected via an internal bus, which may be an industry standard architecture bus, a peripheral component interconnection standard bus, an extended industry standard architecture bus, etc. The bus may be divided into an address bus, a data bus, a control bus, etc. The memory stores the program; specifically, the program may include program code, which includes computer operation instructions. Memory can include main memory and non-volatile memory, and provides instructions and data to the processor.

[0114] Example 4

[0115] A computer-readable storage medium stores a computer program that, when executed by a processor, implements the steps of the method for querying historical solution maps of unit combinations in complex scenarios. For example, the method includes: acquiring historical solution maps of unit combinations in complex scenarios; querying a target unit combination historical solution node in the historical solution map of unit combinations in complex scenarios according to a first preset query condition; querying several historical solution nodes of unit combinations similar to the target unit combination historical solution node in the historical solution map of unit combinations in complex scenarios according to a second preset query condition, and sorting the queried several historical solution nodes of unit combinations. Specifically, the computer-readable storage medium includes, but is not limited to, volatile memory and / or non-volatile memory. The volatile memory may include random access memory and / or cache memory, etc. The non-volatile memory may include read-only memory, hard disk, flash memory, optical disk, magnetic disk, etc.

[0116] Those skilled in the art will understand that embodiments of this application can be provided as methods, systems, or computer program products. Therefore, this application can take the form of a completely hardware embodiment, a completely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, this application can take the form of a computer program product implemented on one or more computer-usable storage media containing computer-usable program code.

[0117] This application is described with reference to flowchart illustrations and / or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of this application. It will be understood that each block of the flowchart illustrations and / or block diagrams, and combinations of blocks in the flowchart illustrations and / or block diagrams, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, special-purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, generate instructions for implementing the flowchart... Figure 1 One or more processes and / or boxes Figure 1 A device that provides the functions specified in one or more boxes.

[0118] These computer program instructions may also be stored in a computer-readable storage medium that can direct a computer or other programmable data processing device to function in a particular manner, such that the instructions stored in the computer-readable storage medium produce an article of manufacture including instruction means, which are implemented in a process Figure 1 One or more processes and / or boxes Figure 1 The function specified in one or more boxes.

[0119] These computer program instructions may also be loaded onto a computer or other programmable data processing equipment to cause a series of operational steps to be performed on the computer or other programmable equipment to produce a computer-implemented process, thereby providing instructions that execute on the computer or other programmable equipment for implementing the process. Figure 1 One or more processes and / or boxes Figure 1 The steps of the function specified in one or more boxes.

[0120] Other embodiments of the invention will readily occur to those skilled in the art upon consideration of the specification and disclosure of the invention. This application is intended to cover any variations, uses, or adaptations of the invention that follow the general principles of the invention and include common knowledge or customary techniques in the art not disclosed herein. The specification and examples are to be considered exemplary only, and the true scope and spirit of the invention are indicated by the following claims.

[0121] It should be understood that the present invention is not limited to the precise structure described above and shown in the accompanying drawings, and various modifications and changes can be made without departing from its scope. The scope of the invention is limited only by the appended claims.

[0122] The above description is merely a preferred embodiment of the present invention and does not constitute any limitation on the present invention. Any simple modifications, alterations, or equivalent structural changes made to the above embodiments based on the technical essence of the present invention shall still fall within the protection scope of the present invention.

Claims

1. A method for querying historical diagrams of unit combinations in complex scenarios, characterized in that, include: Obtain historical diagrams of unit combinations in complex scenarios; Based on the first preset query conditions, query the target unit combination historical solution node in the unit combination historical solution map under the complex scenario. According to the second preset query conditions, several historical solution nodes of unit combinations that are similar to the historical solution node of the unit combination to be queried are queried in the historical solution map of unit combination in the complex scenario, and the queried several historical solution nodes of unit combination are sorted. The process of querying the target unit combination historical solution node in the unit combination historical solution map under the complex scenario according to the first preset query conditions is as follows: Based on the first preset query conditions, a path counting method on multiple bipartite graphs is used to query the target unit combination historical solution node in the unit combination historical solution graph under the complex scenario; The process of querying several historical solution nodes of unit combination similar to the historical solution node of the unit combination to be queried in the historical solution map of the unit combination under the complex scenario according to the second preset query conditions, and sorting the several historical solution nodes of the unit combination found is as follows: According to the second preset query conditions, a weighted summation network flow algorithm is used to query several historical solution nodes of unit combination that are similar to the historical solution node of the unit combination to be queried in the historical solution graph of unit combination in the complex scenario, and sort the queryed several historical solution nodes of unit combination. The process of obtaining historical diagrams of unit combinations in complex scenarios is as follows: Obtain structural information of the power network and unit start-up and shutdown constraints; System nodes are constructed based on the structural information of the power network and the start-up and shutdown constraints of the generating units. The system nodes include the historical solution nodes of the generating unit combination, the start-up and shutdown constraint nodes, the generating unit nodes, the bus nodes, and the time segment nodes. Based on the historical solution nodes of the unit combination, start-stop constraint nodes, unit nodes, bus nodes, and time segment nodes, construct the historical solution graph of the unit combination under the complex scenario.

2. The method for querying historical diagrams of unit combinations in complex scenarios according to claim 1, characterized in that, The process of constructing a historical solution diagram of unit combination under complex scenarios based on the historical solution nodes, start-stop constraint nodes, unit nodes, bus nodes, and time segment nodes of the unit combination is as follows: Construct the edge relationships between bus nodes and unit nodes, unit nodes and start / stop constraint nodes, time period nodes and start / stop constraint nodes, and unit combination historical solution nodes and start / stop constraint nodes. Based on the edge relationships between bus nodes and unit nodes, unit nodes and start / stop constraint nodes, time period nodes and start / stop constraint nodes, and the edge relationships between unit combination historical solution nodes and start / stop constraint nodes, a historical solution graph of unit combination under complex scenarios is constructed.

3. A system for querying historical diagrams of unit combinations in complex scenarios, characterized in that, include: The acquisition module is used to acquire historical diagrams of unit combinations in complex scenarios; The first query module is used to query the target unit combination historical solution node in the unit combination historical solution map under the complex scenario according to the first preset query conditions. The second query module is used to query, according to the second preset query conditions, several historical solution nodes of unit combination that are similar to the historical solution node of unit combination to be queried in the historical solution map of unit combination in the complex scenario, and sort the several historical solution nodes of unit combination found. The process of querying the target unit combination historical solution node in the unit combination historical solution map under the complex scenario according to the first preset query conditions is as follows: Based on the first preset query conditions, a path counting system on multiple bipartite graphs is used to query the target unit combination historical solution node in the unit combination historical solution graph under the complex scenario. The process of querying several historical solution nodes of unit combination similar to the historical solution node of the unit combination to be queried in the historical solution map of the unit combination under the complex scenario according to the second preset query conditions, and sorting the several historical solution nodes of the unit combination found is as follows: According to the second preset query conditions, a weighted summation network flow algorithm is used to query several historical solution nodes of unit combination that are similar to the historical solution node of the unit combination to be queried in the historical solution graph of unit combination in the complex scenario, and sort the queryed several historical solution nodes of unit combination. The acquisition module includes: The acquisition unit is used to acquire the structural information of the power network and the start-up and shutdown constraints of the generating units. The first construction unit is used to construct system nodes based on the structural information of the power network and the start-up and shutdown constraints of the generating units. The system nodes include historical solution nodes of generating unit combinations, start-up and shutdown constraint nodes, generating unit nodes, bus nodes, and time segment nodes. The second construction unit is used to construct the historical solution map of unit combination under the complex scenario based on the historical solution nodes of unit combination, start-stop constraint nodes, unit nodes, bus nodes and time segment nodes.

4. The complex scenario unit combination historical interpretation and query system according to claim 3, characterized in that, The second building unit includes: The third construction unit is used to construct the edge relationships between bus nodes and unit nodes, the edge relationships between unit nodes and start / stop constraint nodes, the edge relationships between time period nodes and start / stop constraint nodes, and the edge relationships between unit combination historical solution nodes and start / stop constraint nodes. The fourth construction unit is used to construct a historical solution graph of unit combination under complex scenarios based on the edge relationships between bus nodes and unit nodes, unit nodes and start-stop constraint nodes, time period nodes and start-stop constraint nodes, and the edge relationships between historical solution nodes of unit combination and start-stop constraint nodes.

5. A computer device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, characterized in that, When the processor executes the computer program, it implements the steps of the complex scenario unit combination historical diagram query method as described in claim 1 or 2.

6. A computer-readable storage medium storing a computer program, characterized in that, When the computer program is executed by the processor, it implements the steps of the complex scenario unit combination historical diagram query method as described in claim 1 or 2.

Images