A method, apparatus, and electronic equipment for inter-provincial centralized bidding clearing that considers secondary losses and loss allocation.

By combining the quadratic loss function and binary variables, the problems of inaccurate loss modeling and unfair allocation in the existing model are solved, realizing more accurate and fair inter-provincial centralized bidding and clearing, and improving the economy and fairness of market transactions.

CN123121606APending Publication Date: 2026-11-17NORTHWEST BRANCH OF STATE GRID POWER GRID CO +1
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202611147609.0
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2026-07-30
Publication Date
2026-11-17

AI Technical Summary

Technical Problem

Existing clearing models based on trading paths suffer from linear approximation bias in network loss modeling, failing to accurately reflect transmission costs and lacking a fair loss-sharing mechanism, thus affecting the accuracy and fairness of market clearing.

Method used

The power transmission channel loss is accurately modeled using a quadratic loss function, and a binary variable is introduced to indicate the power flow direction. A loss proportional allocation rule is formulated, and a mixed-integer nonlinear programming model is constructed. The model is then transformed into a mixed-integer linear programming problem for solution using the McCormick relaxation technique.

Benefits of technology

It improves the accuracy and physical rationality of the clearing model, ensures fairness for market participants, and provides an efficient and accurate inter-provincial centralized bidding transaction solution.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN123121606A_ABST
    Figure CN123121606A_ABST
Patent Text Reader

Abstract

This invention provides a method, apparatus, and electronic device for inter-provincial centralized bidding clearing that considers secondary losses and loss allocation, aiming to improve the accuracy of clearing models based on trading paths. This method models the losses of transmission channels as a quadratic loss function of power flow values, more accurately reflecting loss characteristics. Simultaneously, to address the potential hedging of power flows between different trading paths on the transmission channel, the model introduces mixed-integer variables to represent power flow direction. Based on this, a rule is defined to allocate losses proportionally to each trading path according to power flow direction: only paths in the same direction as the net power flow bear the losses, while reverse paths do not share the losses. This clearing model is essentially a mixed-integer nonlinear programming problem. To solve it efficiently, the model employs McCormick relaxation and piecewise McCormick relaxation techniques to handle the quadratic and bilinear constraints, thereby transforming the original problem into a solvable mixed-integer linear programming problem. This invention improves the accuracy, physical rationality, and economy of the clearing results.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] This invention relates to the field of electricity market trading and power grid optimization operation technology, and in particular to an inter-provincial centralized bidding clearing method, apparatus and electronic equipment that takes into account secondary losses and loss allocation. Background Technology

[0002] In inter-provincial and inter-regional medium- and long-term electricity markets, inter-provincial centralized competitive bidding is an important trading instrument for achieving large-scale optimal resource allocation. This trading involves organizing power purchasers and sellers to submit bids for quantity and price, which are then uniformly cleared by the trading institution to form inter-provincial and inter-regional trading results. To clearly track the flow of electricity and financial responsibility, existing technologies typically employ clearing models based on trading paths. This model can clearly identify the transaction volume between each pair of purchasers and sellers and the physical channels through which it flows (i.e., the trading path), thus achieving traceability of the traded electricity volume.

[0003] However, existing clearing models based on trading paths still have significant shortcomings in key technical aspects, affecting the physical accuracy and economic rationality of the clearing results. Firstly, in terms of network loss modeling, existing models generally use linear approximations or simple proportional calculations for losses on transmission channels. This deviates significantly from the physical characteristic of actual power grids where losses are proportional to the square of the power flow (i.e., secondary losses), resulting in low model accuracy and an inability to accurately reflect transmission costs, thus affecting the accuracy of social welfare calculations and the economics of market clearing.

[0004] Secondly, in complex multi-channel power trading networks, power flows from different trading paths may create opposing hedging on the same transmission channel. Existing models lack a clear and reasonable mechanism for handling such power flow hedging and the resulting net loss allocation. If losses are not fairly and reasonably allocated to the specific trading path that caused them, it will lead to unclear cost attribution, affecting the fairness of market participants and weakening the accuracy of price signals in guiding resources.

[0005] Therefore, there is an urgent need for an inter-provincial centralized bidding clearing method that can more accurately characterize the physical characteristics of transmission losses and scientifically and fairly handle the loss allocation problem under the hedging of multiple trading paths, so as to improve the overall performance of the market clearing model. Summary of the Invention

[0006] In view of this, the present invention provides a method, apparatus and electronic device for inter-provincial centralized bidding clearing that considers secondary losses and loss allocation. It aims to solve the problems of insufficient accuracy and physical irrationality caused by linear approximation of losses and lack of fair allocation mechanism in existing models by accurately modeling the losses of transmission channels as a quadratic function of power flow and introducing binary variables to represent the power flow direction of the trading path, and then defining a loss allocation rule based on the net power flow direction. This provides a new solution for high-precision and economical trading clearing in inter-provincial and inter-regional medium- and long-term power markets.

[0007] This invention provides a clearing method for inter-provincial centralized bidding that considers secondary losses and loss allocation, comprising: S1, constructing a clearing model with the goal of maximizing social welfare, wherein the clearing model is a mixed-integer nonlinear programming model, including nonlinear constraints derived from the secondary loss function and the loss allocation ratio relationship, wherein the clearing model models the network loss on the transmission channel as a secondary loss function of the power flow value on the channel; the clearing model introduces binary variables to represent the direction of the power flow of the trading path on the transmission channel; the clearing model sets that the total loss of the transmission channel is calculated from the net power flow of the channel, and is allocated only by the trading path with the same direction as the net power flow according to its power flow ratio; S2, inputting the obtained market participant bidding data, trading path and transmission channel parameters into the clearing model; S3, using McCormick relaxation technique to linearize the nonlinear constraints in the clearing model, so as to transform the original mixed-integer nonlinear programming model into a mixed-integer linear programming model; S4, solving the mixed-integer linear programming model and outputting the clearing result.

[0008] Optionally, the clearing model is constructed based on transaction paths; the transaction path defines the relationship between power transmission and financial settlement from the power seller to the power buyer, and consists of a series of continuous transmission channels; for each transaction path, the power sold by the power seller at the starting point, minus the total loss it shares on all transmission channels along the path, equals the actual power received by the power buyer at the end.

[0009] Optionally, the quadratic loss function is the square of the channel power flow, expressed as:

[0010] in, For power transmission channels During the period The loss, For power transmission channels During the period Net current, This is the loss coefficient.

[0011] Alternatively, by introducing binary variables The big M method constraint ensures that the power flow direction on the transmission channel is unique within the same time period, thereby decomposing the net power flow into positive and negative components.

[0012] Optionally, the specific rule for allocating the power flow only by transaction paths in the same direction as the net current flow according to their current flow ratio is: when the binary variable When the net current direction is positive, all transaction paths with positive direction coefficients participate in loss sharing; when When the net current direction is negative, all transaction paths with negative direction coefficients participate in loss sharing, and the amount of loss sharing is proportional to the path current.

[0013] Optionally, the McCormick relaxation technique in step S3 includes processing the linearization process with piecewise McCormick relaxation to reduce the error caused by relaxation.

[0014] Optionally, the constraints of the clearing model include power constraints, transmission channel capacity constraints, ramping constraints, channel power flow positive and negative constraints, secondary loss constraints, loss allocation constraints, and path power conversion constraints.

[0015] In another aspect, the present invention provides an inter-provincial centralized bidding clearing device that considers secondary losses and loss allocation, comprising: a model building module for constructing a clearing model with the goal of maximizing social welfare, wherein the clearing model is a mixed-integer nonlinear programming model, including nonlinear constraints derived from a secondary loss function and a loss allocation ratio relationship, wherein the clearing model models the network loss on the transmission channel as a secondary loss function of the power flow value on the channel; the clearing model introduces binary variables to represent the direction of the power flow of the trading path on the transmission channel; the clearing model sets the total loss of the transmission channel to be calculated from the net power flow of the channel, and allocates it only by the trading path with the same direction as the net power flow according to its power flow ratio; a model input module for inputting the acquired market participant bidding data, trading path and transmission channel parameters into the clearing model; a model transformation module for linearizing the nonlinear constraints in the clearing model using McCormick relaxation techniques to transform the original mixed-integer nonlinear programming model into a mixed-integer linear programming model; and a solution module for solving the mixed-integer linear programming model and outputting the clearing result.

[0016] In another aspect, the present invention provides an electronic device comprising: a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor, when executing the computer program, performs the steps of the method as described in any of the preceding claims. In another aspect, the present invention provides a computer storage medium storing a computer program that, when executed by a processor, implements the steps of the method as described in any of the preceding claims.

[0017] Compared with the prior art, the present invention has the following beneficial effects: (1) The present invention accurately models the loss of the transmission channel as a quadratic function of the power flow value. Compared with the linear approximation method used in the existing model, it is more in line with the actual physical characteristics of the power network, significantly improves the accuracy of the clearing model, and makes the market clearing results more accurately reflect the real transmission cost and social welfare.

[0018] (2) This invention introduces binary variables to identify the power flow direction and formulates a loss allocation rule that is linked to the net power flow direction. This scientifically and fairly solves the loss attribution problem when multiple trading paths offset power flow on the transmission channel, and enhances the physical rationality of the clearing result and the fairness of the market participants.

[0019] (3) By employing McCormick relaxation and piecewise McCormick relaxation techniques, this invention transforms the established mixed integer nonlinear programming clearing model into a mixed integer linear programming problem that can be solved efficiently. While ensuring the core accuracy of the model, it provides a practical and feasible engineering solution that can be directly applied to the efficient and accurate clearing of actual inter-provincial centralized bidding transactions. Attached Figure Description

[0020] To more clearly illustrate the technical solutions in the embodiments of the present invention or the prior art, the accompanying drawings used in the description of the embodiments or the prior art will be briefly introduced below. By reading the detailed description of the embodiments below, the advantages and benefits of the solutions will become clear to those skilled in the art. The accompanying drawings are only for illustrating preferred embodiments and are not intended to limit the present invention. In the accompanying drawings: Figure 1 This is a flowchart of the steps of the method of the present invention.

[0021] Figure 2 To and Figure 1 The overall flowchart of the method of the present invention is shown below. Detailed Implementation

[0022] To enable those skilled in the art to better understand the technical solutions in the embodiments of the present invention, the technical solutions in the embodiments of the present invention will be clearly and thoroughly described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of the present invention, and not all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art should fall within the protection scope of the present invention.

[0023] See Figure 1 , Figure 2 The present invention provides a method for inter-provincial centralized bidding clearing that considers secondary losses and loss allocation, comprising: S1. Construct a clearing model with the goal of maximizing social welfare. The clearing model is a mixed-integer nonlinear programming model, which includes nonlinear constraints derived from the quadratic loss function and the loss allocation ratio. The clearing model models the network loss on the transmission channel as a quadratic loss function of the power flow value on the channel. The clearing model introduces binary variables to represent the direction of the power flow of the trading path on the transmission channel. The clearing model sets the total loss of the transmission channel to be calculated from the net power flow of the channel and allocated only by the trading path with the same direction as the net power flow according to its power flow ratio. S2. Input the obtained market entity quotation data, transaction path and transmission channel parameters into the clearing model; S3. The McCormick relaxation technique is used to linearize the nonlinear constraints in the clearing model, so as to transform the original mixed integer nonlinear programming model into a mixed integer linear programming model. S4. Solve the mixed integer linear programming model and output the clearing result.

[0024] Optionally, the clearing model is constructed based on transaction paths; the transaction path defines the relationship between power transmission and financial settlement from the power seller to the power buyer, and consists of a series of continuous transmission channels; for each transaction path, the power sold by the power seller at the starting point, minus the total loss it shares on all transmission channels along the path, equals the actual power received by the power buyer at the end.

[0025] Optionally, the quadratic loss function is the square of the channel power flow, expressed as:

[0026] in, For power transmission channels During the period The loss, For power transmission channels During the period Net current, This is the loss coefficient.

[0027] Alternatively, by introducing binary variables The big M method constraint ensures that the power flow direction on the transmission channel is unique within the same time period, thereby decomposing the net power flow into positive and negative components.

[0028] Optionally, the specific rule for allocating the power flow only by transaction paths in the same direction as the net current flow according to their current flow ratio is: when the binary variable When the net current direction is positive, all transaction paths with positive direction coefficients participate in loss sharing; when When the net current direction is negative, all transaction paths with negative direction coefficients participate in loss sharing, and the amount of loss sharing is proportional to the path current.

[0029] Optionally, the McCormick relaxation technique in step S3 includes processing the linearization process with piecewise McCormick relaxation to reduce the error caused by relaxation.

[0030] Optionally, the constraints of the clearing model include power constraints, transmission channel capacity constraints, ramping constraints, channel power flow positive and negative constraints, secondary loss constraints, loss allocation constraints, and path power conversion constraints.

[0031] Specifically, the solution of the present invention is further described with reference to the following examples: Inter-provincial centralized bidding is a core trading instrument supporting the efficient operation of inter-provincial and inter-regional medium- and long-term electricity markets. Its standardized process aims to achieve large-scale optimal allocation of resources. Implementation begins with the trading institution issuing a trading announcement based on the market operation plan, simultaneously disclosing key inter-provincial trading network topology, available transmission capacity, and related technical parameters to the public. Subsequently, eligible electricity purchasers and sellers, based on their own needs, submit their intended purchase or sale quantities and corresponding prices in time-period increments (e.g., hourly), which serve as the market participant's quantity and price quotation data.

[0032] After collecting the bids from all market participants, the trading center initiates a centralized optimization and clearing process across multiple provincial channels. This clearing process is conducted on a time-period basis. In the clearing calculation, the electricity price declared by the power purchaser is calculated retroactively from the power receiving end (the power purchaser's location) to the sending end (the power seller's location) according to their designated trading path. This calculation process comprehensively considers the approved transmission prices of each transmission channel along the path and the expected value of line losses. This means that the transmission costs and corresponding line loss costs along the trading path are borne by the power purchaser in the mechanism. The trading center constructs an optimization model based on the above rules to solve for the time-of-use trading volume of each market participant.

[0033] After the clearing calculation is completed, the result is not final and must be submitted to the power dispatching agency for safety verification. The dispatching agency will verify whether this transaction plan meets the physical safety constraints of the power grid's real-time operation. After the verification is passed, the transaction agency will publicly release the final clearing result with enforceable legal effect, and the subsequent contract signing and settlement process will begin.

[0034] The objective function of the clearing model is to maximize social welfare, that is: The objective function of the clearing model is to maximize social welfare, that is: (1) In the formula, Indicates social welfare. For the seller s via transaction path During the period The transaction volume at the sending end, For time period Transaction path The buyer at the receiving end b Declare electricity price For time period Transaction path The seller at the receiving end s Declare electricity price For power transmission channels The transmission fee, For power transmission channels During the period The loss, For power transmission channels The loss coefficient. T For the set of all time periods, For the set of all transaction paths, For the set of all transaction paths, Let be the set of all transmission channels. The first term in the objective function represents the difference between the purchase and sale bid prices for each trading path minus the transmission fee multiplied by the buyer's transaction volume. It represents the sum of consumer surplus and producer surplus considering the buyer's share of the transmission fee. The second term represents the energy loss during transmission, and the minus indicates that it is borne by the buyer.

[0035] Includes the following constraints: (1) Electricity constraint: the electricity volume transacted by market participants is less than their maximum value, i.e.: (2) (3) In the formula, For the buyer b via transaction path During the period The transaction volume at the receiving end, For the seller s During the period The declared electricity volume For the buyer b During the period The declared electricity volume For the delivery end for the seller s The set of transaction paths, For the recipient as the buyer b The set of transaction paths.

[0036] (2) Transmission channel capacity constraints: First, the net power flow of the transmission channel is determined by the power flow distribution factor and direction coefficient. (4) In the formula, For power transmission channels During the period Net input current, For transaction path At the cross section l The power flow distribution factor is 1 on the DC channel and 1 on the DC channel. For transaction path In power transmission channels The direction coefficient is 1 or -1. For including power transmission channels The set of transaction paths.

[0037] power transmission channels Due to limitations imposed by ATC's available transmission capacity, the following constraints exist: (5) In the formula, For time period power transmission channels ATC's available transmission capacity.

[0038] (3) Ramp-up constraint: To ensure the stable operation of the power system and prevent the power grid from being impacted by drastic changes in power flow, ramp-up constraints are imposed on transmission channels: (6) In the formula, and Transmission channels The restrictions on lowering the gradient rate and raising the gradient rate are as follows.

[0039] (4) Positive and negative power flow constraints on transmission channels allow for both positive and negative power flow. A binary variable is introduced to represent the direction of net power flow on channel l, i.e.: (7) (8) (9) In the formula, and They represent power transmission channels. During the period The net current flow is either positive or negative. ,when hour, , It is a positive trend; when hour, , It is the reverse current. M It represents a sufficiently large positive number.

[0040] (5) Secondary loss constraint, which assumes that the transmission channel loss is proportional to the square of the power flow, i.e.: (10) In the formula, For power transmission channels The secondary loss coefficient.

[0041] (6) Loss sharing constraint: Since there are multiple trading paths passing through the transmission channel, the trading paths are defined. In power transmission channels The amount of loss to bear is ,have: (11) Losses are only allowed to be borne by paths in the same direction as the net current flow, and are distributed according to the proportion of current flow. All power flows with positive directional coefficients share losses, while power flows with negative directional coefficients do not share losses. (12) (13) In the formula, For power transmission channels The set of transaction paths with positive upward direction coefficients. For power transmission channels The set of transaction paths with negative upward direction coefficients. Represented using the Big M method: (14) (15) Similarly, All power flows with positive directional coefficients share losses, while power flows with negative directional coefficients do not share losses. This can be expressed using the Big M method as follows: (16) (17) (7) Path power conversion constraints, for each transaction path The electricity sold minus the allocated losses equals the electricity at the point of sale, i.e.: (18) The above constitutes a centralized optimization and clearing model for inter-provincial multi-channel systems that considers forward and reverse power flow and secondary losses. This model is a mixed integer quadratic programming problem (MIQP), which is very non-convex and difficult to solve. The piecewise McCormick method is used for relaxation below.

[0042] For the quadratic loss constraint (10), a new continuous variable is introduced. replace , have: (19) Satisfying McCormick constraints: (20) In the formula, and They represent The minimum and maximum values.

[0043] Piecewise McCormick relaxation, by dividing the domain of each variable and applying the standard McCormick envelope to each sub-interval, more closely approximates the bilinear term, thus improving model accuracy. For variables... Using piecewise McCormick relaxation, the domain is first partitioned: (twenty one) (twenty two) but Satisfying McCormick constraints: (twenty three) in: (twenty four) (25) (26) In the formula, N Represents the variable The number of segments, N The larger the model, the more accurate it is, but the larger the solution scale is. and Representing variables respectively In each segment n The minimum and maximum values. For binary variables, a value of 1 indicates Values ​​are taken in segments n superior. Representing variables In segments n The value of .

[0044] For the bilinear terms in the loss sharing constraints (14) and (17), let replace , replace Constraint (14) is transformed into: (27) Constraint (17) is transformed into: (28) right Piecewise McCormick linearization is used to partition the domain: (29) (30) (31) (32) but Satisfying McCormick constraints: (33) in: (34) (35) (36) (37) (38) In the formula, M and N They are respectively and The number of segments. and Representing variables respectively Minimum and maximum values ​​in each segment. and Representing variables respectively Minimum and maximum values ​​in each segment. For binary variables, a value of 1 indicates Values ​​are taken in segments m superior, Values ​​are taken in segments n superior.

[0045] right Piecewise McCormick linearization is used to partition the domain: (39) (40) (41) (42) but Satisfying McCormick constraints: (43) (44) (45) (46) (47) (48) In the formula, M and N They are respectively and The number of segments. and Representing variables respectively Minimum and maximum values ​​in each segment. and Representing variables respectively Minimum and maximum values ​​in each segment. For binary variables, a value of 1 indicates Values ​​are taken in segments m superior, Values ​​are taken in segments n superior.

[0046] Through the piecewise McCormick relaxation described above, the quadratic variables in the model are... and bilinear variables , By relaxing the variables into linear variables, the original MIQP problem is transformed into a mixed integer linear programming (MILP) problem, making the model solvable.

[0047] In summary, compared with the prior art, the present invention has the following beneficial effects: (1) The present invention accurately models the loss of the transmission channel as a quadratic function of the power flow value. Compared with the linear approximation method used in the existing model, it is more in line with the actual physical characteristics of the power network, significantly improves the accuracy of the clearing model, and makes the market clearing results more accurately reflect the real transmission cost and social welfare.

[0048] (2) This invention introduces binary variables to identify the power flow direction and formulates a loss allocation rule that is linked to the net power flow direction. This scientifically and fairly solves the loss attribution problem when multiple trading paths offset power flow on the transmission channel, and enhances the physical rationality of the clearing result and the fairness of the market participants.

[0049] (3) By employing McCormick relaxation and piecewise McCormick relaxation techniques, this invention transforms the established mixed integer nonlinear programming clearing model into a mixed integer linear programming problem that can be solved efficiently. While ensuring the core accuracy of the model, it provides a practical and feasible engineering solution that can be directly applied to the efficient and accurate clearing of actual inter-provincial centralized bidding transactions.

[0050] Another aspect of the present invention provides an inter-provincial centralized bidding clearing device that considers secondary losses and loss allocation, comprising: The model building module is used to construct a clearing model with the goal of maximizing social welfare. The clearing model is a mixed-integer nonlinear programming model, which includes nonlinear constraints derived from the quadratic loss function and the loss sharing ratio. Specifically, the clearing model models the network loss on the transmission channel as a quadratic loss function of the power flow value on the channel. The clearing model introduces binary variables to represent the direction of the power flow of the trading path on the transmission channel. The clearing model sets the total loss of the transmission channel to be calculated from the net power flow of the channel and shared only by the trading path with the same direction as the net power flow according to its power flow ratio. The model input module is used to input the acquired market participant quotation data, transaction path and transmission channel parameters into the clearing model; The model transformation module is used to linearize the nonlinear constraints in the clearing model using McCormick relaxation techniques, so as to transform the original mixed-integer nonlinear programming model into a mixed-integer linear programming model. The solution module is used to solve the mixed-integer linear programming model and output the clearing result. It should be understood that the apparatus of the present invention is used to implement any of the above method embodiments and has the effects of the corresponding method embodiments, which will not be repeated here.

[0051] In another aspect, the present invention provides an electronic device, including: a processor, a memory, a communication bus, and a communication interface.

[0052] in: The processor, memory, and communication interface communicate with each other via a communication bus.

[0053] A communication interface is used to communicate with other electronic devices or servers.

[0054] The processor is used to execute programs, specifically the steps of any of the methods described in the above embodiments.

[0055] Specifically, the program may include program code, which includes computer operation instructions.

[0056] The processor may be a central processing unit (CPU), an application-specific integrated circuit (ASIC), or one or more integrated circuits configured to implement the embodiments of this application. The one or more processors included in the smart device may be processors of the same type, such as one or more CPUs; or they may be processors of different types, such as one or more CPUs and one or more ASICs.

[0057] Memory is used to store programs. Memory may include high-speed RAM, and may also include non-volatile memory, such as at least one disk drive.

[0058] Specifically, the program can be used to cause the processor to execute the steps of any of the methods described in the embodiments. The specific implementation of each step in the program can be found in the corresponding descriptions of the steps and units executed by any of the methods described above, and will not be repeated here. Those skilled in the art will clearly understand that, for the sake of convenience and brevity, the specific working process of the devices and modules described above can be referred to the corresponding process descriptions in the foregoing method embodiments.

[0059] An exemplary embodiment of this application also provides a non-transitory computer-readable storage medium storing computer instructions, wherein the computer instructions are used to cause a computer to perform the methods of various embodiments of this application.

[0060] The methods described above according to embodiments of the present invention can be implemented in hardware, firmware, or as software or computer code that can be stored in a recording medium (such as a CD-ROM, RAM, floppy disk, hard disk, or magneto-optical disk), or as computer code originally stored on a remote recording medium or a non-transitory machine-readable medium and subsequently stored on a local recording medium, downloaded via a network. Thus, the methods described herein can be processed by software stored on a recording medium using a general-purpose computer, a dedicated processor, or programmable or dedicated hardware (such as an ASIC or FPGA). It is understood that the computer, processor, microprocessor controller, or programmable hardware includes storage components (e.g., RAM, ROM, flash memory, etc.) capable of storing or receiving software or computer code, which, when accessed and executed by the computer, processor, or hardware, implements the methods described herein. Furthermore, when a general-purpose computer accesses code used to implement the methods shown herein, the execution of the code transforms the general-purpose computer into a dedicated computer for executing the methods shown herein.

[0061] Specific embodiments of the present invention have now been described. Other embodiments are within the scope of the appended claims. In some cases, the actions described in the claims can be performed in a different order and still achieve the desired result. Furthermore, the processes depicted in the drawings do not necessarily require a specific or sequential order to achieve the desired result.

[0062] It should be noted that all directional indications (such as up, down, left, right, back, etc.) in the embodiments of the present invention are only used to explain the relative positional relationship between the components in a certain order (as shown in the figure). If the specific order changes, the directional indication will also change accordingly.

[0063] In the description of this invention, the terms "first" and "second" are used only for convenience in describing different components or names, and should not be construed as indicating or implying a sequential relationship, relative importance, or implicitly specifying the number of technical features indicated. Thus, a feature defined with "first" and "second" may explicitly or implicitly include at least one of that feature.

[0064] Unless otherwise defined, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this invention pertains. The terminology used herein in the description of the invention is for the purpose of describing particular embodiments only and is not intended to be limiting of the invention.

[0065] It should be noted that although specific embodiments of the present invention have been described in detail with reference to the accompanying drawings, this should not be construed as limiting the scope of protection of the present invention. Various modifications and variations that can be made by those skilled in the art without inventive effort within the scope described in the claims still fall within the scope of protection of the present invention.

[0066] The examples of the embodiments of the present invention are intended to concisely illustrate the technical features of the embodiments of the present invention, so that those skilled in the art can intuitively understand the technical features of the embodiments of the present invention, and are not intended to be an improper limitation of the embodiments of the present invention.

[0067] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention, and not to limit them; 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; and these 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 inter-provincial centralized bidding and clearing that considers secondary losses and loss allocation, characterized in that, include: S1. Construct a clearing model with the goal of maximizing social welfare. The clearing model is a mixed-integer nonlinear programming model, which includes nonlinear constraints derived from the quadratic loss function and the loss allocation ratio. The clearing model models the network loss on the transmission channel as a quadratic loss function of the power flow value on the channel. The clearing model introduces binary variables to represent the direction of the power flow of the trading path on the transmission channel. The clearing model sets the total loss of the transmission channel to be calculated from the net power flow of the channel and allocated only by the trading path with the same direction as the net power flow according to its power flow ratio. S2. Input the obtained market entity quotation data, transaction path and transmission channel parameters into the clearing model; S3. The McCormick relaxation technique is used to linearize the nonlinear constraints in the clearing model, so as to transform the original mixed integer nonlinear programming model into a mixed integer linear programming model. S4. Solve the mixed integer linear programming model and output the clearing result.

2. The method according to claim 1, characterized in that, The clearing model is constructed based on transaction paths; The transaction path defines the relationship between power transmission and financial settlement from the power seller to the power buyer, and consists of a series of continuous transmission channels; For each transaction path, the electricity sold by the seller at the starting point, minus the total losses distributed across all transmission channels along the path, equals the actual electricity received by the buyer at the end.

3. The method according to claim 1, characterized in that, The quadratic loss function is the square of the channel power flow, expressed as: in, For power transmission channels During the period The loss, For power transmission channels During the period Net current, This is the loss coefficient.

4. The method according to claim 1, characterized in that, By introducing binary variables The big M method constraint ensures that the power flow direction on the transmission channel is unique within the same time period, thereby decomposing the net power flow into positive and negative components.

5. The method according to claim 1, characterized in that, The specific rules for allocating the flow rate only to transaction paths in the same direction as the net current flow according to their current flow ratio are as follows: When binary variables When the net current direction is positive, all transaction paths with positive direction coefficients participate in loss sharing. when When the net current direction is negative, all transaction paths with negative direction coefficients participate in loss sharing, and the amount of loss sharing is proportional to the path current.

6. The method according to claim 1, characterized in that, The McCormick relaxation technique in step S3 includes using piecewise McCormick relaxation to process the linearization process in order to reduce the error caused by relaxation.

7. The method according to claim 1, characterized in that, The constraints of the clearing model include power constraints, transmission channel capacity constraints, ramping constraints, channel power flow positive and negative constraints, secondary loss constraints, loss allocation constraints, and path power conversion constraints.

8. A provincial centralized bidding clearing device that considers secondary losses and loss allocation, characterized in that, include: The model building module is used to construct a clearing model with the goal of maximizing social welfare. The clearing model is a mixed-integer nonlinear programming model, which includes nonlinear constraints derived from the quadratic loss function and the loss sharing ratio. Specifically, the clearing model models the network loss on the transmission channel as a quadratic loss function of the power flow value on the channel. The clearing model introduces binary variables to represent the direction of the power flow of the trading path on the transmission channel. The clearing model sets the total loss of the transmission channel to be calculated from the net power flow of the channel and shared only by the trading path with the same direction as the net power flow according to its power flow ratio. The model input module is used to input the acquired market participant quotation data, transaction path and transmission channel parameters into the clearing model; The model transformation module is used to linearize the nonlinear constraints in the clearing model using McCormick relaxation techniques, so as to transform the original mixed-integer nonlinear programming model into a mixed-integer linear programming model. The solution module is used to solve the mixed integer linear programming model and output the clearing result.

9. An electronic device, characterized in that, include: A memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor, when executing the computer program, implements the steps of the method as described in any one of claims 1 to 7.

10. A computer storage medium, characterized in that, The computer storage medium stores a computer program, which, when executed by a processor, implements the steps of the method as described in any one of claims 1 to 7.