CN105303256B - Electric power trans-provincial and trans-regional transaction path analysis method - Google Patents
Electric power trans-provincial and trans-regional transaction path analysis method Download PDFInfo
- Publication number
- CN105303256B CN105303256B CN201510717775.5A CN201510717775A CN105303256B CN 105303256 B CN105303256 B CN 105303256B CN 201510717775 A CN201510717775 A CN 201510717775A CN 105303256 B CN105303256 B CN 105303256B
- Authority
- CN
- China
- Prior art keywords
- node
- power
- transaction
- branch
- buyer
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000004458 analytical method Methods 0.000 title abstract description 13
- 230000005540 biological transmission Effects 0.000 claims abstract description 72
- 238000000034 method Methods 0.000 claims abstract description 35
- 238000005457 optimization Methods 0.000 claims abstract description 23
- 230000033228 biological regulation Effects 0.000 claims abstract description 12
- 230000005611 electricity Effects 0.000 claims description 55
- 230000003828 downregulation Effects 0.000 claims description 20
- 230000003827 upregulation Effects 0.000 claims description 20
- 238000011156 evaluation Methods 0.000 claims description 6
- 230000009466 transformation Effects 0.000 claims description 5
- 229910021141 Sm—F Inorganic materials 0.000 claims description 4
- 238000004364 calculation method Methods 0.000 claims description 4
- 230000000717 retained effect Effects 0.000 claims description 4
- 238000010276 construction Methods 0.000 claims description 3
- 230000001105 regulatory effect Effects 0.000 claims description 3
- 238000012407 engineering method Methods 0.000 abstract description 2
- 238000013480 data collection Methods 0.000 abstract 1
- 230000000694 effects Effects 0.000 description 4
- 239000000243 solution Substances 0.000 description 4
- 230000007547 defect Effects 0.000 description 2
- 238000010586 diagram Methods 0.000 description 2
- 238000002347 injection Methods 0.000 description 2
- 239000007924 injection Substances 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000002146 bilateral effect Effects 0.000 description 1
- 238000007728 cost analysis Methods 0.000 description 1
- 238000005265 energy consumption Methods 0.000 description 1
- 238000005065 mining Methods 0.000 description 1
- 238000013433 optimization analysis Methods 0.000 description 1
- 238000010248 power generation Methods 0.000 description 1
- 230000001737 promoting effect Effects 0.000 description 1
- XLYOFNOQVPJJNP-UHFFFAOYSA-N water Substances O XLYOFNOQVPJJNP-UHFFFAOYSA-N 0.000 description 1
Images
Landscapes
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
- Supply And Distribution Of Alternating Current (AREA)
Abstract
A transaction path analysis method for electric power across provinces and regions is characterized in that a transaction optimization model is built through data collection, multiple built models are solved, and transaction path analysis is carried out according to solving results. The invention considers the regulation function of the transfer nodes except the buyer and seller nodes, thereby reasonably allocating the transaction transmission channel, increasing the transaction potential of the network, optimizing the transaction amount and the overall net benefit, considering the regulation cost and the electric power comprehensive transmission cost of network loss when optimizing the transaction, and analyzing the transaction path by adopting a feasible engineering method to achieve the aim of optimizing the transaction more reasonably. The concept of comprehensive power transmission cost is introduced, the network loss cost is accurately analyzed, the adjustment cost and the power transmission cost are more refined and are reflected in an optimization target compared with a network flow-based method, and the optimization result is more reasonable.
Description
Technical Field
The invention belongs to the field of electric power remote transmission transaction, and relates to an electric power cross-region and cross-province transaction path analysis method.
Background
China has the characteristics that the load centers of resource centers are not coincident, and the supply and the demand are reversely distributed, and the cross-region and cross-province transmission transaction in a large power range is accompanied. The large-range cross-region and cross-provincial transaction of the electric power is ensured by adopting a stable algorithm by utilizing a computer platform because a plurality of electric power nodes, lines and various complex operation conditions are involved, the transaction amount cannot be determined by human experience, and the reasonability and the optimality of a transaction path are ensured.
Most of the currently adopted power trans-regional and trans-provincial trading optimization algorithms are network flow-based methods, the methods consider power flows as things which are the same as other general flows such as water flows and traffic flows, and only consider kirchhoff's first law, so that the characteristics of the power flows cannot be correctly reflected. When considering network loss, the method based on network flow usually only uses a method of deducting in a fixed proportion, and cannot accurately reflect the network loss cost of power transfer. In addition, the network flow method does not consider the regulation effect of transfer nodes between the buyer and the seller, so that the optimization potential of the network flow method applied to the electric power cross-province and cross-district transaction is limited.
Disclosure of Invention
In order to overcome the defects in the prior art, the invention aims to provide an electric power trans-provincial and trans-regional transaction path analysis method, which considers the regulation effect of transfer nodes except for buyer and seller nodes and the electric power comprehensive transmission cost considering the regulation cost and the network loss during transaction optimization, and adopts an engineering feasible method to analyze the transaction path so as to achieve the aim of more reasonably optimizing the transaction.
In order to achieve the purpose, the invention adopts the following technical scheme:
a method for analyzing electric power trans-provincial and trans-regional transaction paths comprises the following steps:
step 1: data preparation and acquisition work: the data comprises trading network frame data, buyer and seller information, transit node information, transmission constraint information, typical operation mode information and price information;
step 2: construction of transaction optimization model
Step 2.1: constructing an optimization target: the overall net benefit of the transaction is maximized;
step 2.1.1: evaluating the network loss cost in the power comprehensive transmission cost by adopting a Taylor expansion formula for retaining quadratic terms under the direct current trend;
step 2.1.2: evaluating the adjustment cost in the electric power comprehensive transmission cost, wherein the evaluation method is to multiply the adjustment quantity of the adjustable transfer node by the adjustment unit price;
step 2.1.3: evaluating the cost of power transmission expense in the comprehensive power transmission cost;
step 2.1.4: evaluating an overall net benefit of the transaction;
step 2.2: constructing constraints, including:
1) node power balance constraints;
2) and (3) line power flow constraint: adopting a direct current power flow model;
3) line transmission power limit constraints: ensuring that the line tide does not exceed the limit value;
4) section restraint: ensuring that the section current does not exceed the limit value;
5) buyer constraint: ensuring that the purchase amount is less than the maximum purchase amount;
6) seller constraint: ensuring that the sold amount is less than the maximum saleable amount;
7) and (3) adjustable transfer node adjustment amount constraint: ensuring that the adjustment amount is within an adjustable range;
8) and (3) transport restraint: the sum of the regulating variables of all the transfer nodes is zero, which indicates that no power is generated or absorbed in the transfer area;
and step 3: solving for
Inputting the transaction net rack data, buyer and seller information, transit node information, transmission constraint information, typical operation mode information and price information obtained in the step 1 into the transaction optimization model constructed in the step 2, and solving, wherein the solving result comprises the following steps: the volume of the buying and selling parties, the price of the buying and selling parties, the total net benefit, the comprehensive power transmission cost, the network loss cost, the regulation cost and the power transmission cost;
and 4, step 4: and analyzing the transaction path according to the solving result of the step 3.
In step 1
Transaction net rack data: the method comprises the steps of topological structure, branch impedance, generator node load node position and nonstandard transformation ratio of a transformer branch;
buyer and seller information: the method comprises the steps of acquiring node information of a buyer and a seller, quoting of the buyer and the seller and an upper limit quantity of the buyer and the seller;
information of the transfer node: whether a reconciliation service can be provided, a quote for providing the reconciliation service, and an up-down reconciliation limit;
transmitting constraint information: branch power flow constraint information, a section and section constraint information;
typical operating mode information: basic trend data before transaction;
price information: grid loss electricity price information and transmission price information.
The network loss cost in the step 2.1.1 of the step 2 for evaluating the comprehensive transmission cost of the electric power is obtained by the following network loss calculation formula (1) based on the direct current power flow result and the retained Taylor quadratic expansion term;
wherein: pLossRepresenting the network loss to be optimized; r isi-jIs the resistance of the branch;
represents an average value of the voltage of the node i in the past case; k is a radical ofi-jRepresenting the ratio of the i-j branches, if the line, by kj-j＝1，θiIs the phase angle of node i.
The adjustment cost in the evaluation of the power integrated transmission cost in step 2.1.2 in step 2 is obtained by formula (2);
wherein F represents the comprehensive transmission cost of the electric power, and p represents the power loss price; pLossRepresenting the network loss to be optimized; pLoss0Calculating the network loss in the basic power flow mode according to the formula (1);
respectively representing unit up-regulation cost and unit down-regulation cost of the node t;
representing the amount of up-and down-regulation of node t αi-jRepresenting the transmission cost of the branch i-j unit power; pi-jRepresenting the active power flow of nodes i to j on the branch i-j; pi-j,0Representing the initial active power flow of nodes i to j on branch i-j.
The overall net benefit of the evaluation transaction of step 2.1.4 in step 2 is obtained from equation (3);
Max.∑gn(Bn)*Bn-∑fm(Sm)*Sm-F (3)
wherein, BnSelling the electricity quantity of the buyer node n; smThe electricity purchasing quantity of the seller node m is obtained; gn(Bn) A bid function for buyer node n; f. ofm(Sm) An offer function for seller node m; sigma gn(Bn)*BnThe power is bought for a power buying party; sigma fm(Sm)*SmPaying for selling the electricity by the electricity selling party; sigma gn(Bn)*Bn-∑fm(Sm)*SmReflecting the income of the transaction; f represents the power integrated transmission cost.
In step 2.2 of step 2
1) Node power balance constraints
Wherein, Pm0，Pn0，Pt0，Pq0Section for respectively representing seller, buyer, adjustable transit and non-adjustable transit nodesPoint initial injection power; j belongs to m and represents that the node j is connected with the node m; j belongs to n and represents that the node j is connected with the node n; j e t represents that the node j is connected with the node t; j belongs to q and represents that the node j is connected with the node q; j ≠ m denotes that the node j is not overlapped with the node m; j ≠ n denotes that the node j is not overlapped with the node n; j ≠ t denotes that the node j is not overlapped with the node t; j ≠ q represents that the node j is not overlapped with the node q; pm-jThe active power of a node m of a branch m-j flowing to a node j is represented; pn-jThe active power of a node n of a branch n-j flowing to a node j is represented; pt-jThe active power of a node t of a branch t-j flowing to a node j is represented; pq-jThe active power of a node q of a branch q-j flowing to a node j is represented; b isnThe electricity purchasing quantity of the node n is the buyer; smSelling electricity quantity for the seller node m;
representing the amount of up-regulation and the amount of down-regulation of the node t; the formulas (4), (5), (6) and (7) respectively represent the node power balance of the seller node, the buyer node, the adjustable transit node and the non-adjustable transit node;
2) line flow constraint
By adopting a direct current power flow model, each branch circuit needs to satisfy power flow constraint as shown in a formula (8):
wherein, Pi-jActive power, θ, flowing to node j for node i of branch i-jiAnd thetajIs the phase angle, x, of node i and node j, respectivelyi-jIs the branch i-j reactance;
3) line transmission power limit constraints
-Pi-j,max≤Pi-j≤Pi-j,max(9)
Wherein, Pi-jThe active power flowing to the node j for the node i of the branch i-j; pi-j,maxThe maximum power allowed to flow on the branch i-j;
this constraint means that the power flowing on branch i-j cannot exceed the maximum power limit;
4) section constraint
Wherein, PITR(r)The active power flowing through the section r;
maximum power allowed to be transmitted for reference direction of section r;
maximum power allowed to flow in the direction opposite to the reference direction of the section r;
this constraint represents the power P flowing on the section rITR(r)The active limit of the reference direction of the section r cannot be exceeded, and the active limit of the opposite direction of the reference direction cannot be exceeded;
5) seller constraints
0≤Sm≤Sm,max(11)
Wherein S ismFor selling electricity of seller node m, Sm,maxThe maximum electricity selling amount of the seller node m;
the constraint represents that the electricity selling node m sells electricity quantity less than the maximum salable quantity;
6) buyer constraints
0≤Bn≤Bn,max(12)
Wherein, BnFor buying power of the buyer node n, Bn,maxThe maximum electricity purchasing quantity of the buyer node n is obtained;
the constraint represents that the amount of electricity purchased by the buyer node n is less than the maximum amount of purchase available;
7) adjustable transfer node adjustment constraint
Wherein,
represents the up-regulation amount and the down-regulation amount of the adjustable transfer node t,
respectively representing the maximum up-regulation amount and the maximum down-regulation amount of the adjustable transfer node t;
this constraint represents the amount of upward adjustment of the adjustable transit node t
And downward adjustment amount
Do not exceed the corresponding limits;
8) transportment constraints in a transit zone
t belongs to an adjustable transit node set in a transit area;
representing the up-regulation quantity and the down-regulation quantity of the adjustable transfer node t;
is the adjustment of node t; the constraint means that the sum of the adjustment amounts of all the adjustable transit nodes is zero, so that the transit function of the transit nodes is guaranteed, and transaction power is not absorbed or sent out.
And step 3, solving by a computer by adopting a branch and bound method.
The step 4 specifically comprises the following steps:
step 4.1: calculating the branch load flow of the system after the transaction according to the solving result of the step 3;
step 4.2: subtracting the branch flow of the system after transaction from the branch flow in the original operation mode to obtain a branch flow increment;
and 4.3, step: arranging branch flow increment of each branch from large to small, marking each branch according to the sequence from large to small, and checking whether a buyer node and a seller node are communicated by the marked branch at any time;
step 4.4: when the marked branches are checked to connect the buyer nodes and the seller nodes, the marking is stopped, and all marked branches form a transaction path;
step 4.5: and analyzing the flow direction of the transaction trend in the network and the branch mainly participating in the transaction according to the path of the transaction.
Compared with the prior art, the invention has the following beneficial effects:
1. on the basis of the existing transaction method, the invention considers the regulation effect of the transit nodes except the buyer and seller nodes, thereby reasonably allocating transaction transmission channels, increasing the transaction potential of the network, optimizing the transaction amount and the overall net benefit, considering the regulation cost and the electric power comprehensive transmission cost of network loss when optimizing the transaction, and analyzing the transaction path by adopting a feasible engineering method to achieve the aim of more reasonably optimizing the transaction. The existing network flow method does not consider the regulation effect of a transfer node, and the mining of the transaction potential of the network is limited.
2. The invention adopts the network loss formula of improving and reserving Taylor expansion quadratic terms on the basis of the direct current flow, so that the network loss can be more accurately evaluated, and the network loss cost can be more accurately calculated.
3. The invention introduces the concept of electric power comprehensive transmission cost, accurately analyzes the network loss cost, adjusts the cost and the power transmission cost, and has more detailed cost analysis and more reasonable optimization result compared with the method based on network flow.
4. According to the invention, the power transmission channel with large influence on the transaction is found by comparing the trend variable quantity before and after the transaction, and the determination method of the transaction path is provided on the basis of the existing method, so that the determination of the contract path of the power transaction is facilitated, and the analysis method is more meaningful.
5. The invention provides more accurate information for trans-regional and trans-provincial electric power transactions, so that the reference basis of contract signing is closer to the reality, thereby promoting trans-regional and trans-provincial clean energy consumption and reasonably optimizing national resource utilization.
Drawings
FIG. 1 is a flowchart illustrating the overall operation of the method of the present invention;
FIG. 2 is a diagram of an IEEE30 system employed by an embodiment;
fig. 3 is a diagram of analysis of transaction paths in an embodiment.
Detailed Description
The invention will be further explained with reference to the drawings. The inventive content is not limited to this. In the present invention, an x represents a multiplication number.
Referring to fig. 1, data preparation and acquisition work: the data comprises trading network frame data, buyer and seller information, transit node information, transmission constraint information, typical operation mode information and price information;
transaction net rack data: the method comprises a topological structure, branch impedance, a generator node load node position and nonstandard transformation ratio of a transformer branch;
buyer and seller information: the method comprises the information of nodes of both buyers and sellers, the quotation of the buyers and sellers and the upper limit quantity of the buyers and sellers;
information of the transfer node: if the adjustment service can be provided, the quotation of the adjustment service is adjusted up and down;
transmitting constraint information: branch power flow constraint information, section and section constraint information;
typical operating mode information: basic trend data before transaction;
price information: grid loss electricity price information and power transmission price information.
Step 2: construction of transaction optimization model
Step 2.1: constructing an optimization target: the total net benefit of the transaction is the maximum, namely the profit of the transaction minus the comprehensive transmission cost of the electric power is the maximum:
step 2.1.1: in order to ensure the solving precision at a certain speed, a Taylor expansion formula which reserves a quadratic term under the direct current tide is adopted to evaluate the network loss cost in the electric power comprehensive transmission cost; the method is obtained by the following network loss calculation formula (1) based on a direct current power flow result and a retained Taylor quadratic expansion term;
wherein: pLossRepresenting the network loss to be optimized; r isi-jIs the resistance of the branch;
represents an average value of the voltage of the node i in the past case; k is a radical ofi-jRepresenting the transformation ratio of the i-j branch, if the line is (non-transformer branch) ki-j＝1，θiIs the phase angle of node i.
Step 2.1.2: evaluating the adjustment cost in the electric power comprehensive transmission cost, wherein the evaluation method is to multiply the adjustment quantity of the adjustable transfer node by the adjustment unit price; obtained from equation (2):
wherein F represents the comprehensive transmission cost of the electric power, and p represents the power loss price; pLossRepresenting the network loss to be optimized; pLoss0Calculating the network loss in the basic power flow mode according to the formula (1);
respectively representing unit up-regulation cost and unit down-regulation cost of the node t;
representing the amount of up-and down-regulation of node t αi-jRepresenting the transmission cost of the branch i-j unit power; pi-jRepresenting the active power flow of nodes i to j on the branch i-j; pi-j,0Representing the initial active power flow of nodes i to j on branch i-j.
Step 2.1.3: evaluating the cost of power transmission expense in the comprehensive power transmission cost;
step 2.1.4: and evaluating the total net benefit of the transaction, namely subtracting the comprehensive transmission cost (sum of loss cost, adjustment cost and transmission cost) of the electric power from the price difference of the buyer and the seller.
Obtained by the formula (3);
Max.∑gn(Bn)*Bn-∑fm(Sm)*Sm-F (3)
wherein, BnSelling the electricity quantity of the buyer node n; smThe electricity purchasing quantity of the seller node m is obtained; gn(Bn) A bid function for buyer node n; f. ofm(Sm) An offer function for seller node m; sigma gn(Bn)*BnThe power is bought for a power buying party; sigma fm(Sm)*SmPaying for selling the electricity by the electricity selling party; sigma gn(Bn)*Bn-∑fm(Sm)*SmReflecting the income of the transaction; f represents the power integrated transmission cost.
Step 2.2: constructing constraints, including:
1) node power balance constraints;
2) and (3) line power flow constraint: adopting a direct current power flow model;
3) line transmission power limit constraints: ensuring that the line tide does not exceed the limit value;
4) section restraint: ensuring that the section current does not exceed the limit value;
5) buyer constraint: ensuring that the purchase amount is less than the maximum purchase amount;
6) seller constraint: ensuring that the sold amount is less than the maximum saleable amount;
7) and (3) adjustable transfer node adjustment amount constraint: ensuring that the adjustment amount is in an adjustable range;
8) and (3) transport restraint: the sum of the regulating variables of all the transfer nodes is zero, which indicates that no power is generated or absorbed in the transfer area;
and step 3: solving for
Inputting the transaction net rack data, buyer and seller information, transit node information, transmission constraint information, typical operation mode information and price information obtained in the step 1 into the transaction optimization model constructed in the step 2, solving by a computer by adopting a branch-and-bound method, wherein the solving result comprises the following steps: the volume of the buying and selling parties, the price of the buying and selling parties, the total net benefit, the comprehensive power transmission cost, the network loss cost, the regulation cost and the power transmission cost.
And 4, step 4: transaction path analysis
Step 4.1: calculating the branch load flow of the system after the transaction according to the solving result in the step 3;
step 4.2: subtracting the branch flow of the system after transaction from the branch flow in the original operation mode to obtain a branch flow increment;
and 4.3, step: arranging branch flow increment of each branch from large to small, marking each branch according to the sequence from large to small, and checking whether a buyer node and a seller node are communicated by the marked branch at any time;
step 4.4: when the marked branches are checked to connect the buyer nodes and the seller nodes, the marking is stopped, and all marked branches form a transaction path;
step 4.5: and analyzing the flow direction of the transaction trend in the network and the branch mainly participating in the transaction according to the path of the transaction.
Specifically, when the model provided by the invention is applied, the relevant data needs to be acquired from the power grid mode department and the power grid trading department as follows:
nodes i and j at two ends of branch in related power network, and branch resistor ri-jBranch reactance xi-jNonstandard transformation ratio k of transformer branchi-j(ii) a Maximum power P that branch i-j can flow throughi-j,maxThe branch flowing through power P in basic mode of operationi-j,0And a post-transaction through power Pi-j。
Injection power P under node i basic operation modei0Node i in the past operating modeMean value of
A seller node set m, a buyer node set n and a seller quotation function fm(Sm) Buyer quotation function gn(Bn) Wherein S ismFor selling electricity of node m, BnFor the electricity buying amount of the node n, the seller sells the upper limit Sm,maxUpper limit of electricity purchase by buyer Bn,max。
Adjustable transfer node t, unit up-regulation cost of adjustable transfer node t
Cost per unit down-regulation of adjustable transit node t
The adjustable transit node t can provide the upward adjustment of the maximum amount of
The adjustable transit node t can provide the downward adjustment of the maximum amount of
The section r comprises a set of branches, the active limit of the reference direction of the section r
Active limit of section r in non-reference direction
Grid loss price p, unit electricity transmission cost α of branch i-ji-j。
Referring to fig. 1, after the information is obtained from the grid mode department and the trading department, the optimization of the electric power trans-provincial and trans-regional trading and the analysis of the trading path are sequentially performed according to the following steps:
step 1: and establishing an objective function by taking the maximum total net benefit obtained by the electric power trans-provincial and trans-regional trading as an optimization target.
Step 1.1: represents the network loss;
the trans-provincial and trans-regional transaction relates to complex net racks, and in order to achieve sufficient precision and meet the solving time of practical engineering application, the following network loss calculation formula (1) based on a direct current flow result and a retained Taylor quadratic expansion term is adopted:
wherein: pLossWhich is indicative of the loss of the network,
the network loss of the i-j branch; r isi-jIs the resistance of the branch;
represents an average value of the voltage of the node i in the past case; k is a radical ofi-jRepresenting the ratio of the i-j branches, if the line, by ki-j＝1，θiIs the phase angle of node i.
Step 1.2: represents the integrated transmission cost of the electric power;
the comprehensive power transmission cost F is composed of the network loss cost in trans-regional and trans-provincial power transmission, the adjustment cost of an adjustable transfer node and the power transmission cost of a line, and the expression is shown in (2)
Wherein p represents the grid loss electricity price; pLossRepresenting the network loss to be optimized; pLoss0Calculating the network loss in the basic power flow mode according to the formula (1);
respectively representing unit up-regulation cost and unit down-regulation cost of the node t;
representing the amount of up-and down-regulation of node t αi-jRepresenting the transmission cost of the branch i-j unit power; pi-jRepresenting the active power flow of nodes i to j on the branch i-j; pi-j,0Representing the initial active power flow of nodes i to j on branch i-j.
For the whole equation, the first term represents the network loss cost; the second term represents the up-regulation cost of the adjustable transit node; the third term represents the down-regulation cost of the adjustable transit node; the fourth term represents the cost of the transmission charges of the line.
Step 1.3: establishing an objective function with the overall net benefit maximum target;
the optimization goal is shown in formula (3)
Max.∑gn(Bn)*Bn-∑fm(Sm)*Sm-F (3)
Wherein, BnThe electricity purchasing quantity of the node n is the buyer; smSelling electricity quantity for the seller node m; gn(Bn) A bid function for buyer node n; f. ofm(Sm) An offer function for seller node m; sigma gn(Bn)*BnThe power is bought for a power buying party; sigma fm(Sm)*SmPaying for selling the electricity by the electricity selling party; sigma gn(Bn)*Bn-∑fm(Sm)*SmReflecting the income of the transaction; f is the power integrated transmission cost represented by the formula (2).
Step 2: constructing constraints, including:
1) and (4) node power balance constraint.
Wherein, Pm0，Pn0，Pt0，Pq0Respectively representing initial injected power of nodes of a seller, a buyer, an adjustable transit node and an unmodulated transit node; j belongs to m and represents that the node j is connected with the node m; j belongs to n and represents that the node j is connected with the node n; j e t represents that the node j is connected with the node t; j belongs to q and represents that the node j is connected with the node q; j ≠ m denotes that the node j is not overlapped with the node m; j ≠ n denotes that the node j is not overlapped with the node n; j ≠ t denotes that the node j is not overlapped with the node t; j ≠ q represents that the node j is not overlapped with the node q; pm-jThe active power of a node m of a branch m-j flowing to a node j is represented; pn-jThe active power of a node n of a branch n-j flowing to a node j is represented; pt-jThe active power of a node t of a branch t-j flowing to a node j is represented; pq-jThe active power of a node q of a branch q-j flowing to a node j is represented; b isnSelling the electricity quantity of the buyer node n; smThe electricity purchasing quantity of the seller node m is obtained;
representing the amount of up-regulation and the amount of down-regulation of the node t; equations (4), (5), (6) and (7) represent the node power balance of the seller node, the buyer node, the adjustable transit node and the non-adjustable transit node, respectively.
2) And (5) line power flow constraint.
By adopting a direct current power flow model, each branch circuit needs to meet the power flow constraint as (8):
wherein, Pi-jActive power, θ, flowing to node j for node i of branch i-jiAnd thetajIs the phase angle, x, of node i and node j, respectivelyi-jIs the reactance of branch i-j.
3) Line transmission power limit constraints
-Pi-j,max≤Pi-j≤Pi-j,max(9)
Wherein, Pi-jThe active power flowing to the node j for the node i of the branch i-j; pi-j,maxThe maximum power allowed to flow on branch i-j.
This constraint means that the power flowing on branch i-j cannot exceed the maximum power limit.
4) Section constraint
Wherein, PITR(r)The active power flowing through the section r;
maximum power allowed to be transmitted for reference direction of section r;
the maximum power allowed to flow in the direction opposite to the reference direction for the section r.
This constraint represents the power P flowing on the section rITR(r)The active limit of the reference direction cannot be exceeded, nor the active limit of the opposite direction of the reference direction.
5) Seller constraints
0≤Sm≤Sm,max(11)
Wherein S ismFor buying electricity quantity of seller node m, Sm,maxThe maximum electricity selling amount of the seller node m;
this constraint indicates that the sell node m sells less than the maximum salable amount.
6) Buyer constraints
0≤Bn≤Bn,max(12)
Wherein, BnFor selling electricity of the buyer node n, Bn,maxThe maximum electricity purchasing quantity of the buyer node n is obtained;
this constraint represents that the buyer node n purchases less than the maximum amount available for purchase.
7) Adjustable transfer node adjustment constraint
Wherein,
represents the up-regulation amount and the down-regulation amount of the adjustable transfer node t,
respectively representing the maximum up-regulation amount and the maximum down-regulation amount of the adjustable transfer node t;
this constraint represents the amount of upward adjustment of the adjustable transit node t
And downward adjustment amount
Do not exceed the corresponding limits.
8) Transportment constraints in a transit zone
t belongs to an adjustable transit node set in a transit area;
representing the up-regulation quantity and the down-regulation quantity of the adjustable transfer node t;
is the adjustment of node t; the constraint means that the sum of the adjustment quantities of all adjustable transit nodes is zero, so that the transit function of the transit nodes is ensured, and transaction power is not absorbed or sent out.
And 3, step 3: and (4) constructing a power trans-provincial and trans-regional transaction model by the optimization target in the step 1 and the constraint condition in the step 2.
And 4, step 4: inputting the data acquired from the power grid mode department and the trading department into the constructed power trans-provincial and trans-regional trading model, and solving by a computer by adopting a general Mixed Integer Quadratic Programming (MIQP) solving method, wherein the obtained solving result comprises the following steps:
1) and (3) the information of the electricity seller: each seller node sells electricity and prices of trading electricity;
2) and E, power buying party information: the electricity purchasing quantity of each electricity purchasing node and the electricity purchasing price are respectively set;
3) the total net benefit of the transaction, the power integrated transmission cost of the transaction (including network loss cost, node regulation cost, transmission cost).
And 5, step 5: and analyzing the path of the transaction according to the information obtained by the step 4.
Step 5.1: calculating the branch flow of the system after the transaction according to the transaction result in the step 4 to form a branch flow set { P }i-jI, j is a transaction system node };
step 5.2: branch trend P of post-transaction systemi-jMinus the branch power flow P0 in the original operation modei-jAnd obtaining a branch power flow increment set omega ═ Δ Pi-jI, j is a transaction system node };
step 5.3: arranging the omega data of the branch trend increment set from big to small, marking each branch according to the sequence from big to small, and checking whether the buyer node and the seller node are communicated by the marked branch at any time;
step 5.4: when the marked branches are checked to connect the buyer nodes and the seller nodes, the marking is stopped, and all marked branches form a transaction path;
step 5.5: and analyzing the flow direction of the transaction trend in the network and the branch mainly participating in the transaction according to the path of the transaction.
The implementation of the transaction path analysis comprises the steps of calculating branch flow after transaction, calculating branch flow increment, sorting the branch flow increment, and marking branches one by one according to a sorting result until a buyer and a seller are communicated.
The technical solution of the present invention is further described in detail with reference to the following specific examples. This embodiment is described using an IEEE30 algorithm. IEEE30 System topology is shown in FIG. 2, transaction network branch data and node data are shown in Table 1 and Table 2, respectively, and the data are expressed in per unit value, wherein the reference capacity SB100MVA, reference voltage UB＝UavThe reference transaction period length is set to 1 h.
Table 1 transaction network leg data
| Branch numbering | Node i | Node j | R | X | B/2 | K | Branch power limitation |
| 1001 | 1 | 2 | 0.0192 | 0.0575 | 0.0264 | 1 | 1.3 |
| 1002 | 1 | 3 | 0.0452 | 0.1852 | 0.0204 | 1 | 1.3 |
| 1003 | 2 | 4 | 0.057 | 0.1737 | 0.0184 | 1 | 0.65 |
| 1004 | 2 | 5 | 0.0472 | 0.1983 | 0.0209 | 1 | 1.3 |
| 1005 | 2 | 6 | 0.0581 | 0.1763 | 0.0187 | 1 | 0.65 |
| 1006 | 3 | 4 | 0.0132 | 0.0379 | 0.0042 | 1 | 1.3 |
| 1007 | 4 | 6 | 0.0119 | 0.0414 | 0.0045 | 1 | 0.9 |
| 1008 | 12 | 4 | 0 | 0.256 | 0 | 0.9873 | 0.65 |
| 1009 | 5 | 7 | 0.046 | 0.116 | 0.0102 | 1 | 0.7 |
| 1010 | 6 | 7 | 0.0267 | 0.082 | 0.0085 | 1 | 1.3 |
| 1011 | 6 | 8 | 0.012 | 0.042 | 0.0045 | 1 | 0.32 |
| 1012 | 9 | 6 | 0 | 0.208 | 0 | 0.9847 | 0.65 |
| 1013 | 6 | 10 | 0 | 0.556 | 0 | 1.0385 | 0.32 |
| 1014 | 6 | 28 | 0.0169 | 0.0599 | 0.0065 | 1 | 0.32 |
| 1015 | 8 | 28 | 0.0636 | 0.2 | 0.0214 | 1 | 0.32 |
| 1016 | 9 | 10 | 0 | 0.11 | 0 | 1 | 0.65 |
| 1017 | 9 | 11 | 0 | 0.208 | 0 | 1 | 0.65 |
| 1018 | 10 | 17 | 0.0324 | 0.0845 | 0 | 1 | 0.32 |
| 1019 | 10 | 20 | 0.0936 | 0.209 | 0 | 1 | 0.32 |
| 1020 | 10 | 21 | 0.0348 | 0.0749 | 0 | 1 | 0.32 |
| 1021 | 10 | 22 | 0.0727 | 0.1499 | 0 | 1 | 0.32 |
| 1022 | 12 | 13 | 0 | 0.14 | 0 | 1 | 0.65 |
| 1023 | 12 | 14 | 0.1231 | 0.2559 | 0 | 1 | 0.32 |
| 1024 | 12 | 15 | 0.0662 | 0.1304 | 0 | 1 | 0.32 |
| 1025 | 12 | 16 | 0.0945 | 0.1987 | 0 | 1 | 0.32 |
| 1026 | 14 | 15 | 0.221 | 0.1997 | 0 | 1 | 0.16 |
| 1027 | 15 | 18 | 0.107 | 0.2185 | 0 | 1 | 0.16 |
| 1028 | 15 | 23 | 0.1 | 0.202 | 0 | 1 | 0.16 |
| 1029 | 16 | 17 | 0.0824 | 0.1932 | 0 | 1 | 0.16 |
| 1030 | 18 | 19 | 0.0639 | 0.1292 | 0 | 1 | 0.16 |
| 1031 | 19 | 20 | 0.034 | 0.068 | 0 | 1 | 0.32 |
| 1032 | 21 | 22 | 0.0116 | 0.0236 | 0 | 1 | 0.32 |
| 1033 | 22 | 24 | 0.115 | 0.179 | 0 | 1 | 0.16 |
| 1034 | 23 | 24 | 0.132 | 0.27 | 0 | 1 | 0.16 |
| 1035 | 24 | 25 | 0.1885 | 0.3292 | 0 | 1 | 0.16 |
| 1036 | 25 | 26 | 0.2554 | 0.38 | 0 | 1 | 0.16 |
| 1037 | 25 | 27 | 0.1093 | 0.2087 | 0 | 1 | 0.16 |
| 1038 | 28 | 27 | 0 | 0.396 | 0 | 1.0437 | 0.65 |
| 1039 | 27 | 29 | 0.2198 | 0.4153 | 0 | 1 | 0.16 |
| 1040 | 27 | 30 | 0.3202 | 0.6027 | 0 | 1 | 0.16 |
| 1041 | 29 | 30 | 0.2399 | 0.4533 | 0 | 1 | 0.16 |
TABLE 2 node data (node Properties, base trend information)
The maximum electricity selling quantities of the seller nodes 1 and 2 are both 30MWh, the maximum electricity buying quantities of the buyer nodes 26 and 29 are both 30MWh, and the price quoting functions of the seller node 1 and the seller node 2 are respectively as follows: f. of1(S1)＝1.3*S1+330 (Yuan/MWh), f2(S2)＝1.2*S2+330 (M/MWh); the quotation functions of the buyer nodes 26 and 29 are respectively: g26(B26)＝-1.3*B26+480 (M/MWh), g29(B29)＝-1.2*B29+470 (M/MWh). The adjustable point upward adjustment price is that the downward adjustment price is respectively set to be 10 yuan/MWh and 5 yuan/MWh, the upper limit and the lower limit of the adjustment amount are set to be 20% of the initial power generation amount of the basic power flow, and the power transmission cost of each branch is set to be 10 yuan/MWh.
After data preparation, a model is established according to the steps 1 and 2, and then the trading result shown in the table 3 is obtained through the solution of the step 4:
TABLE 3 transaction results
The transaction path obtained by the analysis is shown in fig. 3 via step 5.
As can be seen from fig. 3, the transaction path is: 1-3-4-6- (8) -28-27- (30) -29,1-3-4-6-9-10-21-22-24-25-26,2- (4) -6- (8) -28-27- (30) -29,2- (4) -6-9-10-21-22-24-25-26.
The invention provides an effective optimization and path analysis method for electric power bilateral transaction, aiming at the defects of the current cross-region and cross-provincial electric power transaction optimization method. When the invention optimizes the electric power transaction, the adjustment function of the transfer node is considered, and the comprehensive cost considering the transmission cost, the adjustment cost and the network loss cost is taken into account. In addition, when the network loss cost is evaluated, a network loss formula for improving and reserving Taylor expansion quadratic terms is adopted on the basis of direct current flow, so that the network loss can be more accurately depicted, and the network loss cost can be more accurately calculated. Finally, the method also provides a method for determining a feasible transaction path of the engineering, and a power transmission channel with large influence on the transaction is found out by comparing the trend variation before and after the transaction, so that a complete system for transaction optimization analysis is formed, and the optimization result is more meaningful.
Finally, it should be noted that: the above embodiments are only for illustrating the technical solutions of the present invention, and the protection scope of the present invention is not limited thereto, and any person skilled in the art can substitute or change the technical solutions of the present invention and their inventive concepts within the scope of the present invention.
Claims (4)
1. A method for analyzing electric power cross-province and cross-district transaction paths is characterized by comprising the following steps: the method comprises the following steps:
step 1: data preparation and acquisition work: the data comprises trading network frame data, buyer and seller information, transit node information, transmission constraint information, typical operation mode information and price information;
step 2: construction of transaction optimization model
Step 2.1: constructing an optimization target: the overall net benefit of the transaction is maximized;
step 2.1.1: evaluating the network loss cost in the power comprehensive transmission cost by adopting a Taylor expansion formula for retaining quadratic terms under the direct current trend; the method is specifically obtained by the following network loss calculation formula (1) based on a direct current power flow result and a retained Taylor quadratic expansion term;
wherein: pLossRepresenting the network loss to be optimized; r isi-jIs the resistance of the branch;
represents an average value of the voltage of the node i in the past case; k is a radical ofi-jRepresenting the ratio of the i-j branches, if the line, by ki-j＝1，θiIs the phase angle of node i, j are the node numbers, thetajIs the phase angle of the node j,
represents an average value of the voltage of the node j in the past case;
step 2.1.2: evaluating the adjustment cost in the electric power comprehensive transmission cost, wherein the evaluation method is to multiply the adjustment quantity of the adjustable transfer node by the adjustment unit price; wherein the adjustment cost in evaluating the power integrated transmission cost is obtained by the formula (2);
wherein F represents the comprehensive transmission cost of the electric power, and p represents the power loss price; pLossRepresenting the network loss to be optimized; pLoss0Calculating the network loss in the basic power flow mode according to the formula (1);
respectively representing unit up-regulation cost and unit down-regulation cost of the adjustable transfer node t;
representing the amount of up-and down-regulation of the adjustable transit node t αi-jRepresenting the transmission cost of the branch i-j unit power; pi-jRepresenting the active power flow of nodes i to j on the branch i-j; pi-j，0Representing the initial active power flow of nodes i to j on the branch i-j;
step 2.1.3: evaluating the cost of power transmission expense in the comprehensive power transmission cost;
step 2.1.4: evaluating an overall net benefit of the transaction;
step 2.2: constructing constraints, including:
1) node power balance constraints;
2) and (3) line power flow constraint: adopting a direct current power flow model;
3) line transmission power limit constraints: ensuring that the line tide does not exceed the limit value;
4) section restraint: ensuring that the section current does not exceed the limit value;
5) buyer constraint: ensuring that the purchase amount is less than the maximum purchase amount;
6) seller constraint: ensuring that the sold amount is less than the maximum saleable amount;
7) and (3) adjustable transfer node adjustment amount constraint: ensuring that the adjustment amount is within an adjustable range;
8) and (3) transport restraint: the sum of the regulating variables of all the transfer nodes is zero, which indicates that no power is generated or absorbed in the transfer area;
and step 3: solving for
Inputting the transaction net rack data, buyer and seller information, transit node information, transmission constraint information, typical operation mode information and price information obtained in the step 1 into the transaction optimization model constructed in the step 2, solving by a computer by adopting a branch-and-bound method, wherein the solving result comprises the following steps: the volume of the buying and selling parties, the price of the buying and selling parties, the total net benefit, the comprehensive power transmission cost, the network loss cost, the regulation cost and the power transmission cost;
and 4, step 4: analyzing the transaction path according to the solving result of the step 3 so as to achieve the aim of optimizing the transaction more reasonably;
the step 4 specifically comprises the following steps:
step 4.1: calculating the branch load flow of the system after the transaction according to the solving result of the step 3; step 4.2: subtracting the branch flow of the system after transaction from the branch flow in the original operation mode to obtain a branch flow increment;
and 4.3, step: arranging branch flow increment of each branch from large to small, marking each branch according to the sequence from large to small, and checking whether a buyer node and a seller node are communicated by the marked branch at any time;
step 4.4: when the marked branches are checked to connect the buyer nodes and the seller nodes, the marking is stopped, and all marked branches form a transaction path;
step 4.5: and analyzing the flow direction of the transaction trend in the network and the branch mainly participating in the transaction according to the path of the transaction.
2. The method as claimed in claim 1, wherein the step 1 is a step of analyzing the transaction path between provinces and regions
Transaction net rack data: the method comprises the steps of topological structure, branch impedance, generator node load node position and nonstandard transformation ratio of a transformer branch;
buyer and seller information: the method comprises the steps of acquiring node information of a buyer and a seller, quoting of the buyer and the seller and an upper limit quantity of the buyer and the seller;
information of the transfer node: whether a reconciliation service can be provided, a quote for providing the reconciliation service, and an up-down reconciliation limit;
transmitting constraint information: branch power flow constraint information, section information and section constraint information;
the section constraints are as follows:
wherein, PITR(r)The active power flowing through the section r;
maximum power allowed to be transmitted for reference direction of section r;
maximum power allowed to flow in the direction opposite to the reference direction of the section r;
this constraint represents the power P flowing on the section rITR(r)The active limit of the reference direction of the section r and the active limit of the opposite direction of the reference direction cannot be exceeded;
typical operating mode information: basic trend data before transaction;
price information: grid loss electricity price information and transmission price information.
3. The method for analyzing transaction path between provinces and regions in electric power as claimed in claim 1, wherein, the overall net benefit of the evaluation transaction of step 2.1.4 in step 2 is obtained by formula (3);
Max.∑gn(Bn)*Bn-∑fm(Sm)*Sm-F (3)
wherein, BnThe electricity purchasing quantity of the node n is the buyer; smSelling electricity quantity for the seller node m; gn(Bn) A bid function for buyer node n; f. ofm(Sm) An offer function for seller node m; sigma gn(Bn)*BnPaying for buying electricity by a power buying party; sigma fm(Sm)*SmSelling the electricity for the electricity selling party; sigma gn(Bn)*Bn-∑fm(Sm)*SmReflecting the benefits of the transaction.
4. The method as claimed in claim 1, wherein the step 2.2 of step 2 is a step of analyzing the transaction path between provinces and regions
1) Node power balance constraints
Wherein, Pm0，Pn0，Pt0，Pq0Respectively representing initial injected power of nodes of a seller, a buyer, an adjustable transit node and an unmodulated transit node; j belongs to m and represents that the node j is connected with the node m; j belongs to n and represents that the node j is connected with the node n; j e t represents that the node j is connected with the node t; j belongs to q and represents that the node j is connected with the node q; j ≠ m denotes that the node j is not overlapped with the node m; j ≠ n denotes that the node j is not overlapped with the node n; j ≠ t denotes that the node j is not overlapped with the node t; j ≠ q represents that the node j is not overlapped with the node q; pm-jThe active power of a node m of a branch m-j flowing to a node j is represented; b isn-jThe active power of a node n of a branch n-j flowing to a node j is represented; pt-jThe active power of a node t of a branch t-j flowing to a node j is represented; pq-jThe active power of a node q of a branch q-j flowing to a node j is represented; b isnThe electricity purchasing quantity of the node n is the buyer; smSelling electricity quantity for the seller node m; the formulas (4), (5), (6) and (7) respectively represent the node power balance of the seller node, the buyer node, the adjustable transit node and the non-adjustable transit node;
2) line flow constraint
By adopting a direct current power flow model, each branch circuit needs to satisfy power flow constraint as shown in a formula (8):
wherein, Pi-jActive power, x, flowing to node j for node i of branch i-ji-jIs the branch i-j reactance;
3) line transmission power limit constraints
-Pi-j，max≤Pi-j≤Pi-j，max(9)
Wherein, Pi-jThe active power flowing to the node j for the node i of the branch i-j; pi-j，maxThe maximum power allowed to flow on the branch i-j;
this constraint means that the power flowing on branch i-j cannot exceed the maximum power limit;
4) seller constraints
0≤Sm≤Sm，max(11)
Wherein S ismFor selling electricity of seller node m, Sm，maxThe maximum electricity selling amount of the seller node m;
the constraint represents that the electricity selling node m sells the electricity quantity less than or equal to the maximum salable quantity;
5) buyer constraints
0≤Bn≤Bn，max(12)
Wherein, BnFor buying power of the buyer node n, Bn，maxThe maximum electricity purchasing quantity of the buyer node n is obtained;
the constraint represents that the electricity quantity purchased by the buyer node n is less than or equal to the maximum purchase quantity;
6) adjustable transfer node adjustment constraint
Wherein,
respectively representing the maximum up-regulation amount and the maximum down-regulation amount of the adjustable transfer node t;
this constraint represents the amount of upward adjustment of the adjustable transit node t
And downward adjustment amount
Do not exceed the corresponding limits;
7) transportment constraints in a transit zone
t belongs to the adjustable transit node set in the transit area;
representing the up-regulation quantity and the down-regulation quantity of the adjustable transfer node t;
the adjustment quantity of the adjustable transfer node t; the constraint means that the sum of the adjustment amounts of all the adjustable transit nodes is zero, so that the transit function of the transit nodes is guaranteed, and transaction power is not absorbed or sent out.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510717775.5A CN105303256B (en) | 2015-10-29 | 2015-10-29 | Electric power trans-provincial and trans-regional transaction path analysis method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510717775.5A CN105303256B (en) | 2015-10-29 | 2015-10-29 | Electric power trans-provincial and trans-regional transaction path analysis method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105303256A CN105303256A (en) | 2016-02-03 |
| CN105303256B true CN105303256B (en) | 2020-03-17 |
Family
ID=55200498
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510717775.5A Active CN105303256B (en) | 2015-10-29 | 2015-10-29 | Electric power trans-provincial and trans-regional transaction path analysis method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105303256B (en) |
Families Citing this family (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106099923B (en) * | 2016-07-26 | 2017-06-06 | 南方电网科学研究院有限责任公司 | Power transmission line optimization method and device |
| CN106228273B (en) * | 2016-07-29 | 2022-02-22 | 中国电力科学研究院 | Method for constructing hydropower delivery transaction optimization model |
| CN108347048B (en) * | 2017-01-22 | 2024-03-19 | 中国电力科学研究院 | Planning method adapting to transregional and transnational scheduling modes |
| CN110414740A (en) * | 2019-08-01 | 2019-11-05 | 国网重庆市电力公司电力科学研究院 | A kind of method of commerce and device for realizing abandoning energy consumption |
| CN111428922B (en) * | 2020-03-19 | 2022-04-05 | 云南电网有限责任公司 | Electric power market clearing method and system for rapid posterior condition section |
| CN112257950A (en) * | 2020-11-02 | 2021-01-22 | 上海电力大学 | Trade path configuration method applied to power market and computer-readable storage medium |
| CN113706245A (en) * | 2021-08-26 | 2021-11-26 | 国网上海市电力公司 | Cross-provincial electric power transaction path determination method, system, equipment and storage medium |
| CN115688459B (en) * | 2022-11-10 | 2024-02-13 | 国家电网有限公司华东分部 | Cross-regional provincial spot transaction optimization method and device and electronic equipment |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103955776A (en) * | 2014-05-14 | 2014-07-30 | 国家电网公司 | Method for optimizing interprovincial and interregional transaction based on physical route optimization |
| CN104091210A (en) * | 2014-07-01 | 2014-10-08 | 国家电网公司 | Trans-provincial and trans-regional transaction optimization method based on financial path optimization |
| CN104463367A (en) * | 2014-12-05 | 2015-03-25 | 国家电网公司 | Power transaction stream optimization method involving power transmission paths |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2003091659A (en) * | 2001-09-19 | 2003-03-28 | Yasokazu Makino | Electric power trade mediation system |
-
2015
- 2015-10-29 CN CN201510717775.5A patent/CN105303256B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103955776A (en) * | 2014-05-14 | 2014-07-30 | 国家电网公司 | Method for optimizing interprovincial and interregional transaction based on physical route optimization |
| CN104091210A (en) * | 2014-07-01 | 2014-10-08 | 国家电网公司 | Trans-provincial and trans-regional transaction optimization method based on financial path optimization |
| CN104463367A (en) * | 2014-12-05 | 2015-03-25 | 国家电网公司 | Power transaction stream optimization method involving power transmission paths |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105303256A (en) | 2016-02-03 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105303256B (en) | Electric power trans-provincial and trans-regional transaction path analysis method | |
| Kim et al. | A P2P-dominant distribution system architecture | |
| Haggi et al. | Multi-round double auction-enabled peer-to-peer energy exchange in active distribution networks | |
| Aguado et al. | Market-driven dynamic transmission expansion planning | |
| Balamurugan et al. | Performance comparison of evolutionary programming and differential evolution approaches for social welfare maximization by placement of multi type FACTS devices in pool electricity market | |
| CN109272353B (en) | System dynamic probability energy flow analysis method considering comprehensive demand response uncertainty | |
| CN106682933B (en) | Trans-regional and trans-provincial power consumer direct transaction method considering transmission network loss influence factor | |
| Ghaffari et al. | Options based reserve procurement strategy for wind generators-using binomial trees | |
| Liu et al. | Derivation of locational marginal prices for restructured wholesale power markets | |
| Bhand et al. | Transaction-tracing based loss allocation in distribution networks under TE system | |
| Hua et al. | Demand-side joint electricity and carbon trading mechanism | |
| CN112001576A (en) | Accounting method for electric power consumption of renewable energy source | |
| Yang et al. | Optimal fuel, power and load-based emissions trades for electric power supply chain equilibrium | |
| Faria et al. | P2P market coordination methodologies with distribution grid management | |
| Bevin et al. | Decentralized local electricity market model using Automated Market Maker | |
| Noorfatima et al. | Development of community-based peer-to-peer energy trading mechanism using Z-bus network cost allocation | |
| CN109344997A (en) | A kind of multizone power trade method and system | |
| Krishnan et al. | Evolutionary programming-based simulation of bilateral real power contracts by optimal placement of flexible AC transmission system devices using contingency analysis | |
| Bhand et al. | Loss Allocation in Distribution Network involving Peer-to-Peer Energy Transactions | |
| Lei et al. | Analysis of strategic bidding of a DER aggregator in energy markets through the Stackelberg game model with the mixed-integer lower-level problem | |
| Li et al. | Planning distribution network using the multi-agent game and distribution system operators | |
| Subramanyam et al. | A Preliminary Study on Collusion Detection In Transactive Energy Systems | |
| Gavgani et al. | Demand response-based voltage security improvement using artificial neural networks and sensitivity analysis | |
| Hao et al. | Total supply capability model for distribution network with electric trading market | |
| Jahromi et al. | A Novel Optimal Planning Between Generation and Transmission Expansion Planning Considering Security Constraint |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |