CN108648024A - A kind of power distribution network distributed generation resource deploying node computational methods - Google Patents
A kind of power distribution network distributed generation resource deploying node computational methods Download PDFInfo
- Publication number
- CN108648024A CN108648024A CN201810588612.5A CN201810588612A CN108648024A CN 108648024 A CN108648024 A CN 108648024A CN 201810588612 A CN201810588612 A CN 201810588612A CN 108648024 A CN108648024 A CN 108648024A
- Authority
- CN
- China
- Prior art keywords
- dlmp
- network loss
- discharge
- distribution network
- active
- 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.)
- Pending
Links
- 238000000205 computational method Methods 0.000 title claims abstract description 13
- 238000000034 method Methods 0.000 claims abstract description 54
- 239000003344 environmental pollutant Substances 0.000 claims abstract description 7
- 231100000719 pollutant Toxicity 0.000 claims abstract description 7
- 230000005611 electricity Effects 0.000 claims description 16
- 238000012937 correction Methods 0.000 claims description 8
- 238000004364 calculation method Methods 0.000 claims description 6
- 230000007123 defense Effects 0.000 claims description 4
- 230000010354 integration Effects 0.000 claims description 3
- 230000005284 excitation Effects 0.000 abstract description 5
- 238000007796 conventional method Methods 0.000 description 8
- 230000008901 benefit Effects 0.000 description 5
- 230000005540 biological transmission Effects 0.000 description 3
- 238000010586 diagram Methods 0.000 description 3
- 230000000694 effects Effects 0.000 description 3
- 238000004458 analytical method Methods 0.000 description 2
- 235000013399 edible fruits Nutrition 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000008439 repair process Effects 0.000 description 2
- 230000011218 segmentation Effects 0.000 description 2
- 239000000243 solution Substances 0.000 description 2
- 230000009471 action Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 238000007599 discharging Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 238000002347 injection Methods 0.000 description 1
- 239000007924 injection Substances 0.000 description 1
- 230000007246 mechanism Effects 0.000 description 1
- 238000010248 power generation Methods 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
- 230000009467 reduction Effects 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 230000009897 systematic effect Effects 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q30/00—Commerce
- G06Q30/02—Marketing; Price estimation or determination; Fundraising
- G06Q30/0283—Price estimation or determination
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
- G06Q50/06—Energy or water supply
-
- H—ELECTRICITY
- H02—GENERATION; CONVERSION OR DISTRIBUTION OF ELECTRIC POWER
- H02J—CIRCUIT ARRANGEMENTS OR SYSTEMS FOR SUPPLYING OR DISTRIBUTING ELECTRIC POWER; SYSTEMS FOR STORING ELECTRIC ENERGY
- H02J3/00—Circuit arrangements for ac mains or ac distribution networks
- H02J3/38—Arrangements for parallely feeding a single network by two or more generators, converters or transformers
- H02J3/381—Dispersed generators
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02E—REDUCTION OF GREENHOUSE GAS [GHG] EMISSIONS, RELATED TO ENERGY GENERATION, TRANSMISSION OR DISTRIBUTION
- Y02E40/00—Technologies for an efficient electrical power generation, transmission or distribution
- Y02E40/70—Smart grids as climate change mitigation technology in the energy generation sector
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02P—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN THE PRODUCTION OR PROCESSING OF GOODS
- Y02P80/00—Climate change mitigation technologies for sector-wide applications
- Y02P80/10—Efficient use of energy, e.g. using compressed air or pressurized fluid as energy carrier
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y04—INFORMATION OR COMMUNICATION TECHNOLOGIES HAVING AN IMPACT ON OTHER TECHNOLOGY AREAS
- Y04S—SYSTEMS INTEGRATING TECHNOLOGIES RELATED TO POWER NETWORK OPERATION, COMMUNICATION OR INFORMATION TECHNOLOGIES FOR IMPROVING THE ELECTRICAL POWER GENERATION, TRANSMISSION, DISTRIBUTION, MANAGEMENT OR USAGE, i.e. SMART GRIDS
- Y04S10/00—Systems supporting electrical power generation, transmission or distribution
- Y04S10/50—Systems or methods supporting the power network operation or management, involving a certain degree of interaction with the load-side end user applications
Landscapes
- Business, Economics & Management (AREA)
- Engineering & Computer Science (AREA)
- Strategic Management (AREA)
- Development Economics (AREA)
- Economics (AREA)
- Accounting & Taxation (AREA)
- Physics & Mathematics (AREA)
- Health & Medical Sciences (AREA)
- Theoretical Computer Science (AREA)
- Marketing (AREA)
- General Physics & Mathematics (AREA)
- Finance (AREA)
- General Business, Economics & Management (AREA)
- Public Health (AREA)
- Tourism & Hospitality (AREA)
- Primary Health Care (AREA)
- Human Resources & Organizations (AREA)
- General Health & Medical Sciences (AREA)
- Water Supply & Treatment (AREA)
- Entrepreneurship & Innovation (AREA)
- Power Engineering (AREA)
- Game Theory and Decision Science (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention discloses a kind of power distribution network distributed generation resource deploying node computational methods, using in cooperative game for handle unlimited more player's Game with Coalitions method --- Aumann Shapley values methods share network loss and polluted gas discharge capacity, propose a kind of computational methods being used to calculate DLMP values in power distribution network based on this.Fair determining each DG of the invention is contributed made by network loss and disposal of pollutants reducing, positive economic incentives signal can be provided for it, distribution company can adjust weight factor according to the priority of network loss and discharge capacity simultaneously, have the different types of DG of the excitation stressed to reduce network loss or discharge capacity.
Description
Technical field
The present invention is a kind of power distribution network distributed generation resource deploying node computational methods, belongs to system for distribution network of power control
Field processed.
Background technology
Distributed generation resource (DG) accesses power distribution network, and the active and idle of injection will change distribution power flow size and stream
To being affected to distribution network voltage quality, network loss and reliability, power distribution network is changed into active net from traditional passive network
Network, feature is more intended to power transmission network, therefore some operation reserves for being suitable for power transmission network can also apply to power distribution network.
Under Power Market, in order to safeguard the safe and reliable operation of power distribution network, distribution company can be by way of electricity price excitation pair
The output of grid-connected DG is managed and controls indirectly, can introduce the maximally efficient Price Mechanisms of current power transmission net thus --- section
Point Marginal Pricing (LMP).In recent years, domestic and foreign scholars have carried out systematic research to DLMP (power distribution network deploying node),
But all zero sale surplus is also cannot achieve without solving the problems, such as to increase the calculating multiple shot array brought with the grid-connected numbers of DG.
Invention content
Goal of the invention：The present invention proposes a kind of power distribution network distributed generation resource deploying node computational methods, in multiple DG
In the case of accessing power distribution network, distribution network loss and discharge amount of pollution are reduced.
Technical solution：The technical solution adopted by the present invention is a kind of power distribution network distributed generation resource deploying node calculating side
Method includes the following steps：
1) DLMP at all DG nodes is set to united market cleaing price ρa；
2) according to the cost function of DGObtain the active power output P of each DGi；
3) the distribution network loss P after calculating DG is grid-connectedlossWith discharge amount of pollution E；
4) network loss of each DG is calculated based on A-S value methods and discharge reduces the amount of sharing；
5) the active and idle DLMP correction amounts of DG nodes are calculated；
6) original work(of DG nodes and idle DLMP values are modified；
7) judge whether to meet end condition, if satisfied, then iteration terminates；It repeats to repair if not satisfied, then returning to step 2)
The active and idle DLMP of just each DG.
By the cost function of each DG in the step 2)Obtain active power output PiCalculation formula it is as follows：
Wherein,Indicate DG when+1 iteration of jthiActive power output, in (1) formula and (2) formula, ai,bi,ciRespectively
DGiCost function parameters,For DGiThe DLMP values obtained in iteration j.
Distribution network loss P described in the step 3)lossIt is calculated as follows with discharge amount of pollution E：
In formula (3) and formula (4), NbrFor circuitry number, NDGIt is total for DG,And EFgridRespectively DGiWith the pollution of power plant
Emission factor (kg/kW).
DG in establishing power grid in the step 4)iGenerated output at a time isThe then DGiCaused by network loss/
Discharging decrement isTo DGiIt contributes and carries out limitless defense right, if DG at this timeiIt contributes and increases a dimensionless Δ bi(Δbi
→ 0), then Δ biTo reduce network loss/discharge capacity contributrion margin be：
Work as DGiGenerated output biWhen increasing to its maximum value from 0, DG can be obtainediNetwork loss/discharge reduce the amount of sharing ψi：
In formula (6), λ is integration variable, biFor DGiGenerated output, fk() be the power distribution network under given λ value network loss/
Discharge decrement.
The active and idle DLMP correction amounts of DG nodes are in the step 5)：
In above formula,WithRespectively DGiActive and idle DLMP correction amounts；With
Respectively DGiActive DLMP network loss and discharge reduce correct component, respective weights are respectively ω1And ω2, and meet ω1+
ω2=1；WithRespectively DGiNetwork loss and discharge in iteration j reduce the amount of sharing；And EjRespectively access
Network loss and discharge capacity after DG when iteration j,And EbaseThe network loss and discharge capacity when DG are not accessed respectively.
As follows to DG in the step 6)iOriginal work(and idle DLMP values be modified：
In above formula, 1% of Reactive Power Price less than active electricity price at balance nodes can be neglected, therefore ρr≈0。
Advantageous effect：The present invention shares network loss and disposal of pollutants decrement by A-S value methods, fair can determine each DG pairs
It reduces and is contributed made by network loss and disposal of pollutants, positive economic incentives signal can be provided for it；Meanwhile distribution network loss and dirt
It can be that distribution company brings extra returns, A-S values method to share these extra returns to each DG, i.e., in fact completely that dye discharge capacity, which is reduced,
Existing pool schemes zero sell surplus；Due to the incentive action of electricity price, each DG will generate electricity out to it for additional income as far as possible
Power is adjusted, and is conducive to management and control of the distribution company to DG；Distribution company can be according to the preferential of network loss and discharge capacity
Grade adjustment weight factor, has the different types of DG of the excitation stressed to reduce network loss or discharge capacity.
Description of the drawings
Fig. 1 is the work flow diagram of the present invention；
Fig. 2 is 33 Node power distribution system topology diagrams of IEEE；
Fig. 3 is 69 Node power distribution system topology diagrams of IEEE；
Fig. 4 is conventional method and the present invention under the different market clearing prices solved based on 69 Node power distribution systems of IEEE
The obtained network loss result figure of method；
Fig. 5 be based on the market clearing price that 69 Node power distribution systems of IEEE solve be respectively ρ=23 ($/MW) and ρ=
When 26 ($/MW), conventional method and the active DLMP result figures at the obtained DG nodes of the method for the present invention；
Fig. 6 is conventional method and the present invention under the different market clearing prices solved based on 69 Node power distribution systems of IEEE
The obtained sale surplus of method.
Specific implementation mode
In the following with reference to the drawings and specific embodiments, the present invention is furture elucidated, it should be understood that these embodiments are merely to illustrate
It the present invention rather than limits the scope of the invention, after having read the present invention, those skilled in the art are to of the invention each
The modification of kind equivalent form falls within the application range as defined in the appended claims.
As shown in Figure 1, the present invention includes the following steps：
1) DLMP being arranged at all DG nodes is united market cleaing price ρa(electricity price at balance nodes), i.e.,
(πa)i=ρa, (πa)iIt indicates the active DLMP values at node i, obtains the initial operating state of all DG；
2) the active power output P of each DG is obtained according to the cost function of DGi, calculation formula such as formula (12)：
Pi j+1Indicate DG when+1 iteration of jthiActive power output, in (11) formula and (12) formula, ai,bi,ciRespectively DGi's
Cost function parameters,For DGiThe DLMP values obtained in iteration j；
3) the distribution network loss P after calculating DG is grid-connectedlossWith discharge amount of pollution E：
In formula (13) and formula (14), NbrFor circuitry number, NDGIt is total for DG,And EFgridRespectively DGiWith power plant
The disposal of pollutants factor (kg/kW)；
4) network loss of each DG is calculated based on A-S value methods and discharge reduces the amount of sharing, and share result with Shapley values
It is compared：
Shapley value methods：Network loss/discharge that each DG in power distribution network is calculated based on Shapley value methods reduces the amount of sharing, meter
It is as follows to calculate formula：
In formula (15) and formula (16),Expression is shared to i-th of distributed generation resource DGiNetwork loss (l)/discharge (e) reduce
Amount, S refer to comprising multiple DGiAlliance, | S | refer to the DG quantity in alliance S, n, which refers to, participates in distribution network loss and discharge decrement point
The DG sums at booth, [v (S)-v (S- { i })] is calculated due to i-th of distributed generation resource DGiThe income that the S that coalizes is brought to alliance
Value added, the i.e. marginal benefit of alliance S, W (S) represent a weights, indicate i-th of distributed generation resource DGiIt should assign to
The share of alliance's S marginal benefits, n！Indicate that the arrangement of order is added in the be possible to DG of Major Leagues (including all DG).
A-S values method (Aumann-Shapley values method)：
The basic thought of A-S value methods is that each player is divided into unlimited number of player, then unlimited to each
Small player calculates its amount of sharing using Shapley value methods.Its essence is seek each player to each cooperative alliances contributrion margin
Average value, therefore the influence that secondary ordered pair that coalizes of each player shares result can be ignored, has economic consistency peaceful
Etc. property.It can realize fair and reasonable share.
It is seen on surface, since alliance's number greatly increases, the calculation amount of A-S value methods will be far longer than Shapley value methods.But
Be, A-S values method by carrying out limitless defense right to each player, therefore share order that result and each player coalize without
It closes, the amount of sharing can be calculated by analytic method.
Assuming that DG in power distribution networkiGenerated output at a time isThe then DGiCaused by network loss/discharge decrement beTo DGiIt contributes and carries out limitless defense right, if DG at this timeiIt contributes and increases a dimensionless Δ bi(Δbi→ 0), then Δ bi
To reduce network loss/discharge capacity contributrion margin be：
Work as DGiGenerated output biWhen increasing to its maximum value from 0, DG can be obtainediNetwork loss/discharge reduce the amount of sharing ψi：
In formula (18), λ is integration variable, biFor DGiGenerated output, fk() is the network loss of the power distribution network under given λ value
With discharge decrement.
Due to distribution network loss and discharge capacity the complex nature of the problem, it is difficult to share network loss/discharge capacity and be expressed as specification
Aumann-Shapley forms.We are using A-S value methods are simplified thus, by DGiLimited number of time segmentation is carried out, S alliances are calculated separately
In last access system sub-fraction DGiThe network loss and discharge decrement, summation brought to system can be obtained DGiPoint
Spread out result.
5) the active and idle DLMP correction amounts of DG nodes are calculated.Active DLMP correction amounts are made of two components：Network loss
It reduces component and discharge reduces component.
In formula (19), formula (20) and formula (21),WithRespectively DGiActive and idle DLMP correct
Amount；WithRespectively DGiActive DLMP network loss and discharge reduce correct component, respective weights are respectively ω1
And ω2, and meet ω1+ω2=1；WithRespectively DGiNetwork loss and discharge in iteration j reduce the amount of sharing；And EjNetwork loss and discharge capacity after respectively access DG when iteration j,And EbaseNet when DG is not accessed respectively
Damage and discharge capacity.
6) to DGiOriginal work(and idle DLMP values be modified：
In formula (22), 1% of Reactive Power Price less than active electricity price at balance nodes can be neglected, therefore ρr≈0。
7) judge whether to meet end condition, if satisfied, then iteration terminates；It repeats to repair if not satisfied, then returning to step 2)
The active and idle DLMP of just each DG：
Wherein, ε is minimum.If meet formula (23) even if if indicate at this time increase DGiActive power output, can not also reduce
Network loss and discharge amount of pollution lose the effect of electricity price excitation, it is possible to terminate iteration.
The income of distribution company can be expressed as：
In formula (24), benefitjIndicate that the interests that distribution company obtains when iteration j, Demand indicate distribution system
Total load amount, γeFor unit disposal of pollutants cost (/kg), Pi jWithActive and nothing when iteration j is indicated respectively
Work(is contributed, πc,πa,πrUser DLMP, active DLMP and idle DLMP are corresponded to respectively.Determine each DG's when using unified electricity price method
When active and idle DLMP, the centre two of formula (24) is 0, i.e.,：
In formula (25), γeFor unit disposal of pollutants cost (/kg).
Formula (24) and formula (25) subtract each other the extra returns that can be obtained distribution company, that is, sell surplus and be：
In formula (27) and formula (28), Δ benefitjIndicate the extra returns of distribution company when iteration j, MSlAnd MSe
Respectively because network loss and discharge reduce the extra returns brought to power distribution company.
The present invention is separately verified by two embodiments is shared having compared to Shapley value methods using A-S value methods
The feasibility and reasonability of effect property and simplicity and DLMP computation models.
Example 1
It is IEEE33 node power distribution networks as shown in Fig. 2, which contains 33 nodes and 3 branch lines.Exist respectively
DG is accessed at node 8,12 and 23, the emission factor of DG waiting is shown in Table 1, and power factor is lag 0.9.
Table 1
Shapley values are respectively adopted to divide the network loss of IEEE-33 node systems and discharge decrement with A-S values method
Booth.Assuming that the active power output of all DG is 500kW, three DG can be considered three players, be denoted as N={ 1,2,3 }, all
Player gathers and each nonvoid subset forms an alliance, and the network loss and discharge decrement of each alliance are shown in Table 2.
Table 2
The network loss of three DG is calculated by Shapley values and discharge reduces the amount of sharing, and is shared and be the results are shown in Table 3.
When calculating the amount of sharing using A-S value methods, due to the complexity of distribution network loss and discharge capacity Allocation, this literary grace
With A-S value methods are simplified, by DGiLimited number of time segmentation is carried out, i.e., by DGiIt is divided into n fraction, then calculates separately each small portion
The DG dividediWhen the last one access system DG is can be obtained with decrement, summation is discharged to the network loss that system is broughtiShare knot
Fruit.Sharing for A-S value methods the results are shown in Table 3.
Table 3
Shapley values and simplify A-S value methods share result in contrast table 3：Simplify obtained three DG's of A-S value methods
Network loss and discharge reduce the amount of sharing sharing result and compare error very little, therefore the calculating knot of simplification A-S value methods with Shapley values
Fruit meets fair principle；But the calculation amount of Shapley value methods can in distribution network DG numbers increase and drastically increase
Add (such as when DG numbers are 10, calculative alliance's number be 3 628 800), and A-S value methods introduce limitization processing with
Analytic method can solve this multiple shot array problem, calculate more simple.
Example 2
It is as shown in Fig. 3 IEEE69 node power distribution networks, the DG containing three types in network, each type of DG are each
Four, the power factor of all DG is lag 0.9；Power generation capacity, cost function parameters and the emission factor of each DG is shown in respectively
Table 4 and table 5.
Table 4
Table 5
Network loss and the discharge reduction amount of sharing based on each DG that A-S value methods calculate, can be obtained under different market clearing prices
DLMP values at DG active power outputs, DG nodes and corresponding network loss when corresponding different weight factors and discharge capacity, as a result distinguish
It is shown in Table 6 and table 7.
Table 6
Table 7
Traditional DLMP computation models mainly have unified electricity price method and marginal loss method：In unified electricity price method at all nodes
DLMP be united market cleaing price；DLMP at marginal loss method interior joint i is by the node to the contributrion margin of network loss
It determines：
Formula (29) and (30) are respectively the active and idle DLMP values at node i, ρaFor united market cleaing price, PiWith
QiActive and reactive power respectively at node i.
In order to verify the superiority that the method for the present invention compares other conventional methods, calculates and work as ω1=ω2When=0.5,
Unified electricity price method under the different market prices, marginal loss method and based on the obtained system losses value of A-S value methodologies and
It is active at each DG nodes that above-mentioned three kinds of methods obtain when market clearing price is respectively ρ=23 and ρ=26 ($/MW)
DLMP values (marginal loss method and based on A-S values methodology all use the method for the present invention in iterative model), as a result respectively such as
Shown in attached drawing 4 and attached drawing 5.
In conjunction with attached drawing 4 with attached drawing 5 it is found that comparing two kinds of conventional methods, the DLMP that the method for the present invention determines can be that each DG is carried
It is encouraged for more electricity prices, therefore can greatly reduce system losses.
Attached drawing 6 is that the sale under being calculated based on the method for the present invention and two kinds of conventional methods under different market clearing prices is full of
It is remaining.DG is grid-connected to reduce system losses and discharge capacity, and extra returns are brought for distribution network systems：This part is received under unified electricity price method
Benefit returns distribution company all completely, and marginal loss method can only also share some to DG, therefore both conventional methods
It all can not achieve zero sale surplus；The method of the present invention gives network loss and discharge decrement fair distribution to each DG by A-S values method, i.e.,
The extra returns of distribution network systems are shared completely to each DG, thus can realize that pool schemes zero sell surplus.
In general, it is proposed that based on being counted using the power distribution network LMP that A-S values share network loss and discharge decrement
Calculation method can effectively overcome the problems, such as the multiple shot array of traditional Shapley values methodology, for accessing the distribution netting gear of more DG
There is certain applicability；The DLMP computational methods can not only reduce network loss and discharge capacity simultaneously, moreover it is possible to be realized and be matched by electricity price excitation
Net company is to the DG management contributed and control；Compared with conventional method, this method greatly can carry out electricity price to each DG and swash
It encourages, reduces system losses and discharge capacity.
As it will be easily appreciated by one skilled in the art that the foregoing is merely preferably experimental programs of the invention, not to
The limitation present invention, every all any modification, equivalent and improvement etc. done within the spirit and principles in the present invention have been wrapped
Containing within protection scope of the present invention.
Claims (6)
1. a kind of power distribution network distributed generation resource deploying node computational methods, which is characterized in that include the following steps：
1) DLMP at all DG nodes is set to united market cleaing price ρa；
2) according to the cost function of DGObtain the active power output P of each DGi；
3) the distribution network loss P after calculating DG is grid-connectedlossWith discharge amount of pollution E；
4) network loss of each DG is calculated based on A-S value methods and discharge reduces the amount of sharing；
5) the active and idle DLMP correction amounts of DG nodes are calculated；
6) original work(of DG nodes and idle DLMP values are modified；
7) judge whether to meet end condition, if satisfied, then iteration terminates；It repeats to correct respectively if not satisfied, then returning to step 2)
The active and idle DLMP of DG.
2. power distribution network distributed generation resource deploying node computational methods according to claim 1, which is characterized in that described
By the cost function of each DG in step 2)Obtain active power output PiCalculation formula it is as follows：
Pi j+1Indicate DG when+1 iteration of jthiActive power output, in (1) formula and (2) formula, ai,bi,ciRespectively DGiCost letter
Number parameter,For DGiThe DLMP values obtained in iteration j.
3. power distribution network distributed generation resource deploying node computational methods according to claim 1, which is characterized in that described
Distribution network loss P described in step 3)lossIt is calculated as follows with discharge amount of pollution E：
In formula (3) and formula (4), NbrFor circuitry number, NDGIt is total for DG,And EFgridRespectively DGiWith the disposal of pollutants of power plant
The factor (kg/kW).
4. power distribution network distributed generation resource deploying node computational methods according to claim 1, which is characterized in that described
DG in establishing power grid in step 4)iGenerated output at a time isThe then DGiCaused by network loss/discharge decrement beTo DGiIt contributes and carries out limitless defense right, if DG at this timeiIt contributes and increases a dimensionless Δ bi(Δbi→ 0), then Δ bi
To reduce network loss/discharge capacity contributrion margin be：
Work as DGiGenerated output biWhen increasing to its maximum value from 0, DG can be obtainediNetwork loss/discharge reduce the amount of sharing ψi：
In formula (6), λ is integration variable, biFor DGiGenerated output, fk() is network loss/discharge of the power distribution network under given λ value
Decrement.
5. power distribution network distributed generation resource deploying node computational methods according to claim 1, which is characterized in that described
The active and idle DLMP correction amounts of DG nodes are in step 5)：
In above formula,WithRespectively DGiActive and idle DLMP correction amounts；WithRespectively
For DGiActive DLMP network loss and discharge reduce correct component, respective weights are respectively ω1And ω2, and meet ω1+ω2=
1；WithRespectively DGiNetwork loss and discharge in iteration j reduce the amount of sharing；And EjAfter respectively accessing DG
Network loss when iteration j and discharge capacity,And EbaseThe network loss and discharge capacity when DG are not accessed respectively.
6. power distribution network distributed generation resource deploying node computational methods according to claim 1, which is characterized in that described
As follows to DG in step 6)iOriginal work(and idle DLMP values be modified：
In above formula, 1% of Reactive Power Price less than active electricity price at balance nodes can be neglected, therefore ρr≈0。
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810588612.5A CN108648024A (en) | 2018-06-08 | 2018-06-08 | A kind of power distribution network distributed generation resource deploying node computational methods |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810588612.5A CN108648024A (en) | 2018-06-08 | 2018-06-08 | A kind of power distribution network distributed generation resource deploying node computational methods |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN108648024A true CN108648024A (en) | 2018-10-12 |
Family
ID=63752166
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810588612.5A Pending CN108648024A (en) | 2018-06-08 | 2018-06-08 | A kind of power distribution network distributed generation resource deploying node computational methods |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108648024A (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109886836A (en) * | 2019-03-01 | 2019-06-14 | 西安交通大学 | A kind of dynamic partition Prices Calculation based on partition clustering analysis |
| CN111416394A (en) * | 2020-03-16 | 2020-07-14 | 国网河北省电力有限公司电力科学研究院 | AC/DC flexible power distribution network coordinated optimization scheduling method considering blocking management |
| CN116073377A (en) * | 2023-03-06 | 2023-05-05 | 国网浙江省电力有限公司宁波供电公司 | Main and distribution network interaction coordination method and system based on bidirectional regulation |
-
2018
- 2018-06-08 CN CN201810588612.5A patent/CN108648024A/en active Pending
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109886836A (en) * | 2019-03-01 | 2019-06-14 | 西安交通大学 | A kind of dynamic partition Prices Calculation based on partition clustering analysis |
| CN109886836B (en) * | 2019-03-01 | 2021-01-19 | 西安交通大学 | Dynamic partition electricity price calculation method based on partition clustering analysis |
| CN111416394A (en) * | 2020-03-16 | 2020-07-14 | 国网河北省电力有限公司电力科学研究院 | AC/DC flexible power distribution network coordinated optimization scheduling method considering blocking management |
| CN116073377A (en) * | 2023-03-06 | 2023-05-05 | 国网浙江省电力有限公司宁波供电公司 | Main and distribution network interaction coordination method and system based on bidirectional regulation |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109657946B (en) | Mathematical model and planning method for regional energy Internet planning based on game theory | |
| CN108565900B (en) | Distributed energy optimization operation method based on game theory | |
| CN110443398B (en) | Optimal operation method of regional comprehensive energy system based on repeated game model | |
| CN108648024A (en) | A kind of power distribution network distributed generation resource deploying node computational methods | |
| CN105303256B (en) | Electric power trans-provincial and trans-regional transaction path analysis method | |
| CN109919450B (en) | Game optimization method for solving scheduling of comprehensive intelligent energy system | |
| CN111192164A (en) | Micro-grid combined game optimization sharing and benefit distribution method considering uncertain wind power | |
| CN107067281A (en) | The double-deck price competing method of micro-capacitance sensor electricity market based on multiple agent and game method | |
| CN112952908B (en) | Distributed coordination transaction method for multi-cooperation micro-grid main body | |
| CN107067191B (en) | Excitation requirement response method based on cloud and system under intelligent grid environment | |
| CN113393125A (en) | Comprehensive energy system cooperative scheduling method based on source-load bilateral interactive game | |
| Liu et al. | Derivation of locational marginal prices for restructured wholesale power markets | |
| CN113888204A (en) | Multi-subject game virtual power plant capacity optimization configuration method | |
| CN115271438B (en) | Multi-main-body game collaborative scheduling method capable of considering carbon emission and electronic equipment | |
| CN108280544A (en) | A kind of electricity power market equilibrium method for solving based on double-deck particle swarm algorithm | |
| CN115313520A (en) | Distributed energy system game optimization scheduling method, system, equipment and medium | |
| CN105207200B (en) | A kind of unbalanced power network development Coordination Analysis method of power load distributing | |
| CN113344651A (en) | Multi-energy-supply main body planning method for comprehensive energy market under carbon trading mechanism | |
| CN110889598B (en) | Distributed power generation project optimal configuration method | |
| Dulipala et al. | Decision-making model with reduced risk of penalties in transactive energy markets | |
| CN110889778A (en) | Electric energy value evaluation method based on network security constraint | |
| Sharma et al. | Comparative analysis of ACOPF and DCOPF based LMP simulation with distributed loss model | |
| Tsao et al. | Efficiency of resilient three-part tariff pricing schemes in residential power markets | |
| CN109461021A (en) | Electric car charge and discharge pricing method based on leader-followers games method | |
| CN114757580A (en) | Active power distribution network expansion planning method for multi-subject incomplete information non-cooperative game |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20181012 |
|
| RJ01 | Rejection of invention patent application after publication |