Virtual power plant energy scheduling model construction method and system and electronic equipment
By constructing a virtual power plant energy dispatch model, determining the shortest route, and performing fault pre-diagnosis and detection, the problem of insufficient path optimization in traditional power distribution is solved, and efficient and stable power transmission and system efficiency are improved.
Patent Information
- Application Number
- CN202410992028.1
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-07-23
- Publication Date
- 2024-11-26
- Estimated Expiration
- 2044-07-23
AI Technical Summary
Traditional power distribution methods neglect path optimization during power transmission, resulting in excessively long power flow paths and increased unnecessary losses. Especially with the increasing integration of renewable energy, the stability and economy of the power system are challenged.
A virtual power plant energy dispatch model is constructed. By obtaining the location and transmission relationship of power plants and distribution areas, the shortest route is determined, and fault pre-diagnosis and detection are carried out to optimize the power allocation strategy and ensure the efficient and stable transmission of power.
It achieves efficient use of electrical energy and reduces transmission losses, improves the overall operating efficiency and reliability of the power system, and ensures the accuracy and timeliness of power distribution.
Smart Images

Figure CN119029913A_ABST
Abstract
Description
Technical Field
[0001] The present application relates to the technical field of energy scheduling, and in particular to a method, system and electronic equipment for constructing a virtual power plant energy scheduling model. Background Art
[0002] With the continuous growth of energy demand and the transformation of energy structure, the power system is facing unprecedented challenges and opportunities. Especially in the context of a significant increase in the proportion of renewable energy access, the stability and economy of the power system have been greatly tested. In order to effectively solve these problems, building an efficient and intelligent energy dispatch model for virtual power plants and improving the operating efficiency and reliability of the system by optimizing power distribution and determining the shortest route has become one of the hot topics in current power system research.
[0003] In the framework of building and operating the energy dispatch model of virtual power plants, efficient distribution of electric energy plays a vital role. Traditional direct distribution methods often ignore the path optimization during the transmission of electric energy, which leads to excessively long paths for electric energy flow, thus causing unnecessary power loss. In the current context of energy shortages, energy conservation and emission reduction, how to reduce the power consumption during the transmission process has become an urgent problem to be solved. Summary of the invention
[0004] In order to reduce the consumption of electric energy during the transmission of electric energy, the present application provides a method, system and electronic equipment for constructing a virtual power plant energy scheduling model.
[0005] In the first aspect, the present application provides a method for constructing a virtual power plant energy scheduling model, which adopts the following technical solutions: A method for constructing a virtual power plant energy scheduling model, comprising: Obtain a first position of each power plant and a second position of each substation in the target area; Obtaining a transmission relationship between each power plant and each substation, wherein the transmission relationship indicates whether there is a transmission connection between the power plant and the substation; Based on the first location, the second location, and the transmission relationship between each power plant and each substation, construct an energy dispatch model of the virtual power plant corresponding to the target area; Acquire the target area with power demand; In the energy dispatch model of the virtual power plant, the target location of the target substation is determined; Based on the target location, determining at least one shortest route; Performing fault pre-diagnosis detection on the at least one shortest route to obtain a target route; Electric energy scheduling and allocation is performed based on the target route.
[0006] By adopting the above technical solution, the first position of each power plant and the second position of each substation in the target area, as well as the transmission relationship between them, can be obtained, and a detailed energy dispatch model of the virtual power plant can be constructed, providing clear and intuitive information. Then, real-time power demand monitoring is performed to obtain the target substation with power demand to ensure the accuracy and timeliness of power distribution. The target position of the target substation is determined in the energy dispatch model of the virtual power plant. After the target position is determined, at least one shortest route is determined based on the target position. In order to ensure the stable availability of at least one shortest route selected, a fault pre-diagnosis detection is performed on at least one shortest route to obtain the target route, that is, the target route obtained is not only better in distance to the target position, but also has better stable availability for power transmission, thereby realizing efficient and stable transmission of power. Based on the determined target route, power dispatch and distribution are carried out, and by optimizing the power distribution strategy, efficient use of power and reduction of transmission losses can be achieved, thereby improving the overall operating efficiency of the power system.
[0007] In a possible implementation, determining at least one shortest route based on the target location includes: Establishing a first set corresponding to the first position and a second set corresponding to the second position; Iterate each second position in the second set to determine a target second position corresponding to the number of iterations according to the number of iterations; Retrieving the target second position corresponding to each iteration number from the second set to the first set; When the second set is empty, stop iterating; At least one shortest route is determined according to the iterated first set.
[0008] By adopting the above technical solution, it is possible to comprehensively consider various factors and determine the optimal path from the power plant to the target substation, thereby achieving efficient and stable transmission of electric energy. At the same time, by adopting an iterative approach, it is possible to flexibly handle various situations, including multi-path connections between power plants and substations, potential connections between substations, etc., so that the solution can adapt to various complex power system environments.
[0009] In a possible implementation manner, iterating each second position in the second set to determine, according to the number of iterations, a target second position corresponding to the number of iterations includes: Obtaining a target second position corresponding to a target iteration number, wherein the target iteration number is an iteration number before a current iteration number; Determine a first distance between the target second position corresponding to the target iteration number and each second position in the second set, and determine a second distance between the first position and each second position in the second set; A second position at which the first distance and the second distance are shortest is determined as the target second position corresponding to the current iteration number.
[0010] By adopting the above technical solution, in each iteration, not only the distance between the target second position corresponding to the target iteration number and each second position in the current second set (first distance) is considered, but also the distance between these second positions and the first position (power plant) (second distance) is considered. This dual distance consideration makes the path selection more accurate and can ensure that the shortest route finally determined is more in line with actual needs and optimization goals.
[0011] In a possible implementation manner, retrieving the target second position corresponding to each iteration number from the second set to the first set includes: Obtaining the electric energy demand corresponding to each second position in the second set; Generate a location label of the target second location corresponding to each iteration number based on the distance between the target second location corresponding to the target iteration number and each second location in the second set and the power demand corresponding to each second location; The target second position corresponding to each iteration number is retrieved from the second set, and the target second position corresponding to each iteration number and the position tag corresponding to the target second position corresponding to each iteration number are retrieved into the first set.
[0012] By adopting the above technical solution, by considering the power demand, power dispatch can be carried out more flexibly. For example, when a power plant fails and the power supply is reduced, the route can be adjusted according to the power demand of the substation to ensure that the key substation has sufficient power supply. At the same time, the introduction of location tags provides richer information. These tags can be used to understand the power demand status of the substation and their positional relationship in the power system, so as to adjust the power generation plan and optimize power dispatch.
[0013] In a possible implementation, determining at least one shortest route according to the iterated first set includes: Determine the transmission start position and the transmission process position of each path based on the target second position corresponding to each first position in the iterated first set and the target second position corresponding to the target iteration number; At least one shortest route is determined based on the transmission start position and the transmission process position of each path.
[0014] By adopting the above technical solution, the transmission path from the power plant (first location) to each substation (target second location) is gradually determined through an iterative process, making the entire path planning process clear and definite, providing clear guidance for the operation and management of the power system. Based on the first set after iteration, it can ensure that the determined route is the shortest route that meets the conditions, which helps to reduce losses in the power transmission process, improve energy utilization efficiency, and reduce operation and maintenance costs.
[0015] In a possible implementation, performing fault pre-diagnosis detection on the at least one shortest route to obtain a target route includes: Acquire historical routing information and an abnormal time node when the routing abnormality occurs in the historical routing abnormality information, wherein the historical routing information is all normal operation information and abnormal operation information of the at least one shortest route occurring in a historical period; Performing fault analysis on the historical routing information and abnormal time nodes to obtain fault pre-diagnosis criteria; After detecting the application instruction of the at least one shortest route, obtaining the route operation parameters related to the at least one shortest route, and generating a transmission parameter fluctuation graph based on the route operation parameters; Based on the transmission parameter fluctuation graph, judging whether the parameter floating trend of the routing operation parameter meets the preset floating trend condition; if not, determining the initial time node where the floating trend exists according to the transmission parameter fluctuation graph, and cutting the transmission parameter fluctuation graph into a first fluctuation graph and a second fluctuation graph according to the initial time node; Determine the highest transmission rate and the lowest transmission rate of the first wave graph, calculate the average of the highest transmission rate and the lowest transmission rate, and use the calculated transmission rate average as a numerator and the time length between the initial time node and the end time node of the first wave graph as a denominator to obtain a first rate change value corresponding to the first wave graph; Determine the highest transmission rate and the lowest transmission rate of the second wave graph, calculate the average of the highest transmission rate and the lowest transmission rate, and use the calculated transmission rate average as the numerator and the time length between the initial time node and the end time node of the second wave graph as the denominator to obtain a second rate change value corresponding to the second wave graph; Performing fault pre-diagnosis on the at least one shortest route according to the first rate change value, the second rate change value, and the fault pre-diagnosis standard to obtain fault pre-diagnosis information; Based on the fault pre-diagnosis information, the at least one shortest route is marked, and the route is gradually replaced with another shortest route or a next-level route next to the at least one shortest route according to the distance between the route and the target location to perform a fault pre-diagnosis cycle until the parameter floating trend of the route operation parameter of the route meets the preset floating trend condition, and the target route is obtained.
[0016] In a possible implementation, the performing fault analysis on the historical routing information and the abnormal time node to obtain a fault pre-diagnosis standard includes: Determine a first route operation parameter and a second route operation parameter in the historical route information according to the abnormal time node, wherein the first route operation parameter is a route operation parameter of the at least one shortest route from the start time node of power transmission to the target time node, and the second route operation parameter is a route operation parameter of the at least one shortest route from the target time node to the abnormal time node, and the target time node is an initial time node at which a change trend of the route operation parameter within a preset time meets a preset condition; generating a first transmission parameter fluctuation graph based on the first routing operation parameter, determining a maximum transmission rate and a minimum transmission rate in the first routing operation parameter according to the first transmission parameter fluctuation graph, calculating the average of the maximum transmission rate and the minimum transmission rate, and using the calculated transmission rate average as a numerator and the time length between the start time node and the target time node as a denominator to obtain a first transmission rate change value corresponding to the first routing operation parameter; generating a second transmission parameter fluctuation graph based on the second routing operation parameter, determining a maximum transmission rate and a minimum transmission rate in the second routing operation parameter according to the second transmission parameter fluctuation graph, calculating the average of the maximum transmission rate and the minimum transmission rate, and using the calculated transmission rate average as a numerator and the time length between the target time node and the abnormal time node as a denominator to obtain a second transmission rate change value corresponding to the second routing operation parameter; The ratio of the first transmission rate change value to the second transmission rate change value is bound to the abnormal fault corresponding to the abnormal time node to obtain a fault pre-diagnosis standard.
[0017] In the second aspect, the present application provides a virtual power plant energy scheduling model construction system, which adopts the following technical solutions: A virtual power plant energy dispatch model construction system, comprising: A location acquisition module, used to acquire a first location of each power plant and a second location of each substation in a target area; An association acquisition module, used to acquire the transmission relationship between each power plant and each substation, wherein the transmission relationship indicates whether there is a transmission connection between the power plant and the substation; A model building module, used to build an energy dispatch model of a virtual power plant corresponding to a target area based on the first location, the second location, and the transmission relationship between each power plant and each substation; A station area acquisition module is used to acquire a target station area with electric energy demand; A location determination module is used to determine the target location of the target substation in the energy dispatch model of the virtual power plant; A route determination module, used to determine at least one shortest route based on the target location; A fault pre-diagnosis module, used for performing fault pre-diagnosis detection on the at least one shortest route to obtain a target route; A scheduling and allocation module is used to perform electric energy scheduling and allocation based on the target route.
[0018] In a possible implementation, when the route determination module determines at least one shortest route based on the target location, it is specifically configured to: Establishing a first set corresponding to the first position and a second set corresponding to the second position; Iterate each second position in the second set to determine a target second position corresponding to the number of iterations according to the number of iterations; Retrieving the target second position corresponding to each iteration number from the second set to the first set; When the second set is empty, stop iterating; At least one shortest route is determined according to the iterated first set.
[0019] In a possible implementation manner, when the route determination module iterates each second position in the second set to determine the target second position corresponding to the number of iterations according to the number of iterations, it is specifically configured to: Obtaining a target second position corresponding to a target iteration number, wherein the target iteration number is an iteration number before a current iteration number; Determine a first distance between the target second position corresponding to the target iteration number and each second position in the second set, and determine a second distance between the first position and each second position in the second set; A second position at which the first distance and the second distance are shortest is determined as the target second position corresponding to the current iteration number.
[0020] In another possible implementation manner, when the route determination module retrieves the target second position corresponding to each iteration number from the second set to the first set, it is specifically configured to: Obtaining the electric energy demand corresponding to each second position in the second set; Generate a location label of the target second location corresponding to each iteration number based on the distance between the target second location corresponding to the target iteration number and each second location in the second set and the power demand corresponding to each second location; The target second position corresponding to each iteration number is retrieved from the second set, and the target second position corresponding to each iteration number and the position tag corresponding to the target second position corresponding to each iteration number are retrieved into the first set.
[0021] In another possible implementation, when the route determination module determines at least one shortest route according to the iterated first set, it is specifically configured to: Determine the transmission start position and the transmission process position of each path based on the target second position corresponding to each first position in the iterated first set and the target second position corresponding to the target iteration number; At least one shortest route is determined based on the transmission start position and the transmission process position of each path.
[0022] In another possible implementation, when the fault pre-diagnosis module performs fault pre-diagnosis detection on at least one shortest route to obtain a target route, it is specifically used to: Acquire historical routing information and an abnormal time node when the routing abnormality occurs in the historical routing abnormality information, wherein the historical routing information is all normal operation information and abnormal operation information of the at least one shortest route occurring in a historical period; Performing fault analysis on the historical routing information and abnormal time nodes to obtain fault pre-diagnosis criteria; After detecting the application instruction of the at least one shortest route, obtaining the route operation parameters related to the at least one shortest route, and generating a transmission parameter fluctuation graph based on the route operation parameters; Based on the transmission parameter fluctuation graph, judging whether the parameter floating trend of the routing operation parameter meets the preset floating trend condition; if not, determining the initial time node where the floating trend exists according to the transmission parameter fluctuation graph, and cutting the transmission parameter fluctuation graph into a first fluctuation graph and a second fluctuation graph according to the initial time node; Determine the highest transmission rate and the lowest transmission rate of the first wave graph, calculate the average of the highest transmission rate and the lowest transmission rate, and use the calculated transmission rate average as a numerator and the time length between the initial time node and the end time node of the first wave graph as a denominator to obtain a first rate change value corresponding to the first wave graph; Determine the highest transmission rate and the lowest transmission rate of the second wave graph, calculate the average of the highest transmission rate and the lowest transmission rate, and use the calculated transmission rate average as the numerator and the time length between the initial time node and the end time node of the second wave graph as the denominator to obtain a second rate change value corresponding to the second wave graph; Performing fault pre-diagnosis on the at least one shortest route according to the first rate change value, the second rate change value, and the fault pre-diagnosis standard to obtain fault pre-diagnosis information; Based on the fault pre-diagnosis information, the at least one shortest route is marked, and the route is gradually replaced with another shortest route or a next-level route next to the at least one shortest route according to the distance between the route and the target location to perform a fault pre-diagnosis cycle until the parameter floating trend of the route operation parameter of the route meets the preset floating trend condition, and the target route is obtained.
[0023] In another possible implementation, when the fault pre-diagnosis module performs fault analysis on the historical routing information and the abnormal time node to obtain the fault pre-diagnosis standard, it is specifically used to: Determine a first route operation parameter and a second route operation parameter in the historical route information according to the abnormal time node, wherein the first route operation parameter is a route operation parameter of the at least one shortest route from the start time node of power transmission to the target time node, and the second route operation parameter is a route operation parameter of the at least one shortest route from the target time node to the abnormal time node, and the target time node is an initial time node at which a change trend of the route operation parameter within a preset time meets a preset condition; generating a first transmission parameter fluctuation graph based on the first routing operation parameter, determining a maximum transmission rate and a minimum transmission rate in the first routing operation parameter according to the first transmission parameter fluctuation graph, calculating the average of the maximum transmission rate and the minimum transmission rate, and using the calculated transmission rate average as a numerator and the time length between the start time node and the target time node as a denominator to obtain a first transmission rate change value corresponding to the first routing operation parameter; generating a second transmission parameter fluctuation graph based on the second routing operation parameter, determining a maximum transmission rate and a minimum transmission rate in the second routing operation parameter according to the second transmission parameter fluctuation graph, calculating the average of the maximum transmission rate and the minimum transmission rate, and using the calculated transmission rate average as a numerator and the time length between the target time node and the abnormal time node as a denominator to obtain a second transmission rate change value corresponding to the second routing operation parameter; The ratio of the first transmission rate change value to the second transmission rate change value is bound to the abnormal fault corresponding to the abnormal time node to obtain a fault pre-diagnosis standard.
[0024] In a third aspect, the present application provides an electronic device, which adopts the following technical solution: An electronic device, comprising: at least one processor; Memory; At least one application, wherein at least one application is stored in a memory and configured to be executed by at least one processor, and the at least one application is configured to: execute the virtual power plant energy scheduling model construction method described in the first aspect above.
[0025] In a fourth aspect, the present application provides a computer-readable storage medium, which adopts the following technical solution: A computer-readable storage medium, comprising: storing a computer program that can be loaded by a processor and execute the method for constructing a virtual power plant energy scheduling model as described in the first aspect above.
[0026] In summary, the present application includes the following beneficial technical effects: by obtaining the first position of each power plant and the second position of each substation in the target area, as well as the transmission relationship between them, a detailed energy dispatching model of the virtual power plant can be constructed, which provides clear and intuitive information, and then real-time power demand monitoring is performed to obtain the target substation with power demand to ensure the accuracy and timeliness of power distribution. The target position of the target substation is determined in the energy dispatching model of the virtual power plant. After the target position is determined, at least one shortest route is determined based on the target position. In order to ensure the stable availability of at least one selected shortest route, a fault pre-diagnosis detection is performed on at least one shortest route to obtain the target route, that is, the obtained target route is not only better in distance to the target position, but also has better stable availability for power transmission, thereby realizing efficient and stable transmission of power. Power dispatching and distribution is performed based on the determined target route. By optimizing the power distribution strategy, efficient use of power and reduction of transmission losses can be achieved, thereby improving the overall operating efficiency of the power system. BRIEF DESCRIPTION OF THE DRAWINGS
[0027] Figure 1 It is a flowchart of a method for constructing a virtual power plant energy scheduling model provided in an embodiment of the present application; Figure 2 It is a block diagram of a virtual power plant energy scheduling model construction system provided in an embodiment of the present application; Figure 3 It is a schematic diagram of an electronic device provided in an embodiment of the present application. DETAILED DESCRIPTION
[0028] The following is combined with Figure 1 -Attached Figure 3 This application is described in further detail.
[0029] In order to make the purpose, technical solution and advantages of the embodiments of the present application clearer, the technical solution in the embodiments of the present application will be clearly and completely described below in conjunction with the drawings in the embodiments of the present application. Obviously, the described embodiments are part of the embodiments of the present application, not all of the embodiments. Based on the embodiments in the present application, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of this application.
[0030] In order to facilitate understanding of the technical solution proposed in this application, several elements introduced in the description of this application are first introduced here. It should be understood that the following introduction is only for the convenience of understanding these elements, so as to understand the content of the embodiments of this application, and does not necessarily cover all possible situations.
[0031] With the continuous growth of energy demand and the transformation of energy structure, the power system is facing unprecedented challenges and opportunities. Especially in the context of a significant increase in the proportion of renewable energy access, the stability and economy of the power system have been greatly tested. In order to effectively solve these problems, building an efficient and intelligent energy dispatch model for virtual power plants and improving the operating efficiency and reliability of the system by optimizing power distribution and determining the shortest route has become one of the hot topics in current power system research.
[0032] Virtual power plant is an energy management system based on advanced communication technology and software system. It can aggregate distributed resources such as distributed power sources, distributed energy storage, controllable loads, electric vehicles, etc. in the power system, optimize them into a coordinated whole, and manage and dispatch them in a unified manner. The emergence of this model provides new ideas and methods for the optimized operation of the power system.
[0033] In the energy dispatch model of virtual power plants, power distribution is a key link. The traditional direct distribution method often ignores the path optimization during power transmission, which may cause the path of power flow to be too long, thereby causing unnecessary power loss. In the current context of energy shortage, energy conservation and emission reduction, how to reduce power consumption during power transmission has become an urgent problem to be solved.
[0034] In view of this, the embodiment of the present application provides a method for constructing a virtual power plant energy dispatch model, which determines real-time power demand monitoring by constructing a power plant power dispatch model to obtain target substations with power demand to ensure the accuracy and timeliness of power distribution, and determines the target location of the target substation in the energy dispatch model of the virtual power plant. After determining the target location, at least one shortest route is determined based on the target location, thereby determining the optimal path from the power plant to the target substation, thereby achieving efficient and stable transmission of electric energy. Based on the determined shortest route, power dispatch and distribution are performed, and by optimizing the power distribution strategy, efficient use of electric energy and reduction of transmission losses can be achieved, thereby improving the overall operating efficiency of the power system. In summary, the power distribution and shortest route optimization technology based on the energy dispatch model of the virtual power plant is an advanced power system optimization method. It can realize real-time monitoring and prediction of power demand, accurately determine the location of the target substation, and determine the optimal power transmission path based on multiple factors.
[0035] See also Figure 1 The embodiment of the present application provides a method for constructing a virtual power plant energy scheduling model, which is executed by an electronic device, and the method includes: Step S10: Obtain the first position of each power plant and the second position of each substation in the target area.
[0036] In an embodiment of the present application, the power plant is divided into regions according to the coverage area of each power plant. There is an overlapping area between the coverage area of the power plant and the coverage area of the adjacent power plant. Therefore, in order to determine the ownership of the overlapping area, the position corresponding to each substation (i.e., the second position) is first obtained, and then the ownership of the overlapping area is determined based on the actual difference between the power plant position (i.e., the first position) and the substation position, so as to determine the jurisdiction area corresponding to each power plant. When determining the target area, the target area is divided in combination with the jurisdiction area corresponding to each power plant and the load of the power plant. Avoid the existence of incomplete jurisdiction areas in the target area, that is, the target area can contain multiple complete jurisdiction areas, but there is no partial jurisdiction area of any area of the power plant.
[0037] Specifically, ultra-wideband positioning technology or other high-precision positioning technology can be used to obtain the precise location information of each power plant and substation in the target area, and the transmission relationship data between the power plant and the substation can be obtained through the power grid's dispatching system.
[0038] Furthermore, a GIS (Geographic Information System) engine may be used to visualize the location information of power plants and substations on a map, and different icons or colors may be used to distinguish between power plants and substations for easy identification.
[0039] Step S11, obtaining the transmission relationship between each power plant and each substation.
[0040] Among them, the transmission relationship represents whether there is a transmission connection between the power plant and the substation.
[0041] Step S12: construct an energy dispatch model of the virtual power plant corresponding to the target area based on the first position, the second position and the transmission relationship between each power plant and each substation.
[0042] Draw the transmission lines between power plants and substations on the map to represent the transmission relationship between them, and then integrate the power plants, substations and the transmission lines between them into an energy dispatch model of a virtual power plant on the GIS platform. Specifically, different line types, colors or thicknesses can be used to represent different attributes of the transmission lines (such as voltage level, transmission capacity, etc.).
[0043] Step S13: Obtain the target area with power demand.
[0044] Step S14: In the energy dispatch model of the virtual power plant, determine the target location of the target substation.
[0045] Specifically, in the energy dispatch model of the virtual power plant, the spatial query of the GIS platform can be used to filter out the location of the target substation. Furthermore, the map display function of the GIS platform can be used to highlight the filtered target substation on the map, so as to intuitively determine its target location.
[0046] Step S15: Determine at least one shortest route based on the target location.
[0047] Among them, routing refers to the path information of sending electric energy from the source to the destination, which can also be understood as the process of moving electric energy from the source location to the destination location through the electric energy transmission path.
[0048] After knowing the positions of the power plant and the target substation in the energy dispatch model of the virtual power plant, a shortest path can be determined based on their respective positions as the shortest route, thereby optimizing the transmission path and reducing transmission losses while ensuring that the power of all target substations is met.
[0049] Specifically, based on the power plant's location in the energy scheduling model of the virtual power plant, the target location closest to the power plant location is screened out from various target locations as the first target location, and then the target location closest to the first target location is screened out from various target locations except the first target location as the second target location, and so on, to obtain the shortest route.
[0050] Since one power plant is responsible for supplying power to multiple substations, when there are multiple power plant locations and multiple target locations, the first target location corresponding to each power plant location is screened out from each target location, and the second target location corresponding to each first target location is screened out, and so on, to obtain multiple shortest routes.
[0051] Step S16: Perform fault pre-diagnosis detection on at least one shortest route to obtain a target route.
[0052] Specifically, obtain the abnormal time node when the routing abnormality occurs in the historical routing information and the historical routing abnormality information, the historical routing information is all the normal operation information and abnormal operation information of at least one shortest route in the historical period, perform fault analysis on the historical routing information and the abnormal time node, and obtain the fault pre-diagnosis standard. When the application instruction of at least one shortest route is detected, obtain the routing operation parameters of at least one shortest route, and generate a transmission parameter fluctuation graph based on the routing operation parameters. Based on the transmission parameter fluctuation graph, determine whether the parameter floating trend of the routing operation parameters meets the preset floating trend condition. If not, determine the initial time node with the floating trend according to the transmission parameter fluctuation graph, and cut the transmission parameter fluctuation graph into a first fluctuation graph and a second fluctuation graph according to the initial time node, determine the highest transmission rate and the lowest transmission rate of the first fluctuation graph, calculate the average of the highest transmission rate and the lowest transmission rate, and use the calculated transmission rate average as the value of the transmission parameter fluctuation graph. The numerator is a numerator, and the time taken between the initial time node and the termination time node of the first fluctuation graph is used as the denominator to obtain a first rate change value corresponding to the first fluctuation graph, and the maximum transmission rate and the minimum transmission rate of the second fluctuation graph are determined. The maximum transmission rate and the minimum transmission rate are averaged, and the calculated transmission rate average is used as the numerator, and the time taken between the initial time node and the termination time node of the second fluctuation graph is used as the denominator to obtain a second rate change value corresponding to the second fluctuation graph. According to the first rate change value, the second rate change value and the fault pre-diagnosis standard, at least one shortest route is pre-diagnosed to obtain fault pre-diagnosis information, and at least one shortest route is marked based on the fault pre-diagnosis information, and the route is gradually replaced to another shortest route or a next-level route second only to the at least one shortest route according to the distance between the route and the target location to perform a fault pre-diagnosis cycle until the parameter floating trend of the route operation parameter of the route meets the preset floating trend condition, and the target route is obtained.
[0053] For the embodiment of the present application, if an abnormality occurs at a certain moment in the process of power transmission, then in the period before this moment, the operation parameters of the route will be inconsistent with the normal state, that is, the operation parameters of the route symbolizing the precursor of the abnormality, but the operation parameters of the route symbolizing the precursor of the abnormality fluctuate slightly, so it is difficult to accurately capture. The embodiment of the present application adopts big data and data processing technology to extract representative data from historical data that can highlight the impending fault and normal data without highlighting the fault, and obtains the corresponding fault pre-diagnosis standard by adopting the algorithm of transmission data ratio, and then analyzes the current route transmission situation. If it can be matched with the fault pre-diagnosis standard, it indicates the possibility of a fault, thereby improving the recognition accuracy of fault pre-diagnosis for at least one shortest route, and at the same time, it can also detect the stable availability of at least one shortest route.
[0054] In addition, after a fault is identified, it is necessary to mark the current route for fault pre-diagnosis, and switch to another route that is second only to the current route in distance from the target location, and continue to perform fault pre-diagnosis detection on the other route in a cycle until the floating trend of the route operation parameters meets the preset floating trend condition, then determine that the route is the target route. If the parameter floating trend of the route operation parameters of the other route still does not meet the preset floating trend condition, then perform pre-diagnosis on the other route according to the fault pre-diagnosis method of the current route to determine the fault type of the other route, and at the same time switch to another route that is second only to the other route in distance from the target location for cyclic fault pre-diagnosis detection, until a route is obtained in which the parameter floating trend of the route operation parameters meets the preset floating trend condition, and the route is defined as the target route.
[0055] In the embodiment of the present application, the preset floating trend condition is a floating critical range value of the routing operation parameter formulated by the staff according to the actual power transmission situation.
[0056] Specifically, a fault analysis is performed on the historical routing information and the abnormal time node to obtain a fault pre-diagnosis standard, including: determining a first routing operation parameter and a second routing operation parameter in the historical routing information according to the abnormal time node, the first routing operation parameter being a routing operation parameter of at least one shortest route from the start time node of electric energy transmission to the target time node, the second routing operation parameter being a routing operation parameter of at least one shortest route from the target time node to the abnormal time node, the target time node being an initial time node at which a change trend of the routing operation parameter within a preset time meets a preset condition, generating a first transmission parameter fluctuation graph based on the first routing operation parameter, determining a maximum transmission rate and a minimum transmission rate in the first routing operation parameter according to the first transmission parameter fluctuation graph, and performing a pre-diagnosis analysis on the maximum transmission rate and the minimum transmission rate. The method comprises the following steps: calculating the mean value of the transmission rate, taking the calculated mean value of the transmission rate as the numerator, taking the time taken between the start time node and the target time node as the denominator, obtaining a first transmission rate change value corresponding to the first routing operation parameter, generating a second transmission parameter fluctuation graph based on the second routing operation parameter, determining the highest transmission rate and the lowest transmission rate in the second routing operation parameter according to the second transmission parameter fluctuation graph, calculating the mean value of the highest transmission rate and the lowest transmission rate, taking the calculated mean value of the transmission rate as the numerator, taking the time taken between the target time node and the abnormal time node as the denominator, obtaining a second transmission rate change value corresponding to the second routing operation parameter, binding a ratio of the first transmission rate change value to the second transmission rate change value to the abnormal fault corresponding to the abnormal time node, and obtaining a fault pre-diagnosis standard.
[0057] For the application embodiments of this book, the fault pre-diagnosis standard is expressed in the form of: ratio-abnormal fault type, and the ratio expresses a range. For example, if multiple different ratios correspond to different abnormal fault types, then the maximum and minimum values of multiple different ratios are taken to form a range critical point, thereby forming a range value, that is, ratio range-abnormal fault type.
[0058] Step S17: Dispatch and allocate electric energy based on the target route.
[0059] After the target route is obtained, based on the amount of electric energy required by each target substation, the power plant outputs electric energy to the first location, the second location, etc. in sequence until the electric energy requirements of all target substations are met.
[0060] For the embodiment of the present application, the first position of each power plant and the second position of each substation in the target area, as well as the transmission relationship between them, are obtained, and a detailed energy dispatch model of the virtual power plant can be constructed, providing clear and intuitive information. Then, real-time power demand monitoring is performed to obtain the target substation with power demand to ensure the accuracy and timeliness of power distribution. The target position of the target substation is determined in the energy dispatch model of the virtual power plant. After the target position is determined, at least one shortest route is determined based on the target position. In order to ensure the stable availability of at least one selected shortest route, a fault pre-diagnosis detection is performed on at least one shortest route to obtain the target route, that is, the obtained target route is not only better in distance to the target position, but also has better stable availability for power transmission, thereby realizing efficient and stable transmission of power. Power dispatch and distribution are performed based on the determined target route. By optimizing the power distribution strategy, efficient use of power and reduction of transmission losses can be achieved, thereby improving the overall operating efficiency of the power system.
[0061] In a possible implementation of the embodiment of the present application, in the above step S15, in determining at least one shortest route based on the target location, determining at least one shortest route based on the target location may specifically include: Establishing a first set corresponding to the first position and a second set corresponding to the second position; Iterate each second position in the second set to determine a target second position corresponding to the number of iterations according to the number of iterations; Retrieving the target second position corresponding to each iteration number from the second set to the first set; When the second set is empty, stop iterating; At least one shortest route is determined according to the iterated first set.
[0062] Specifically, a first set and a second set are established, and an empty first set (for storing the second positions, ie, stations, selected during the iteration process) and a second set containing all second positions (stations) are initialized.
[0063] Further, iterate each second position (station) in the second set. In each iteration, the shortest path from each first position (power plant) to the second position (station) in the current iteration is calculated based on an algorithm (such as Dijkstra algorithm, Floyd-Warshall algorithm or Bellman-Ford algorithm, etc.). And according to the number of iterations and the algorithm results, determine one or more target second positions (stations) that have the shortest path in a certain sense in the current iteration.
[0064] Furthermore, the target second position corresponding to each iteration number is removed from the second set and added to the first set. After each iteration, it is checked whether the second set is empty. If the second set is empty, it means that all second positions (stations) have been processed and the iteration ends.
[0065] After the iteration is completed, the first set contains all the target second locations (substations) of the determined shortest paths. And based on the target second locations in the first set and the shortest path information between them and the first location (power plant), at least one shortest route from the power plant to the substation is constructed.
[0066] A possible implementation manner of the embodiment of the present application, in the above embodiment, iterating each second position in the second set to determine the target second position corresponding to the number of iterations according to the number of iterations, may specifically include: Obtain the target second position corresponding to the target iteration number, where the target iteration number is the iteration number before the current iteration number; Determine the first distance between the target second position corresponding to the target iteration number and each second position in the second set, and determine the second distance between the first position and each second position in the second set; The second position having the shortest first distance and second distance is determined as the target second position corresponding to the current iteration number.
[0067] Specifically, during the iteration process, in the first iteration (iteration number is 0), since there is no target second position corresponding to the previous iteration number, the target second position at this time is the power plant position, which serves as the starting point. In subsequent iterations, the target second position corresponding to the target iteration number is the target second position determined in the previous iteration.
[0068] Furthermore, the direct distance from the first position to each second position in the second set (or the shortest path distance calculated according to the power grid topology) is calculated and recorded as the second distance. For each second position that has not been visited, its total distance is calculated. If this is the first iteration, the total distance is the second distance; if it is not the first iteration, the total distance is the sum of the first distance and the second distance. Then, among all the second positions that have not been visited, the second position with the smallest total distance is selected as the target second position for the current iteration.
[0069] A possible implementation manner of the embodiment of the present application, in the above embodiment, retrieving the target second position corresponding to each iteration number from the second set to the first set may specifically include: Obtaining the electric energy demand corresponding to each second position in the second set; Generate a location label of the target second position corresponding to each iteration number based on the distance between the target second position corresponding to the target iteration number and each second position in the second set and the power demand corresponding to each second position; The target second position corresponding to each iteration number is retrieved from the second set, and the target second position corresponding to each iteration number and the position tag corresponding to the target second position corresponding to each iteration number are retrieved into the first set.
[0070] Specifically, the electric energy demand corresponding to each second position in the second set is obtained, and a demand tag corresponding to each second position is generated based on the electric energy demand. Then, the target second position corresponding to the current iteration number can be determined according to an iterative algorithm (such as a greedy algorithm, a Dijkstra algorithm, etc.), all second positions in the second set are traversed, and the distance between the target second position corresponding to the current iteration number and each second position in the second set is calculated, so as to generate a distance tag corresponding to each second position based on the distance between the target second position corresponding to the current iteration number and each second position in the second set. Based on the distance tag and the demand tag corresponding to each second position, the position tag corresponding to the target second position corresponding to the current iteration number is obtained, so as to obtain the position tag corresponding to the target second position corresponding to each iteration number. Among them, the position tag includes the electric energy demand corresponding to the target second position and the distance corresponding to each second position.
[0071] After obtaining the target second position corresponding to each iteration number, when the target second position is called out from the second set, the target second position corresponding to each iteration number and the position label corresponding to the target second position corresponding to each iteration number are composed into a data set and called into the first set together.
[0072] A possible implementation manner of the embodiment of the present application, in the above embodiment, determining at least one shortest route according to the iterated first set includes: Determine the transmission start position and the transmission process position of each path based on the target second position corresponding to each first position in the iterated first set and the target second position corresponding to the target iteration number; At least one shortest route is determined based on the transmission start position and the transmission process position of each path.
[0073] Specifically, for each element in the first set, its transmission starting position is the first position (power plant), and for each element in the first set, its transmission process position is all the intermediate nodes on the path represented by the element, which may be one or more intermediate nodes, arranged in order from the first position to the target second position to obtain the target sequence. Exemplarily, if the number of iterations is 3, the target sequence is the first position-the target second position corresponding to iteration number 1-the target second position corresponding to iteration number 2-the target second position corresponding to iteration number 3.
[0074] Furthermore, the first position in the target sequence is used as the transport start position, the target second position corresponding to the maximum number of iterations is used as the transport end position, and the target second positions corresponding to the remaining number of iterations are used as the transport process position. Based on the transport start position, the transport process position and the transport end position, the shortest route is obtained.
[0075] Furthermore, when there are multiple first positions, multiple target sequences are obtained based on the order from each first position to the target second position, and multiple routes are obtained based on the multiple target sequences.
[0076] The above-mentioned embodiment introduces a method for constructing a virtual power plant energy scheduling model from the perspective of method flow. The following embodiment introduces a system for constructing a virtual power plant energy scheduling model from the perspective of a virtual module or virtual unit. For details, please refer to the following embodiment.
[0077] See also Figure 2 A virtual power plant energy dispatch model construction system 20 may specifically include: a location acquisition module 21, an association acquisition module 22, a model construction module 23, an area acquisition module 24, a location determination module 25, a route determination module 26, a fault pre-diagnosis module 27 and a dispatch allocation module 28, wherein: A virtual power plant energy dispatch model construction system 20, comprising: A location acquisition module 21, used to acquire a first location of each power plant and a second location of each substation in a target area; The association acquisition module 22 is used to acquire the transmission relationship between each power plant and each substation, and the transmission relationship indicates whether there is a transmission connection between the power plant and the substation; A model building module 23, for building an energy dispatch model of a virtual power plant corresponding to a target area based on the first location, the second location, and the transmission relationship between each power plant and each substation; The area acquisition module 24 is used to acquire the target area where the power demand exists; The location determination module 25 is used to determine the target location of the target substation in the energy dispatch model of the virtual power plant; A route determination module 26, configured to determine at least one shortest route based on a target location; A fault pre-diagnosis module 27, configured to perform fault pre-diagnosis detection on at least one shortest route to obtain a target route; The scheduling and allocation module 28 is used to perform power scheduling and allocation based on the target route.
[0078] In a possible implementation of the embodiment of the present application, when the route determination module 26 determines at least one shortest route based on the target location, it is specifically used to: Establishing a first set corresponding to the first position and a second set corresponding to the second position; Iterate each second position in the second set to determine a target second position corresponding to the number of iterations according to the number of iterations; Retrieving the target second position corresponding to each iteration number from the second set to the first set; When the second set is empty, stop iterating; At least one shortest route is determined according to the iterated first set.
[0079] In another possible implementation of the embodiment of the present application, when the route determination module 26 iterates each second position in the second set to determine the target second position corresponding to the number of iterations according to the number of iterations, it is specifically configured to: Obtain the target second position corresponding to the target iteration number, where the target iteration number is the iteration number before the current iteration number; Determine the first distance between the target second position corresponding to the target iteration number and each second position in the second set, and determine the second distance between the first position and each second position in the second set; The second position having the shortest first distance and second distance is determined as the target second position corresponding to the current iteration number.
[0080] In another possible implementation of the embodiment of the present application, when the route determination module 26 retrieves the target second position corresponding to each iteration number from the second set to the first set, it is specifically configured to: Obtaining the electric energy demand corresponding to each second position in the second set; Generate a location label of the target second position corresponding to each iteration number based on the distance between the target second position corresponding to the target iteration number and each second position in the second set and the power demand corresponding to each second position; The target second position corresponding to each iteration number is retrieved from the second set, and the target second position corresponding to each iteration number and the position label corresponding to the target second position corresponding to each iteration number are retrieved into the first set.
[0081] In another possible implementation of the embodiment of the present application, when the route determination module 26 determines at least one shortest route according to the iterated first set, it is specifically configured to: Determine the transmission start position and the transmission process position of each path based on the target second position corresponding to each first position in the iterated first set and the target second position corresponding to the target iteration number; At least one shortest route is determined based on the transmission start position and the transmission process position of each path.
[0082] In another possible implementation of the embodiment of the present application, when the fault pre-diagnosis module 27 performs fault pre-diagnosis detection on at least one shortest route to obtain a target route, it is specifically used to: Obtaining the abnormal time node when the routing abnormality occurred in the historical routing information and the historical routing abnormality information, wherein the historical routing information is all normal operation information and abnormal operation information of at least one shortest route in the historical period; Perform fault analysis on historical routing information and abnormal time nodes to obtain fault pre-diagnosis standards; When at least one shortest route application instruction is detected, a route operation parameter related to at least one shortest route is acquired, and a transmission parameter fluctuation graph is generated based on the route operation parameter; Based on the transmission parameter fluctuation graph, it is judged whether the parameter floating trend of the routing operation parameter meets the preset floating trend condition. If not, the initial time node where the floating trend exists is determined according to the transmission parameter fluctuation graph, and the transmission parameter fluctuation graph is cut into a first fluctuation graph and a second fluctuation graph according to the initial time node; Determine the highest transmission rate and the lowest transmission rate of the first wave graph, calculate the average of the highest transmission rate and the lowest transmission rate, and use the calculated transmission rate average as the numerator and the time length between the initial time node and the end time node of the first wave graph as the denominator to obtain a first rate change value corresponding to the first wave graph; Determine the highest transmission rate and the lowest transmission rate of the second wave graph, calculate the average of the highest transmission rate and the lowest transmission rate, and use the calculated transmission rate average as the numerator and the time length between the initial time node and the end time node of the second wave graph as the denominator to obtain a second rate change value corresponding to the second wave graph; Performing fault pre-diagnosis on at least one shortest route according to the first rate change value, the second rate change value and the fault pre-diagnosis standard to obtain fault pre-diagnosis information; At least one shortest route is marked based on the fault pre-diagnosis information, and is gradually replaced with another shortest route or a next-level route next to at least one shortest route according to the distance between the route and the target location for a fault pre-diagnosis cycle until the parameter floating trend of the route operation parameter of the route meets the preset floating trend condition and the target route is obtained.
[0083] In another possible implementation of the embodiment of the present application, when the fault pre-diagnosis module 27 performs fault analysis on the historical routing information and the abnormal time node to obtain the fault pre-diagnosis standard, it is specifically used to: Determine the first route operation parameter and the second route operation parameter in the historical route information according to the abnormal time node, the first route operation parameter is the route operation parameter of at least one shortest route from the start time node of power transmission to the target time node, the second route operation parameter is the route operation parameter of at least one shortest route from the target time node to the abnormal time node, and the target time node is the initial time node at which the change trend of the route operation parameter within the preset time meets the preset conditions; Generate a first transmission parameter fluctuation graph based on the first routing operation parameter, determine the highest transmission rate and the lowest transmission rate in the first routing operation parameter according to the first transmission parameter fluctuation graph, calculate the average of the highest transmission rate and the lowest transmission rate, and use the calculated transmission rate average as a numerator and the time length between the start time node and the target time node as a denominator to obtain a first transmission rate change value corresponding to the first routing operation parameter; Generate a second transmission parameter fluctuation graph based on the second routing operation parameter, determine the highest transmission rate and the lowest transmission rate in the second routing operation parameter according to the second transmission parameter fluctuation graph, calculate the average of the highest transmission rate and the lowest transmission rate, and use the calculated transmission rate average as a numerator and the time length between the target time node and the abnormal time node as a denominator to obtain a second transmission rate change value corresponding to the second routing operation parameter; The ratio of the first transmission rate change value to the second transmission rate change value is bound to the abnormal fault corresponding to the abnormal time node to obtain a fault pre-diagnosis standard.
[0084] Those skilled in the art can clearly understand that, for the convenience and brevity of description, the specific working processes of the systems, devices and units described above can refer to the corresponding processes in the aforementioned method embodiments and will not be repeated here.
[0085] See also Figure 3 , the embodiment of the present application also introduces an electronic device from the perspective of a physical device, such as Figure 3 As shown, Figure 3The electronic device 300 shown includes: a processor 301 and a memory 303. The processor 301 and the memory 303 are connected, such as through a bus 302. Optionally, the electronic device 300 may also include a transceiver 304. It should be noted that in actual applications, the transceiver 304 is not limited to one, and the structure of the electronic device 300 does not constitute a limitation on the embodiments of the present application.
[0086] The processor 301 may be a CPU (Central Processing Unit), a general-purpose processor, a DSP (Digital Signal Processor), an ASIC (Application Specific Integrated Circuit), an FPGA (Field Programmable Gate Array) or other programmable logic devices, transistor logic devices, hardware components or any combination thereof. It may implement or execute various exemplary logic blocks, modules and circuits described in conjunction with the disclosure of this application. The processor 301 may also be a combination that implements computing functions, such as a combination of one or more microprocessors, a combination of a DSP and a microprocessor, etc.
[0087] The bus 302 may include a path to transmit information between the above components. The bus 302 may be a PCI (Peripheral Component Interconnect) bus or an EISA (Extended Industry Standard Architecture) bus. The bus 302 may be divided into an address bus, a data bus, a control bus, etc. For ease of representation, Figure 3 Only one thick line is used in the diagram, but this does not mean that there is only one bus or only one type of bus.
[0088] The memory 303 may be a ROM (Read Only Memory) or other types of static storage devices that can store static information and instructions, a RAM (Random Access Memory) or other types of dynamic storage devices that can store information and instructions, or an EEPROM (Electrically Erasable Programmable Read Only Memory), a CD-ROM (Compact Disc Read Only Memory) or other optical disk storage, optical disk storage (including compressed optical disk, laser disk, optical disk, digital versatile disk, Blu-ray disk, etc.), a magnetic disk storage medium or other magnetic storage device, or any other medium that can be used to carry or store the desired program code in the form of instructions or data structures and can be accessed by a computer, but is not limited thereto.
[0089] The memory 303 is used to store the application code for executing the solution of the present application, and the execution is controlled by the processor 301. The processor 301 is used to execute the application code stored in the memory 303 to implement the contents shown in the above method embodiment.
[0090] The electronic devices include but are not limited to: mobile phones, laptop computers, digital broadcast receivers, PDAs (personal digital assistants), PADs (tablet computers), PMPs (portable multimedia players), vehicle-mounted terminals (such as vehicle-mounted navigation terminals), etc., and fixed terminals such as digital TVs, desktop computers, etc., and can also be servers, etc. Figure 3 The electronic device shown is merely an example and should not bring any limitation to the functions and scope of use of the embodiments of the present application.
[0091] An embodiment of the present application provides a computer-readable storage medium, on which a computer program is stored. When the computer-readable storage medium is run on a computer, the computer can execute the corresponding content in the aforementioned method embodiment.
[0092] It should be understood that, although the steps in the flowchart of the accompanying drawings are displayed in sequence as indicated by the arrows, these steps are not necessarily executed in sequence in the order indicated by the arrows. Unless otherwise specified herein, there is no strict order restriction on the execution of these steps, and they can be executed in other orders. Moreover, at least a part of the steps in the flowchart of the accompanying drawings may include multiple sub-steps or multiple stages, and these sub-steps or stages are not necessarily executed at the same time, but can be executed at different times, and their execution order is not necessarily sequential, but can be executed in turn or alternately with other steps or at least a part of the sub-steps or stages of other steps.
[0093] The above are only some implementation methods of the present application. It should be pointed out that for ordinary technicians in this technical field, several improvements and modifications can be made without departing from the principles of the present application. These improvements and modifications should also be regarded as the scope of protection of the present application.
Claims
1. A method for constructing a virtual power plant energy scheduling model, characterized in that: include: Obtain a first position of each power plant and a second position of each substation in the target area; Obtaining a transmission relationship between each power plant and each substation, wherein the transmission relationship indicates whether there is a transmission connection between the power plant and the substation; Based on the first location, the second location, and the transmission relationship between each power plant and each substation, construct an energy dispatch model of the virtual power plant corresponding to the target area; Acquire the target area with power demand; In the energy dispatch model of the virtual power plant, the target location of the target substation is determined; Based on the target location, determining at least one shortest route; Performing fault pre-diagnosis detection on the at least one shortest route to obtain a target route; Electric energy scheduling and allocation is performed based on the target route.
2. The method for constructing a virtual power plant energy scheduling model according to claim 1, characterized in that: The determining, based on the target location, at least one shortest route comprises: Establishing a first set corresponding to the first position and a second set corresponding to the second position; Iterate each second position in the second set to determine a target second position corresponding to the number of iterations according to the number of iterations; Retrieving the target second position corresponding to each iteration number from the second set to the first set; When the second set is empty, stop iterating; At least one shortest route is determined according to the iterated first set.
3. The method for constructing a virtual power plant energy scheduling model according to claim 2, characterized in that: The iterating each second position in the second set to determine the target second position corresponding to the number of iterations according to the number of iterations includes: Obtaining a target second position corresponding to a target iteration number, wherein the target iteration number is an iteration number before a current iteration number; Determine a first distance between the target second position corresponding to the target iteration number and each second position in the second set, and determine a second distance between the first position and each second position in the second set; A second position at which the first distance and the second distance are shortest is determined as the target second position corresponding to the current iteration number.
4. The method for constructing a virtual power plant energy scheduling model according to claim 3, characterized in that: The step of retrieving the target second position corresponding to each iteration number from the second set to the first set includes: Obtaining the electric energy demand corresponding to each second position in the second set; Generate a location label of the target second location corresponding to each iteration number based on the distance between the target second location corresponding to the target iteration number and each second location in the second set and the power demand corresponding to each second location; The target second position corresponding to each iteration number is retrieved from the second set, and the target second position corresponding to each iteration number and the position tag corresponding to the target second position corresponding to each iteration number are retrieved into the first set.
5. The method for constructing a virtual power plant energy scheduling model according to claim 3, characterized in that: The step of determining at least one shortest route according to the iterated first set includes: Determine the transmission start position and the transmission process position of each path based on the target second position corresponding to each first position in the iterated first set and the target second position corresponding to the target iteration number; At least one shortest route is determined based on the transmission start position and the transmission process position of each path.
6. The method for constructing a virtual power plant energy scheduling model according to claim 1, characterized in that: The performing fault pre-diagnosis detection on the at least one shortest route to obtain a target route includes: Acquire historical routing information and an abnormal time node when the routing abnormality occurs in the historical routing abnormality information, wherein the historical routing information is all normal operation information and abnormal operation information of the at least one shortest route occurring in a historical period; Performing fault analysis on the historical routing information and abnormal time nodes to obtain fault pre-diagnosis criteria; After detecting the application instruction of the at least one shortest route, obtaining the route operation parameters related to the at least one shortest route, and generating a transmission parameter fluctuation graph based on the route operation parameters; Based on the transmission parameter fluctuation graph, judging whether the parameter floating trend of the routing operation parameter meets the preset floating trend condition; if not, determining the initial time node where the floating trend exists according to the transmission parameter fluctuation graph, and cutting the transmission parameter fluctuation graph into a first fluctuation graph and a second fluctuation graph according to the initial time node; Determine the highest transmission rate and the lowest transmission rate of the first wave graph, calculate the average of the highest transmission rate and the lowest transmission rate, and use the calculated transmission rate average as a numerator and the time length between the initial time node and the end time node of the first wave graph as a denominator to obtain a first rate change value corresponding to the first wave graph; Determine the highest transmission rate and the lowest transmission rate of the second wave graph, calculate the average of the highest transmission rate and the lowest transmission rate, and use the calculated transmission rate average as the numerator and the time length between the initial time node and the end time node of the second wave graph as the denominator to obtain a second rate change value corresponding to the second wave graph; Performing fault pre-diagnosis on the at least one shortest route according to the first rate change value, the second rate change value, and the fault pre-diagnosis standard to obtain fault pre-diagnosis information; Based on the fault pre-diagnosis information, the at least one shortest route is marked, and the route is gradually replaced with another shortest route or a next-level route next to the at least one shortest route according to the distance between the route and the target location to perform a fault pre-diagnosis cycle until the parameter floating trend of the route operation parameter of the route meets the preset floating trend condition, and the target route is obtained.
7. The method for constructing a virtual power plant energy scheduling model according to claim 6, characterized in that: The performing fault analysis on the historical routing information and abnormal time nodes to obtain a fault pre-diagnosis standard includes: Determine a first route operation parameter and a second route operation parameter in the historical route information according to the abnormal time node, wherein the first route operation parameter is a route operation parameter of the at least one shortest route from the start time node of power transmission to the target time node, and the second route operation parameter is a route operation parameter of the at least one shortest route from the target time node to the abnormal time node, and the target time node is an initial time node at which a change trend of the route operation parameter within a preset time meets a preset condition; generating a first transmission parameter fluctuation graph based on the first routing operation parameter, determining a maximum transmission rate and a minimum transmission rate in the first routing operation parameter according to the first transmission parameter fluctuation graph, calculating the average of the maximum transmission rate and the minimum transmission rate, and using the calculated transmission rate average as a numerator and the time length between the start time node and the target time node as a denominator to obtain a first transmission rate change value corresponding to the first routing operation parameter; generating a second transmission parameter fluctuation graph based on the second routing operation parameter, determining a maximum transmission rate and a minimum transmission rate in the second routing operation parameter according to the second transmission parameter fluctuation graph, calculating the average of the maximum transmission rate and the minimum transmission rate, and using the calculated transmission rate average as a numerator and the time length between the target time node and the abnormal time node as a denominator to obtain a second transmission rate change value corresponding to the second routing operation parameter; The ratio of the first transmission rate change value to the second transmission rate change value is bound to the abnormal fault corresponding to the abnormal time node to obtain a fault pre-diagnosis standard.
8. A virtual power plant energy scheduling model construction system, characterized in that: include: A location acquisition module, used to acquire a first location of each power plant and a second location of each substation in a target area; An association acquisition module, used to acquire the transmission relationship between each power plant and each substation, wherein the transmission relationship indicates whether there is a transmission connection between the power plant and the substation; A model building module, used to build an energy dispatch model of a virtual power plant corresponding to a target area based on the first location, the second location, and the transmission relationship between each power plant and each substation; A station area acquisition module is used to acquire a target station area with electric energy demand; A location determination module is used to determine the target location of the target substation in the energy dispatch model of the virtual power plant; A route determination module, used to determine at least one shortest route based on the target location; A fault pre-diagnosis module, used for performing fault pre-diagnosis detection on the at least one shortest route to obtain a target route; A scheduling and allocation module is used to perform electric energy scheduling and allocation based on the target route.
9. An electronic device, characterized in that: The electronic device includes: at least one processor; Memory; At least one application, wherein at least one application is stored in a memory and configured to be executed by at least one processor, and the at least one application is configured to: execute the virtual power plant energy scheduling model construction method described in any one of claims 1 to 7.
10. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed in a computer, the computer is caused to execute the method for constructing a virtual power plant energy scheduling model as described in any one of claims 1 to 7.
Citation Information
Patent Citations
Virtual power plant distributed power optimization aggregation method and system
CN114792056A
Virtual power plant participation power distribution network multi-objective optimization scheduling model and method
CN114844100A
Power grid resource service intermediate station capable of realizing reasonable scheduling and operation and inspection method thereof
CN118074121A
Power dispatching method of virtual power plant and related equipment
CN118114955A
Distribution network power transmission line fault detection method and system
CN118275818A
