Inter-provincial power optimization clearing method, system and device and electronic equipment

Abstract

The application provides an inter-provincial power optimization clearing method, system and device and electronic equipment, and relates to the technical field of power automation.In the application, according to the bid and bid quantity of the buyer and the seller node, and the feasible transaction path of the two parties, the transaction path with the minimum power transmission energy consumption of the buyer and the seller is considered, the transaction combination is determined, and the price difference of the two parties is calculated, wherein the transaction combination with the maximum price difference is preferentially traded.In addition, the available power transmission capacity of the channel is considered to determine the minimum energy consumption path of the buyer and the seller node, to meet the safety constraint of the power grid and to ensure the clearing result.The path with the minimum power transmission energy consumption is preferentially used to achieve the transaction, and the energy saving and the stability of power transmission are improved.

Description

Technical Field

[0001] This invention relates to the field of power automation technology, specifically to an inter-provincial power optimization and clearing method, system, device, and electronic equipment. Background Technology

[0002] With the deepening of the electricity spot market construction, the continuous growth of social electricity demand, and the large-scale grid connection of clean energy, the scope and scale of cross-regional spot trading will continue to expand, and the trading volume will increase exponentially. Meanwhile, my country's electricity resources and consumption are severely unevenly distributed spatially. Thermal power, hydropower, wind power, and solar power resources are mainly concentrated in the west and north, while electricity load centers are concentrated in the east and southeast. A single regional power grid can no longer meet the source-load balance; various types of adjustments between major power-producing provinces and major power-consuming provinces, and between major renewable energy provinces and major thermal power provinces, are necessary. Therefore, establishing a national electricity market is a strategic choice based on the current reality. The actual need for the overall coordinated and optimized allocation of electricity resources highlights the importance and urgency of building a unified electricity market.

[0003] Optimizing inter-provincial clearing transactions will greatly improve the optimal allocation of energy resources, enabling large-scale optimization of power resource allocation across provinces and regions, and adjusting the market for surpluses and shortages between provinces. However, at present, inter-provincial power transactions in China are still in their initial stage, and both the rules and implementation need to be improved, resulting in a considerable amount of inter-provincial transaction demand not being met, leading to wind and solar power curtailment.

[0004] How to effectively utilize the inter-provincial trading market to promote the nationwide consumption of clean energy is a critical issue that urgently needs to be addressed. In current inter-provincial trading, after both parties submit their applications, the trading is matched solely based on the bids and quantities submitted by the buyer and seller, as well as the existence of a trading route and the available transmission capacity (ATC) of that route. The availability of the trading route with the lowest energy consumption and highest stability is not considered. Summary of the Invention

[0005] (a) Technical problems to be solved

[0006] To address the shortcomings of existing technologies, this invention provides an inter-provincial power optimization clearing method, system, device, and electronic equipment, which solves the technical problem of not considering the lowest energy consumption trading path.

[0007] (II) Technical Solution

[0008] To achieve the above objectives, the present invention provides the following technical solution:

[0009] A method for optimizing and clearing inter-provincial power supply, characterized by comprising:

[0010] S1. Construct a network model based on the inter-provincial power grid topology map; wherein the network model includes at least several nodes, transaction paths between nodes, and available channel capacity on the transaction paths;

[0011] S2. Obtain information on all buyer and seller nodes participating in electricity transactions;

[0012] S3. Based on the transaction path, find the corresponding lowest energy consumption path starting from the current buyer node; if at least one lowest energy consumption path exists, proceed to S4; otherwise, proceed to S5.

[0013] S4. For all the lowest energy consumption paths of the buyer node, convert their prices to different seller nodes respectively;

[0014] S5. Determine whether all buyer nodes have been traversed. If yes, proceed to S6; otherwise, proceed to S3.

[0015] S6. Subtract the price of all converted buyer nodes from the price of the corresponding seller nodes, sort the differences in non-ascending order, and determine whether the first difference in the sort is greater than zero. If it is, match the buyer and seller nodes corresponding to the first difference to trade and proceed to S7; otherwise, end the transaction.

[0016] S7. Update the network model, buyer and seller node information, and repeat S3 to S6 until no buyer or seller node participates in the power transaction.

[0017] Preferably, in S3, finding the corresponding lowest energy consumption path starting from the current buyer node means:

[0018] S10, Starting from buyer node b j Let D be the starting point, and let the transmission step size l = 1;

[0019] S20. Initialize arrays S and U: Put D into S, and U records all seller nodes directly connected to D; where the available capacity of the channel on the transaction path between the recorded buyer nodes and the starting point D is greater than zero;

[0020] S30. Select the seller node K from U that has the shortest path to D, merge the lowest energy-consuming path found in the previous iteration, and obtain the lowest energy-consuming path with value l.

[0021] S40. Determine whether all seller nodes have been traversed. If yes, proceed to S50; otherwise, update D to K and set l = l + 1, then proceed to S20.

[0022] S50, Output Buyer Node b j The lowest energy consumption path with progressively increasing transmission step lengths.

[0023] Preferably, in step S4, the bid price of the buyer node is discounted to different seller nodes using the following formula:

[0024]

[0025]

[0026]

[0027] in, For buyer node b j Price converted to the seller's node; For buyer node b j The quote; COE is the conversion factor; price coe The loss / discount price for the shortest energy consumption path;

[0028] N represents the total number of shortest energy consumption paths that are inter-regional corridors, inter-provincial interconnections, or regional shared power grids, ρ m The transmission network loss rate of the m-th inter-regional corridor, inter-provincial interconnection line, or regional shared power grid;

[0029] P m The transmission price for the m-th segment of the inter-regional corridor, inter-provincial interconnection line, or regional shared power grid; ρ r Let be the transmission network loss rate of the r-th sub-segment in the m-th inter-regional corridor, inter-provincial interconnection line, or regional shared power grid.

[0030] Preferably, in step S6, matching the buyer and seller nodes corresponding to the first difference to conduct a transaction includes:

[0031] The transaction price is the arithmetic average of the discounted bid price from the buyer node and the corresponding bid price from the seller node; the transaction volume is the minimum of the available channel capacity of the lowest energy-consuming path where the buyer and seller nodes are located, the bid volume of the buyer node, and the bid volume of the seller node.

[0032] Preferably, updating the network model, buyer and seller node information in S7 means:

[0033] Update the available capacity of channels on the transaction path in the network model; update the message volume of the buyer and seller nodes, and delete the buyer and seller nodes with a message volume of zero.

[0034] An inter-provincial power optimization and clearing system includes:

[0035] The construction module is used to execute S1 and construct a network model based on the inter-provincial power grid topology map; wherein the network model includes at least several nodes, transaction paths between nodes, and available channel capacity on the transaction paths;

[0036] The acquisition module is used to execute S2 and acquire information on all buyer and seller nodes participating in the electricity transaction;

[0037] The search module is used to execute S3, which searches for the corresponding lowest energy consumption path starting from the current buyer node based on the transaction path; if at least one lowest energy consumption path exists, the process proceeds to the conversion module to execute S4; otherwise, the process proceeds to the judgment module to execute S5.

[0038] The conversion module is used to execute S4, which converts the price of all the lowest energy-consuming paths of the buyer node to different seller nodes;

[0039] The judgment module is used to execute S5 and determine whether all buyer nodes have been traversed. If so, it transfers to the matching module to execute S6; otherwise, it transfers to the search module to execute S3.

[0040] The matching module is used to execute S6, which calculates the difference between the price of all converted buyer nodes and the price of the corresponding seller nodes, sorts the differences in non-ascending order, and determines whether the first difference in the sort is greater than zero. If it is, the buyer and seller nodes corresponding to the first difference are matched to trade, and the process is transferred to the update module to execute S7; otherwise, the transaction is terminated.

[0041] The update module is used to execute S7, update the network model, and update the information of the buyer and seller nodes, and then sequentially transfer to the corresponding module to repeat S3 to S6 until no buyer or seller node participates in the power transaction.

[0042] A storage medium storing a computer program for inter-provincial power optimization clearing, wherein the computer program causes a computer to execute the inter-provincial power optimization clearing method as described above.

[0043] An electronic device, comprising:

[0044] One or more processors; a memory; and one or more programs, wherein the one or more programs are stored in the memory and configured to be executed by the one or more processors, the programs including methods for performing the inter-provincial power optimization clearing method as described above.

[0045] (III) Beneficial Effects

[0046] This invention provides a method, system, apparatus, and electronic equipment for inter-provincial power optimization and clearing. Compared with the prior art, it has the following advantages:

[0047] This invention uses dynamic programming to find the lowest energy consumption path in inter-provincial transactions, reducing energy loss and ensuring transaction stability; it also considers the available power capacity of the transaction path to meet grid security constraints and ensure clearing results. Attached Figure Description

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

[0049] Figure 1 This is a block diagram of an inter-provincial power optimization and clearing method provided in an embodiment of the present invention. Detailed Implementation

[0050] To make the objectives, technical solutions, and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention are described clearly and completely. Obviously, the described embodiments are only some embodiments of the present invention, not all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of the present invention.

[0051] This application provides an inter-provincial power optimization clearing method, system, device, and electronic equipment, which solves the technical problem of not considering the lowest energy consumption trading path, fully taps the transmission capacity of inter-provincial channels, and is conducive to promoting the cross-regional consumption of new energy and the effective allocation of resources nationwide, reducing wind and solar curtailment, and improving the utilization rate of clean energy.

[0052] The technical solution in this application is to solve the above-mentioned technical problems, and the general idea is as follows:

[0053] Inter-provincial electricity spot trading involves multiple buyers, multiple sellers, and multiple channels (trading paths) for centralized clearing. During the clearing process, based on the bids and quantities submitted by the buyers and sellers, and considering the capacity limitations of the multi-path cascaded channels, the constraints of power grid safety operation, and transmission energy losses, the optimal trading pair, the buyers and sellers, and the trading path are determined to achieve the optimal allocation of surplus electricity and the transmission capacity of remaining channels, as well as the optimal allocation of energy resources nationwide.

[0054] In this embodiment of the invention, based on the bids and quantities quoted by both the buyer and seller nodes, as well as the feasible transaction paths for both parties, the transaction path with the lowest transmission energy consumption for both parties is considered to determine the transaction combination, and the price difference between the buyer and seller is calculated. The transaction combination with the largest price difference is prioritized for execution. Furthermore, the available transmission capacity (ATC) of the channel is considered to determine the lowest energy consumption path for both the buyer and seller nodes, satisfying grid security constraints and ensuring the clearing result. Prioritizing the use of the path with the lowest transmission energy consumption to complete the transaction achieves energy conservation and improves the stability of power transmission.

[0055] To better understand the above technical solutions, the following will provide a detailed explanation of the technical solutions in conjunction with the accompanying drawings and specific implementation methods.

[0056] Example:

[0057] like Figure 1 As shown, this embodiment of the invention provides an inter-provincial power optimization and clearing method, including:

[0058] S1. Construct a network model based on the inter-provincial power grid topology map; wherein the network model includes at least several nodes, transaction paths between nodes, and available channel capacity on the transaction paths;

[0059] S2. Obtain information on all buyer and seller nodes participating in electricity transactions;

[0060] S3. Based on the transaction path, find the corresponding lowest energy consumption path starting from the current buyer node; if at least one lowest energy consumption path exists, proceed to S4; otherwise, proceed to S5.

[0061] S4. For all the lowest energy consumption paths of the buyer node, convert their prices to different seller nodes respectively;

[0062] S5. Determine whether all buyer nodes have been traversed. If yes, proceed to S6; otherwise, proceed to S3.

[0063] S6. Subtract the price of all converted buyer nodes from the price of the corresponding seller nodes, sort the differences in non-ascending order, and determine whether the first difference in the sort is greater than zero. If it is, match the buyer and seller nodes corresponding to the first difference to trade and proceed to S7; otherwise, end the transaction.

[0064] S7. Update the network model, buyer and seller node information, and repeat S3 to S6 until no buyer or seller node participates in the power transaction.

[0065] In this embodiment of the invention, dynamic programming is used to find the path with the lowest energy consumption in inter-provincial transactions, and the available power capacity of the transaction path is taken into account to meet the grid security constraints and ensure the clearing result.

[0066] The following will detail each step of the above solution:

[0067] In step S1, a network model is constructed based on the inter-provincial power grid topology map; wherein the network model includes at least several nodes, transaction paths between nodes, and available channel capacity on the transaction paths.

[0068] Firstly, basic data such as area information (area name, coordinates, etc.), node information (node ​​name, area, coordinates, etc.), and transmission channel information (line name, starting and ending areas, province, city, etc.) can be obtained through the power trading system.

[0069] Then, according to the equivalent model of the power grid topology, search for the sequential combination of transmission channels between any two nodes as the transaction path (transmission channel) between the nodes. Use the aforementioned basic data to define the physical meaning of the transaction path, and then complete the configuration parameter construction of the network model in the power grid topology.

[0070] In step S2, information on all buyer and seller nodes participating in the power transaction is obtained.

[0071] Information for buyer and seller nodes may include, but is not limited to, trader serial number, province, role (buyer or seller), price quote, and quantity reported.

[0072] In step S3, based on the transaction path, the lowest energy consumption path is found starting from the current buyer node; this means:

[0073] S10, Starting from buyer node b j Let D be the starting point, and let the transmission step size l = 1;

[0074] S20. Initialize arrays S and U: Put D into S, and U records all seller nodes directly connected to D; where the available capacity of the channel on the transaction path between the recorded buyer nodes and the starting point D is greater than zero;

[0075] S30. Select the seller node K with the shortest path to D from U, merge the lowest energy consumption path found in the previous iteration, and obtain the lowest energy consumption path with a transmission step size of l.

[0076] S40. Determine whether all seller nodes have been traversed. If yes, proceed to S50; otherwise, update D to K and set l = l + 1, then proceed to S20.

[0077] S50, Output Buyer Node b jThe lowest energy consumption path with progressively increasing transmission step lengths.

[0078] It is important to note that nodes already in array S are automatically ignored in subsequent iterations and will not be included in the calculation.

[0079] In addition, the following judgment process needs to be performed in step S33:

[0080] If at least one of the lowest energy consumption paths exists, proceed to S4; otherwise, proceed to S5.

[0081] In step S4, for all the lowest energy consumption paths of the buyer node, their prices are discounted to different seller nodes respectively;

[0082] The conversion process uses the following formula:

[0083]

[0084]

[0085]

[0086] in, For buyer node b j Price converted to the seller's node; For buyer node b j The quote; COE is the conversion factor; price coe The loss / discount price for the shortest energy consumption path;

[0087] N represents the total number of shortest energy consumption paths that are inter-regional corridors, inter-provincial interconnections, or regional shared power grids, ρ m The transmission network loss rate of the m-th inter-regional corridor, inter-provincial interconnection line, or regional shared power grid;

[0088] P m The transmission price for the m-th segment of the inter-regional corridor, inter-provincial interconnection line, or regional shared power grid; ρ r Let be the transmission network loss rate of the r-th sub-segment in the m-th inter-regional corridor, inter-provincial interconnection line, or regional shared power grid.

[0089] In step S5, determine whether all buyer nodes have been traversed. If so, proceed to S6; otherwise, proceed to S3.

[0090] In step S6, the difference between the discounted bids of all buyer nodes and the corresponding bids of seller nodes is calculated using the following formula:

[0091]

[0092] in, For seller node si The quote, For the converted buyer node b j The quoted price and the corresponding seller node s i The difference between the quoted prices.

[0093] In addition, in step S6, the differences are sorted in non-ascending order, and it is determined whether the first difference in the sort is greater than zero. If it is, the buyer and seller nodes corresponding to the first difference are matched to conduct a transaction, and the process proceeds to S7; otherwise, the transaction ends.

[0094] The reason for performing the above process is that this embodiment of the invention recognizes that the goal of clearing is to find the trading combination with the largest price difference in the current iteration and match the transactions. The larger the price difference, the higher the social welfare.

[0095] The matching process specifically includes: using the arithmetic average of the discounted bid price of the buyer node and the corresponding bid price of the seller node as the transaction price; and using the minimum of the available channel capacity of the lowest energy-consuming path where the buyer and seller nodes are located, the bid volume of the buyer node, and the bid volume of the seller node as the transaction volume.

[0096] In step S7, the network model, buyer and seller node information are updated, and steps S3 to S6 are repeated until no buyer or seller node participates in the electricity transaction; this means:

[0097] Update the available channel capacity on the transaction path in the network model (i.e., subtract the corresponding available channel capacity from the network model); update the order volume of the buyer and seller nodes, and delete the buyer and seller nodes with zero order volume.

[0098] It is not difficult to understand that, in practice, the transaction ends under the following three circumstances in this embodiment of the invention:

[0099] (1) The price converted from the buyer's node to the seller's node is subtracted from the seller's quoted price, and the difference is sorted in non-ascending order. If the maximum difference is less than zero, the transaction is not qualified and the transaction ends.

[0100] (2) After traversing all buyer nodes, it is found that the available channel capacity of the transaction path between the buyer node and the seller node is zero (at this time, the lowest energy consumption path cannot be found), so the transaction ends.

[0101] (3) If no buyer or seller node participates in the power transaction, the transaction ends.

[0102] This invention provides an inter-provincial power optimization and clearing system, comprising:

[0103] The construction module is used to execute S1 and construct a network model based on the inter-provincial power grid topology map; wherein the network model includes at least several nodes, transaction paths between nodes, and available channel capacity on the transaction paths;

[0104] The acquisition module is used to execute S2 and acquire information on all buyer and seller nodes participating in the electricity transaction;

[0105] The search module is used to execute S3, which searches for the corresponding lowest energy consumption path starting from the current buyer node based on the transaction path; if at least one lowest energy consumption path exists, the process proceeds to the conversion module to execute S4; otherwise, the process proceeds to the judgment module to execute S5.

[0106] The conversion module is used to execute S4, which converts the price of all the lowest energy-consuming paths of the buyer node to different seller nodes;

[0107] The judgment module is used to execute S5 and determine whether all buyer nodes have been traversed. If so, it transfers to the matching module to execute S6; otherwise, it transfers to the search module to execute S3.

[0108] The matching module is used to execute S6, which calculates the difference between the price of all converted buyer nodes and the price of the corresponding seller nodes, sorts the differences in non-ascending order, and determines whether the first difference in the sort is greater than zero. If it is, the buyer and seller nodes corresponding to the first difference are matched to trade, and the process is transferred to the update module to execute S7; otherwise, the transaction is terminated.

[0109] The update module is used to execute S7, update the network model, and update the information of the buyer and seller nodes, and then sequentially transfer to the corresponding module to repeat S3 to S6 until no buyer or seller node participates in the power transaction.

[0110] This invention provides a storage medium storing a computer program for inter-provincial power optimization clearing, wherein the computer program causes a computer to execute the inter-provincial power optimization clearing method as described above.

[0111] This invention provides an electronic device, comprising:

[0112] One or more processors; a memory; and one or more programs, wherein the one or more programs are stored in the memory and configured to be executed by the one or more processors, the programs including methods for performing the inter-provincial power optimization clearing method as described above.

[0113] In summary, compared with existing technologies, it has the following beneficial effects:

[0114] This invention uses dynamic programming to find the lowest energy consumption path in inter-provincial transactions, reducing energy loss and ensuring transaction stability; it also considers the available power capacity of the transaction path to meet grid security constraints and ensure clearing results.

[0115] It should be noted that, in this document, relational terms such as "first" and "second" are used only to distinguish one entity or operation from another, and do not necessarily require or imply any such actual relationship or order between these entities or operations. Furthermore, the terms "comprising," "including," or any other variations thereof are intended to cover non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements includes not only those elements but also other elements not expressly listed, or elements inherent to such a process, method, article, or apparatus. Without further limitations, an element defined by the phrase "comprising one..." does not exclude the presence of other identical elements in the process, method, article, or apparatus that includes said element.

[0116] The above embodiments are only used to illustrate the technical solutions of the present invention, and are not intended to limit it. Although the present invention has been described in detail with reference to the foregoing embodiments, those skilled in the art should understand that modifications can still be made to the technical solutions described in the foregoing embodiments, or equivalent substitutions can be made to some of the technical features. Such modifications or substitutions do not cause the essence of the corresponding technical solutions to deviate from the spirit and scope of the technical solutions of the embodiments of the present invention.

Claims

1. A method for optimizing and clearing inter-provincial power supply, characterized in that, include: S1. Construct a network model based on the inter-provincial power grid topology map; The network model described therein includes at least several nodes, transaction paths between nodes, and available channel capacity on the transaction paths; S2. Obtain information on all buyer and seller nodes participating in electricity transactions; S3. Based on the transaction path, find the corresponding lowest energy consumption path starting from the current buyer node; if at least one lowest energy consumption path exists, proceed to S4; otherwise, proceed to S5. S4. For all the lowest energy consumption paths of the buyer node, convert their prices to different seller nodes respectively; S5. Determine whether all buyer nodes have been traversed. If yes, proceed to S6; otherwise, proceed to S3. S6. Subtract the price of all converted buyer nodes from the price of the corresponding seller nodes, sort the differences in non-ascending order, and determine whether the first difference in the sort is greater than zero. If it is, match the buyer and seller nodes corresponding to the first difference to trade and proceed to S7; otherwise, end the transaction. S7. Update the network model, buyer and seller node information, and repeat S3~S6 until no buyer or seller node participates in the power transaction; The step of finding the lowest energy consumption path starting from the current buyer node in S3 refers to: S10, Starting from the buyer node Starting point Make the transmission step size ; S20. Initialize the array and array :Will Put in , Records and All directly connected seller nodes; where the recorded seller nodes are related to the starting point. The available capacity of the channels on the transaction path between them is greater than zero; S30, from Select with Seller node with the shortest path The lowest energy consumption path found in the previous iteration is merged to obtain the transmission step size. The lowest energy consumption path; S40. Determine if all seller nodes have been traversed. If yes, proceed to S50; otherwise, ... Updated to and order Switch to S20; S50, Output Buyer Node The lowest energy consumption path with progressively increasing transmission step lengths; In step S4, the bid price from the buyer node is discounted to different seller nodes using the following formula: in, Buyer node Price converted to the seller's node; Buyer node The quote; This is the conversion factor; The loss / discount cost for the shortest energy consumption path; The total number of shortest energy consumption paths are inter-regional corridors, inter-provincial interconnections, or regional shared power grids. For the first Transmission network loss rate of inter-regional corridors, inter-provincial connecting lines, or regional shared power grids; For the first The transmission price of inter-regional corridors, inter-provincial interconnection lines, or regional shared power grids; For the first The first section of inter-regional corridors, inter-provincial interconnection lines, or regional shared power grids The transmission network loss rate of the sub-segment.

2. The inter-provincial power optimization and clearing method as described in claim 1, characterized in that, The S6 step of matching the buyer and seller nodes corresponding to the first difference to complete the transaction includes: The transaction price is the arithmetic average of the discounted bid price from the buyer node and the corresponding bid price from the seller node; the transaction volume is the minimum of the available channel capacity of the lowest energy-consuming path where the buyer and seller nodes are located, the bid volume of the buyer node, and the bid volume of the seller node.

3. The inter-provincial power optimization and clearing method as described in claim 2, characterized in that, Updating the network model, buyer, and seller node information in S7 refers to: Update the available capacity of channels on the transaction path in the network model; update the volume of the buyer and seller nodes, and delete the buyer and seller nodes with a volume of zero.

4. An inter-provincial power optimization and clearing system, characterized in that, The method for implementing the inter-provincial power optimization and clearing method as described in any one of claims 1 to 3 includes: The construction module is used to execute S1 and construct a network model based on the inter-provincial power grid topology map; wherein the network model includes at least several nodes, transaction paths between nodes, and available channel capacity on the transaction paths; The acquisition module is used to execute S2 and acquire information on all buyer and seller nodes participating in the electricity transaction; The search module is used to execute S3, which searches for the corresponding lowest energy consumption path starting from the current buyer node based on the transaction path; if at least one lowest energy consumption path exists, the process proceeds to the conversion module to execute S4; otherwise, the process proceeds to the judgment module to execute S5. The conversion module is used to execute S4, which converts the price of all the lowest energy-consuming paths of the buyer node to different seller nodes; The judgment module is used to execute S5 and determine whether all buyer nodes have been traversed. If so, it transfers to the matching module to execute S6; otherwise, it transfers to the search module to execute S3. The matching module is used to execute S6, which calculates the difference between the price of all converted buyer nodes and the price of the corresponding seller nodes, sorts the differences in non-ascending order, and determines whether the first difference in the sort is greater than zero. If it is, the buyer and seller nodes corresponding to the first difference are matched to trade, and the process is transferred to the update module to execute S7; otherwise, the transaction is terminated. The update module is used to execute S7, update the network model, and update the information of the buyer and seller nodes, and then sequentially transfer to the corresponding modules to repeat S3~S6 until no buyer or seller node participates in the power transaction.

5. A storage medium, characterized in that, It stores a computer program for inter-provincial power optimization clearing, wherein the computer program causes a computer to execute the inter-provincial power optimization clearing method as described in any one of claims 1 to 3.

6. An electronic device, characterized in that, include: One or more processors; Memory; And one or more programs, wherein the one or more programs are stored in the memory and configured to be executed by the one or more processors, the programs including methods for performing the inter-provincial power optimization clearing method as described in any one of claims 1 to 3.

Images