CN107171324A - A kind of power distribution network linear programming model containing distributed power source - Google Patents
A kind of power distribution network linear programming model containing distributed power source Download PDFInfo
- Publication number
- CN107171324A CN107171324A CN201710506987.8A CN201710506987A CN107171324A CN 107171324 A CN107171324 A CN 107171324A CN 201710506987 A CN201710506987 A CN 201710506987A CN 107171324 A CN107171324 A CN 107171324A
- Authority
- CN
- China
- Prior art keywords
- mrow
- msub
- munderover
- sigma
- node
- 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
- 238000010276 construction Methods 0.000 claims description 40
- 230000005611 electricity Effects 0.000 claims description 13
- 230000007613 environmental effect Effects 0.000 claims description 12
- 238000005457 optimization Methods 0.000 claims description 9
- 238000002347 injection Methods 0.000 claims description 8
- 239000007924 injection Substances 0.000 claims description 8
- 230000005540 biological transmission Effects 0.000 claims description 7
- 239000003344 environmental pollutant Substances 0.000 claims description 6
- 231100000719 pollutant Toxicity 0.000 claims description 6
- 230000008859 change Effects 0.000 claims description 4
- 238000009434 installation Methods 0.000 claims description 4
- 238000012423 maintenance Methods 0.000 claims description 4
- 230000009466 transformation Effects 0.000 claims description 2
- 238000012545 processing Methods 0.000 abstract description 2
- 238000000034 method Methods 0.000 description 7
- 239000011159 matrix material Substances 0.000 description 5
- 238000010586 diagram Methods 0.000 description 4
- 238000011160 research Methods 0.000 description 4
- 230000008569 process Effects 0.000 description 3
- 239000000243 solution Substances 0.000 description 3
- 238000005516 engineering process Methods 0.000 description 2
- 102000002274 Matrix Metalloproteinases Human genes 0.000 description 1
- 108010000684 Matrix Metalloproteinases Proteins 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000015572 biosynthetic process Effects 0.000 description 1
- 230000001427 coherent effect Effects 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 239000000686 essence Substances 0.000 description 1
- 230000002068 genetic effect Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 239000002245 particle Substances 0.000 description 1
- 238000002360 preparation method Methods 0.000 description 1
- 230000010349 pulsation Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 238000003786 synthesis reaction Methods 0.000 description 1
Classifications
-
- 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
-
- 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
- G06Q10/00—Administration; Management
- G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
-
- 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/008—Circuit arrangements for ac mains or ac distribution networks involving trading of energy or energy transmission rights
-
- 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
- H02J2203/00—Indexing scheme relating to details of circuit arrangements for AC mains or AC distribution networks
- H02J2203/20—Simulating, e g planning, reliability check, modelling or computer assisted design [CAD]
Landscapes
- Engineering & Computer Science (AREA)
- Business, Economics & Management (AREA)
- Economics (AREA)
- Human Resources & Organizations (AREA)
- Strategic Management (AREA)
- Theoretical Computer Science (AREA)
- General Business, Economics & Management (AREA)
- Health & Medical Sciences (AREA)
- Marketing (AREA)
- Power Engineering (AREA)
- General Physics & Mathematics (AREA)
- Tourism & Hospitality (AREA)
- Physics & Mathematics (AREA)
- Quality & Reliability (AREA)
- Game Theory and Decision Science (AREA)
- Development Economics (AREA)
- Operations Research (AREA)
- Entrepreneurship & Innovation (AREA)
- Public Health (AREA)
- Water Supply & Treatment (AREA)
- General Health & Medical Sciences (AREA)
- Primary Health Care (AREA)
- Pharmaceuticals Containing Other Organic And Inorganic Compounds (AREA)
Abstract
Linearization approximate processing has been carried out the invention discloses the power flow equation and connectedness for power distribution network, it is proposed that a kind of power distribution network linear programming basic model containing distributed power source.Based on a kind of distribution network system, sample calculation analysis is carried out for model under different planning scenes, the result of calculation of linear programming model and common Nonlinear programming Model have been contrasted.As a result show, set forth herein linear programming model for distribution network planning at this stage analysis be effective, compared to traditional power distribution network Nonlinear programming Model, set forth herein linear programming model on the basis of precision is ensured, with higher calculating and analysis efficiency.
Description
Technical field
The present invention relates to distribution network planning technical field, specially a kind of power distribution network linear programming mould containing distributed power source
Type.
Background technology
Continued to develop with economical and society, high efficiency of energy and safe utilization are paid close attention to by more and more extensive,
Closest to terminal user power distribution network be power system important component, its make rational planning for construction is also just obtaining increasingly abundant
Research.
Distribution network planning is the basal conditions of load prediction results according to planning period and existing network, is meeting load
On the premise of increasing with safe and reliable power supply, optimal system Construction scheme is determined so that the construction of power distribution network and operating cost
It is minimum.It is wide variety of straight in Transmission Expansion Planning in Electric because power distribution network has the features such as line resistance is higher, voltage pulsation is larger
Stream tide model be not particularly suited for distribution network, therefore, in conventional research, for power distribution network network constraint foundation often
Based on AC Ioad flow model.However, AC Ioad flow model has nonlinearity, it is difficult to utilize common mathematical optimization tools pair
The distribution network planning model set up based on AC power flow is solved.For such case, most of document selections are using heredity
The intelligent algorithms such as algorithm, particle cluster algorithm, but such algorithm is only applicable to the solution of the less optimization planning problem of scale.
Based on considerations above, research meets the power distribution network linearisation plan model of certain required precision, will greatly lift distribution network planning
The efficiency of problem solving is drawn, further basis is provided for the follow-up theoretical research of power distribution network.
The content of the invention
For problem above, the invention provides a kind of power distribution network linear programming model containing distributed power source, rule are met
The model optimization problem solving of the larger power distribution network linearisation planning of mould, will greatly lift the effect of distribution network planning problem solving
Rate, the problem of effectively can solving in background technology.
To achieve the above object, the present invention provides following technical scheme：A kind of power distribution network linear gauge containing distributed power source
Model is drawn, is comprised the following steps：
Step S1：Electric Power Network Planning model objective function is set up, for distribution network planning, the distribution in power distribution network is considered
In the case of the factors such as formula power supply, grid structure, with the minimum optimization of the construction cost, operating cost and Environmental costs of power distribution network
Target；
Step S2：The constraints of Electric Power Network Planning model is set up, including trend constraint, grid structure constraint, is generated electricity
Capacity-constrained, electric quantity balancing constraint, node voltage constraint, the constraint of branch road transimission power and the constraint of distributed power source installed capacity.
As a kind of preferred technical scheme of the present invention, Electric Power Network Planning model objective function is described in step S1：
Minf (x)=γ Ccon(x)+Cope(x)+Cenv(x)
Wherein, γ is the years such as construction cost value mean coefficient, and r is discount rate, and investments of the Y to build circuit and equipment is repaid
Phase；Construction cost C is included in the programmed cost among the Electric Power Network Planning model objective functioncon(x), operating cost Cope
(x) with Environmental costs Cenv(x)。
It is used as a kind of preferred technical scheme of the present invention, the construction cost Ccon(x), operating cost CopeAnd environment (x)
Cost Cenv(x) expression formula is respectively：
Construction cost
Operating cost
Environmental costs
Wherein, cabThe expense of a articles circuit b kind construction scheme is represented, A represents the sum of circuit yet to be built, and B represents newly-built
The sum of Decision Making of Line Schemes, cdeThe expense of the d articles circuit e kind Replacing Scheme is represented, D represents the sum of circuit to be replaced, and E is represented
Change the sum of Decision Making of Line Schemes, cFBgRepresent the unit capacity cost of g kind distributed power source construction schemes, pFBfgRepresent f-th
The rated capacity of node g kind distributed power source construction schemes, F represents the sum of installation distributed electrical source node, and G represents distribution
The sum of formula power sources construction programme, cJB0Represent the unit capacity construction cost of newly-built transformer station, sJBhiRepresent h-th of node i-th
The construction capacity of transformer substation construction scheme is planted, H represents the node total number of possible newly-built transformer station, and I represents the side of newly-built transformer station
Case sum, cKBRepresent the unit capacity construction cost of transformer station's dilatation, sKBjkRepresent j-th of dilatation side of node kZhong transformer stations
The capacity of expansion of case, J represents the sum of existing power transformation tiny node, and K represents the scheme sum of transformer station's dilatation, pbIt is expressed as distribution
Net is from the unit price of power of higher level's power network power purchase, WBRepresent the year purchase of electricity of superior power network, cYFBgRepresent g kind distributed power sources
The unit capacity annual operating and maintenance cost of construction scheme, cYBRepresent the annual operating and maintenance cost of transformer station's unit capacity, cEFBglRepresent g kinds
Distributed power source construction scheme unit generated energy produces the Environmental costs that l kind pollutants are brought, wFBfgRepresent f-th of node
The annual generated energy of g kind distributed power source construction schemes, L represents the species sum for the pollutant that generating is produced, cEBlRepresent upward
Level power network buys unit generated energy and produces the Environmental costs that l kind pollutants are brought.
As a kind of preferred technical scheme of the present invention, the equation of 7 constraints is respectively in step S2：
Trend constraint：Using power flow equation inearized model
Grid structure is constrained：Using network connectivty inearized model
Un＞ ε
Generating capacity-constrained
Electric quantity balancing is constrained
Node voltage is constrained
Unmin≤Un≤Unmax
Branch road transimission power is constrained
Pmnmin≤Pmn≤Pmnmax
Distributed power source installed capacity is constrained
Wherein, N represents grid nodes sum, PmRepresent node m injection active power, QmRepresent that node m injection is idle
Power, UnRepresent node n node voltage amplitude, θnRepresent node n node voltage phase angle, sB0Represent the appearance of existing transformer station
Amount, wFBfgThe annual electricity generating capacity of f-th of node g kind distributed power source construction scheme is represented, τ represents that annual peak load is utilized
Hourage, η represents power distribution network average loss rate, UnminRepresent node n node voltage lower limit, UnmaxRepresent node n node electricity
Press the upper limit, PmnThe active power of the line transmission between node m, n is represented, λ represents region capacity-load ratio, gnRepresent node n most
Big burden with power, WBRepresent the year purchase of electricity of power distribution network superior power network, PmnminRepresent having for the line transmission between node m, n
The work(lower limit of the power, PmnmaxThe active power upper limit of the line transmission between node m, n is represented, σ represents distributed power source installation appearance
Amount accounts for the ratio upper limit of power distribution network peak load.
Compared with prior art, the beneficial effects of the invention are as follows：
Power flow equation constraint firstly for power distribution network proposes linear approximation method, then for the network of power distribution network
Connectivity constraint proposes linear approximation method, then on the basis of above-mentioned appropriate constraints model, establishes distribution network planning
Draw model；
Carried inearized model is based respectively on to example power distribution network under the different scene of three below and tradition is non-linear
Model is solved using prevailing value optimization method and genetic algorithm, analyzed.
Scene 1：The planning of distributed power source is not considered, directly carries out distribution network structure planning；
Scene 2：Distribution network structure planning is first carried out, distributed power source planning is carried out again after completing space truss project；
Scene 3：Carry out the power distribution network synthesis coordinated planning containing distributed power source.
The model optimization problem solving of larger power distribution network linearisation planning is met, distribution network planning will be greatly lifted
Draw problem solving efficiency, set forth herein linear programming model for distribution network planning at this stage analysis be effective, compare
In traditional power distribution network Nonlinear programming Model, set forth herein linear programming model on the basis of precision is ensured, with compared with
High calculating and analysis efficiency.
Brief description of the drawings
Fig. 1 is the prototype structure schematic diagram of present example rack to be planned；
Structure Planning schematic diagrames of the Fig. 2 for the present invention based on inearized model under scene 1；
Structure Planning schematic diagrames of the Fig. 3 for the present invention based on inearized model under scene 2；
Structure Planning schematic diagrames of the Fig. 4 for the present invention based on inearized model under scene 3.
Embodiment
Below in conjunction with the accompanying drawing in the embodiment of the present invention, the technical scheme in the embodiment of the present invention is carried out clear, complete
Site preparation is described, it is clear that described embodiment is only a part of embodiment of the invention, rather than whole embodiments.It is based on
Embodiment in the present invention, it is every other that those of ordinary skill in the art are obtained under the premise of creative work is not made
Embodiment, belongs to the scope of protection of the invention.
Embodiment：
Fig. 1 to Fig. 4 is referred to, the present invention provides a kind of technical scheme：
A kind of power distribution network linear programming model containing distributed power source, comprises the following steps：
Step S1：Electric Power Network Planning model objective function is set up, for distribution network planning, the distribution in power distribution network is considered
In the case of the factors such as formula power supply, grid structure, with the minimum optimization of the construction cost, operating cost and Environmental costs of power distribution network
Target；
Step S2：The constraints of Electric Power Network Planning model is set up, including trend constraint, grid structure constraint, is generated electricity
Capacity-constrained, electric quantity balancing constraint, node voltage constraint, the constraint of branch road transimission power and the constraint of distributed power source installed capacity.
As shown in Figure 3 and Figure 4, subordinate list 1 is the peace of the distributed power access point based on inearized model under scene 2,3
Dressing amount:
Subordinate list 1
As shown in Figure 2, Figure 3 and Figure 4, subordinate list 2 is the programme cost pair based on inearized model under three scenes
Compare table:
Subordinate list 2
As shown in Figure 2, Figure 3 and Figure 4, subordinate list 3 is the programme cost pair based on nonlinear model under three scenes
Compare table:
Subordinate list 3
As shown in Figure 2, Figure 3 and Figure 4, subordinate list 4 is that inearized model and nonlinear model progress are utilized under three scenes
Required time contrast table during solution:
Subordinate list 4
The operation principle of the present invention：Power flow equation linearization process is carried out first, for N meshed networks, power system point
Classical power flow equation can be expressed as form in analysis：
I=1,2 ..., N
Wherein, Pi、Qi、UiAnd θiActive power injection, reactive power injection, voltage magnitude and the electricity of node i are represented respectively
Press phase angle, GijAnd BijIt is then the real and imaginary parts of respective element in network admittance matrix.
By the way that above-mentioned expression formula is transformed into the form based on line conductance and susceptance parameter, while using such as lower aprons side
Method：
gijUi(Ui-Ujcosθij)≈gij(Ui-Uj) (3)
bijUiUjsinθij≈bijθij=bij(θi-θj) (4)
Classical power flow equation can be write as to the form of formula (5) (6).Wherein, giiRepresent the self-conductance of node i, gijRepresent
The transconductance of circuit, b between node i and node jijRepresent the mutual susceptance of circuit between node i and node j, B'ijThen ignore
The imaginary part of coherent element in the network admittance matrix that node ground connection admittance is obtained.
In the present invention, it is contemplated that the characteristic of power distribution network itself, ignore node impedance ground, be improved for (5), most
Network trend inearized model is obtained eventually：
Then network connectivty linearization process is carried out, for the power network of a connection, a node injection is single wherein
Position electric current, then other nodes can produce corresponding node voltage, the size of node voltage is equal to mutual between the two nodes
Impedance magnitude.Therefore, thought of the present invention based on above-mentioned network impedance matrix proposes following network connectivty constraint：
Ui＞ ε, i=1,2 ..., N (9)
UiIt is any in network in a network during all nodes connections for when the injection unitary current of the node of some in network
The voltage magnitude of one node i, ε is fully small positive number.
If the original power network (there is network and do not connect situation) of certain construction to be planned, its admittance matrix is Y0.0-1 is defined to determine
Plan variable xbNewly-built circuit b to be selected state of investing to build is represented, 0 represents that the circuit is not invested to build, 1 represents to invest to build, all to be selected newly-built
The aggregated label of circuit is B.Meanwhile, circuit b whole story end is labeled as f successivelybAnd tb, then the primitive network voltage x current close
It is that equation can be written as：
Wherein, column vector MbFor description branch road b and the vector of node associate feature, it is total that number of elements is equal to network node
Number, fbIndividual element is 1, tbIndividual element is -1.Due to matrixIn be sparse matrix, then utilize this sparse characteristic real
It is existingLinearisation description, (10) are converted to：
In formula,WithIt is equal to the Virtual vector of branch of a network sum for dimension.By introducing big number M,WithIn it is right
Following form should be represented by the element at branch road whole story end, other positions element is 0：
Formula (9), (11)-(13) are the network connectivty linear restriction expression formula in the present invention.
Then the optimized variable proposed in the distribution network planning model based on linear trend constraint, model includes：
(1) 0-1 decision variables：Determine the whether newly-built x of circuitJX, circuit whether change xHX, distributed power source it is whether newly-built
xFB, the whether newly-built x of transformer stationJB, transformer station whether dilatation xKB
(2) real variable：The newly-built capacity of distributed power source, the newly-built capacity and capacity of expansion of transformer station, distributed electrical
The annual electricity generating capacity and superior power network year purchase of electricity in source.
Due to having carried out linearization process, the present invention, which carries model, to be asked by general mathematical optimization tools bag
Solution.
Finally, realized by the object function for setting up plan model and the constraints for setting up plan model for power distribution network
Power flow equation and connectedness carried out linearization approximate processing, compared to traditional power distribution network Nonlinear programming Model, herein
The linear programming model of proposition is on the basis of precision is ensured, with higher calculating and analysis efficiency.
The foregoing is merely illustrative of the preferred embodiments of the present invention, is not intended to limit the invention, all essences in the present invention
Any modifications, equivalent substitutions and improvements made within refreshing and principle etc., should be included in the scope of the protection.
Claims (4)
1. a kind of power distribution network linear programming model containing distributed power source, it is characterised in that comprise the following steps：
Step S1：Electric Power Network Planning model objective function is set up, for distribution network planning, the distributed electrical in power distribution network is considered
In the case of the factors such as source, grid structure, with the minimum optimization mesh of the construction cost, operating cost and Environmental costs of power distribution network
Mark；
Step S2：The constraints of Electric Power Network Planning model is set up, including trend constraint, grid structure constraint, generating capacity
Constraint, electric quantity balancing constraint, node voltage constraint, the constraint of branch road transimission power and the constraint of distributed power source installed capacity.
2. a kind of power distribution network linear programming model containing distributed power source according to claim 1, it is characterised in that：Step
Electric Power Network Planning model objective function described in S1 is：
Minf (x)=γ Ccon(x)+Cope(x)+Cenv(x)
<mrow>
<mi>&gamma;</mi>
<mo>=</mo>
<mfrac>
<mrow>
<mi>r</mi>
<msup>
<mrow>
<mo>(</mo>
<mn>1</mn>
<mo>+</mo>
<mi>r</mi>
<mo>)</mo>
</mrow>
<mi>Y</mi>
</msup>
</mrow>
<mrow>
<msup>
<mrow>
<mo>(</mo>
<mn>1</mn>
<mo>+</mo>
<mi>r</mi>
<mo>)</mo>
</mrow>
<mi>Y</mi>
</msup>
<mo>-</mo>
<mn>1</mn>
</mrow>
</mfrac>
</mrow>
Wherein, γ is the years such as construction cost value mean coefficient, and r is discount rate, and Y is construction circuit and the pay back period of investment of equipment；
Construction cost C is included in the programmed cost among the Electric Power Network Planning model objective functioncon(x), operating cost Cope(x) and
Environmental costs Cenv(x)。
3. a kind of power distribution network linear programming model containing distributed power source according to claim 2, it is characterised in that：It is described
Construction cost Ccon(x), operating cost Cope(x) with Environmental costs Cenv(x) expression formula is respectively：
Construction cost
<mfenced open = "" close = "">
<mtable>
<mtr>
<mtd>
<mrow>
<msub>
<mi>C</mi>
<mrow>
<mi>c</mi>
<mi>o</mi>
<mi>n</mi>
</mrow>
</msub>
<mrow>
<mo>(</mo>
<mi>x</mi>
<mo>)</mo>
</mrow>
<mo>=</mo>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>a</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>A</mi>
</munderover>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>b</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>B</mi>
</munderover>
<msub>
<mi>c</mi>
<mrow>
<mi>a</mi>
<mi>b</mi>
</mrow>
</msub>
<msub>
<mi>x</mi>
<mrow>
<mi>J</mi>
<mi>X</mi>
<mi>i</mi>
<mi>j</mi>
</mrow>
</msub>
<mo>+</mo>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>d</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>D</mi>
</munderover>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>e</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>E</mi>
</munderover>
<msub>
<mi>c</mi>
<mrow>
<mi>d</mi>
<mi>e</mi>
</mrow>
</msub>
<msub>
<mi>x</mi>
<mrow>
<mi>H</mi>
<mi>X</mi>
<mi>d</mi>
<mi>e</mi>
</mrow>
</msub>
<mo>+</mo>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>f</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>F</mi>
</munderover>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>g</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>G</mi>
</munderover>
<msub>
<mi>c</mi>
<mrow>
<mi>F</mi>
<mi>B</mi>
<mi>g</mi>
</mrow>
</msub>
<msub>
<mi>p</mi>
<mrow>
<mi>F</mi>
<mi>B</mi>
<mi>f</mi>
<mi>g</mi>
</mrow>
</msub>
<msub>
<mi>x</mi>
<mrow>
<mi>F</mi>
<mi>B</mi>
<mi>f</mi>
<mi>g</mi>
</mrow>
</msub>
</mrow>
</mtd>
</mtr>
<mtr>
<mtd>
<mrow>
<mo>+</mo>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>h</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>H</mi>
</munderover>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>i</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>I</mi>
</munderover>
<mrow>
<mo>(</mo>
<msub>
<mi>c</mi>
<mrow>
<mi>J</mi>
<mi>B</mi>
<mn>0</mn>
</mrow>
</msub>
<mo>+</mo>
<msub>
<mi>c</mi>
<mrow>
<mi>J</mi>
<mi>B</mi>
</mrow>
</msub>
<msub>
<mi>s</mi>
<mrow>
<mi>J</mi>
<mi>B</mi>
<mi>h</mi>
<mi>i</mi>
</mrow>
</msub>
<mo>)</mo>
</mrow>
<msub>
<mi>x</mi>
<mrow>
<mi>J</mi>
<mi>B</mi>
<mi>h</mi>
<mi>i</mi>
</mrow>
</msub>
<mo>+</mo>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>j</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>J</mi>
</munderover>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>k</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>K</mi>
</munderover>
<msub>
<mi>c</mi>
<mrow>
<mi>K</mi>
<mi>B</mi>
</mrow>
</msub>
<msub>
<mi>s</mi>
<mrow>
<mi>K</mi>
<mi>B</mi>
<mi>j</mi>
<mi>k</mi>
</mrow>
</msub>
<msub>
<mi>x</mi>
<mrow>
<mi>K</mi>
<mi>B</mi>
<mi>j</mi>
<mi>k</mi>
</mrow>
</msub>
</mrow>
</mtd>
</mtr>
</mtable>
</mfenced>
Operating cost
<mfenced open = "" close = "">
<mtable>
<mtr>
<mtd>
<mrow>
<msub>
<mi>C</mi>
<mrow>
<mi>o</mi>
<mi>p</mi>
<mi>e</mi>
</mrow>
</msub>
<mrow>
<mo>(</mo>
<mi>x</mi>
<mo>)</mo>
</mrow>
<mo>=</mo>
<msub>
<mi>p</mi>
<mi>B</mi>
</msub>
<msub>
<mi>W</mi>
<mi>B</mi>
</msub>
<mo>+</mo>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>f</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>F</mi>
</munderover>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>g</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>G</mi>
</munderover>
<msub>
<mi>c</mi>
<mrow>
<mi>Y</mi>
<mi>F</mi>
<mi>B</mi>
<mi>g</mi>
</mrow>
</msub>
<msub>
<mi>p</mi>
<mrow>
<mi>F</mi>
<mi>B</mi>
<mi>f</mi>
<mi>g</mi>
</mrow>
</msub>
<msub>
<mi>x</mi>
<mrow>
<mi>F</mi>
<mi>B</mi>
<mi>f</mi>
<mi>g</mi>
</mrow>
</msub>
</mrow>
</mtd>
</mtr>
<mtr>
<mtd>
<mrow>
<mo>+</mo>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>h</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>H</mi>
</munderover>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>i</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>I</mi>
</munderover>
<msub>
<mi>c</mi>
<mrow>
<mi>Y</mi>
<mi>B</mi>
</mrow>
</msub>
<msub>
<mi>s</mi>
<mrow>
<mi>J</mi>
<mi>B</mi>
<mi>h</mi>
<mi>i</mi>
</mrow>
</msub>
<msub>
<mi>x</mi>
<mrow>
<mi>J</mi>
<mi>B</mi>
<mi>h</mi>
<mi>i</mi>
</mrow>
</msub>
<mo>+</mo>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>j</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>J</mi>
</munderover>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>k</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>K</mi>
</munderover>
<msub>
<mi>c</mi>
<mrow>
<mi>Y</mi>
<mi>B</mi>
</mrow>
</msub>
<msub>
<mi>s</mi>
<mrow>
<mi>K</mi>
<mi>B</mi>
<mi>j</mi>
<mi>k</mi>
</mrow>
</msub>
<msub>
<mi>x</mi>
<mrow>
<mi>K</mi>
<mi>B</mi>
<mi>j</mi>
<mi>k</mi>
</mrow>
</msub>
</mrow>
</mtd>
</mtr>
</mtable>
</mfenced>
Environmental costs
<mrow>
<msub>
<mi>C</mi>
<mrow>
<mi>e</mi>
<mi>n</mi>
<mi>v</mi>
</mrow>
</msub>
<mrow>
<mo>(</mo>
<mi>x</mi>
<mo>)</mo>
</mrow>
<mo>=</mo>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>f</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>F</mi>
</munderover>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>g</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>G</mi>
</munderover>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>l</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>L</mi>
</munderover>
<msub>
<mi>c</mi>
<mrow>
<mi>E</mi>
<mi>F</mi>
<mi>B</mi>
<mi>g</mi>
<mi>l</mi>
</mrow>
</msub>
<msub>
<mi>w</mi>
<mrow>
<mi>F</mi>
<mi>B</mi>
<mi>f</mi>
<mi>g</mi>
</mrow>
</msub>
<msub>
<mi>x</mi>
<mrow>
<mi>F</mi>
<mi>B</mi>
<mi>f</mi>
<mi>g</mi>
</mrow>
</msub>
<mo>+</mo>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>l</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>L</mi>
</munderover>
<msub>
<mi>c</mi>
<mrow>
<mi>E</mi>
<mi>B</mi>
<mi>l</mi>
</mrow>
</msub>
<msub>
<mi>W</mi>
<mi>B</mi>
</msub>
</mrow>
Wherein, cabThe expense of a articles circuit b kind construction scheme is represented, A represents the sum of circuit yet to be built, and B represents newly-built circuit
The sum of scheme, cdeThe expense of the d articles circuit e kind Replacing Scheme is represented, D represents the sum of circuit to be replaced, and E represents to change
The sum of Decision Making of Line Schemes, cFBgRepresent the unit capacity cost of g kind distributed power source construction schemes, pFBfgRepresent f-th of node
The rated capacity of g kind distributed power source construction schemes, F represents the sum of installation distributed electrical source node, and G represents distributed electrical
The sum of source construction scheme, cJB0Represent the unit capacity construction cost of newly-built transformer station, sJBhiRepresent h-th of node, i-th kind of change
The construction capacity of power plant construction scheme, H represents the node total number of possible newly-built transformer station, and I represents that the scheme of newly-built transformer station is total
Number, cKBRepresent the unit capacity construction cost of transformer station's dilatation, sKBjkRepresent j-th node kZhong transformer stations dilatation scheme
Capacity of expansion, J represents the sum of existing power transformation tiny node, and K represents the scheme sum of transformer station's dilatation, pbBe expressed as power distribution network from
The unit price of power of higher level's power network power purchase, WBRepresent the year purchase of electricity of superior power network, cYFBgRepresent g kind distributed power source construction
The unit capacity annual operating and maintenance cost of scheme, cYBRepresent the annual operating and maintenance cost of transformer station's unit capacity, cEFBglRepresent that g kinds are distributed
Formula power sources construction programme unit generated energy produces the Environmental costs that l kind pollutants are brought, wFBfgRepresent f-th of node g kind
The annual generated energy of distributed power source construction scheme, L represents the species sum for the pollutant that generating is produced, cEBlRepresent superior
Power network buys unit generated energy and produces the Environmental costs that l kind pollutants are brought.
4. a kind of power distribution network linear programming model containing distributed power source according to claim 1, it is characterised in that：Step
The equation of 7 constraints is respectively in S2：
Trend constraint：Using power flow equation inearized model
<mrow>
<msub>
<mi>P</mi>
<mi>m</mi>
</msub>
<mo>=</mo>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>n</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>N</mi>
</munderover>
<msub>
<mi>G</mi>
<mrow>
<mi>m</mi>
<mi>n</mi>
</mrow>
</msub>
<msub>
<mi>U</mi>
<mi>n</mi>
</msub>
<mo>-</mo>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>n</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>N</mi>
</munderover>
<msub>
<mi>B</mi>
<mrow>
<mi>m</mi>
<mi>n</mi>
</mrow>
</msub>
<msub>
<mi>&theta;</mi>
<mi>n</mi>
</msub>
</mrow>
<mrow>
<msub>
<mi>Q</mi>
<mi>m</mi>
</msub>
<mo>=</mo>
<mo>-</mo>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>n</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>N</mi>
</munderover>
<msub>
<mi>B</mi>
<mrow>
<mi>m</mi>
<mi>n</mi>
</mrow>
</msub>
<msub>
<mi>U</mi>
<mi>n</mi>
</msub>
<mo>-</mo>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>n</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>N</mi>
</munderover>
<msub>
<mi>G</mi>
<mrow>
<mi>m</mi>
<mi>n</mi>
</mrow>
</msub>
<msub>
<mi>&theta;</mi>
<mi>n</mi>
</msub>
</mrow>
Grid structure is constrained：Using network connectivty inearized model
Un＞ ε
<mrow>
<mover>
<mi>I</mi>
<mo>&CenterDot;</mo>
</mover>
<mo>=</mo>
<msub>
<mi>Y</mi>
<mn>0</mn>
</msub>
<mover>
<mi>U</mi>
<mo>&CenterDot;</mo>
</mover>
<mo>+</mo>
<munder>
<mo>&Sigma;</mo>
<mrow>
<mi>b</mi>
<mo>&Element;</mo>
<mi>B</mi>
</mrow>
</munder>
<mrow>
<mo>(</mo>
<msub>
<mi>M</mi>
<mi>b</mi>
</msub>
<msubsup>
<mi>U</mi>
<mi>b</mi>
<mi>f</mi>
</msubsup>
<mo>-</mo>
<msub>
<mi>M</mi>
<mi>b</mi>
</msub>
<msubsup>
<mi>U</mi>
<mi>b</mi>
<mi>t</mi>
</msubsup>
<mo>)</mo>
</mrow>
</mrow>
<mrow>
<mo>-</mo>
<msub>
<mi>x</mi>
<mi>b</mi>
</msub>
<mi>M</mi>
<mo>&le;</mo>
<msubsup>
<mi>U</mi>
<mi>b</mi>
<mi>f</mi>
</msubsup>
<mo>&le;</mo>
<msub>
<mi>x</mi>
<mi>b</mi>
</msub>
<mi>M</mi>
</mrow>
<mrow>
<msub>
<mi>U</mi>
<msub>
<mi>f</mi>
<mi>b</mi>
</msub>
</msub>
<mo>-</mo>
<mi>M</mi>
<mrow>
<mo>(</mo>
<mn>1</mn>
<mo>-</mo>
<msub>
<mi>x</mi>
<mi>b</mi>
</msub>
<mo>)</mo>
</mrow>
<mo>&le;</mo>
<msubsup>
<mi>U</mi>
<mi>b</mi>
<mi>f</mi>
</msubsup>
<mo>&le;</mo>
<msub>
<mi>U</mi>
<msub>
<mi>f</mi>
<mi>b</mi>
</msub>
</msub>
<mo>+</mo>
<mi>M</mi>
<mrow>
<mo>(</mo>
<mn>1</mn>
<mo>-</mo>
<msub>
<mi>x</mi>
<mi>b</mi>
</msub>
<mo>)</mo>
</mrow>
</mrow>
<mrow>
<mo>-</mo>
<msub>
<mi>x</mi>
<mi>b</mi>
</msub>
<mi>M</mi>
<mo>&le;</mo>
<msubsup>
<mi>U</mi>
<mi>b</mi>
<mi>t</mi>
</msubsup>
<mo>&le;</mo>
<msub>
<mi>x</mi>
<mi>b</mi>
</msub>
<mi>M</mi>
</mrow>
<mrow>
<msub>
<mi>U</mi>
<msub>
<mi>t</mi>
<mi>b</mi>
</msub>
</msub>
<mo>-</mo>
<mi>M</mi>
<mrow>
<mo>(</mo>
<mn>1</mn>
<mo>-</mo>
<msub>
<mi>x</mi>
<mi>b</mi>
</msub>
<mo>)</mo>
</mrow>
<mo>&le;</mo>
<msubsup>
<mi>U</mi>
<mi>b</mi>
<mi>t</mi>
</msubsup>
<mo>&le;</mo>
<msub>
<mi>U</mi>
<msub>
<mi>t</mi>
<mi>b</mi>
</msub>
</msub>
<mo>+</mo>
<mi>M</mi>
<mrow>
<mo>(</mo>
<mn>1</mn>
<mo>-</mo>
<msub>
<mi>x</mi>
<mi>b</mi>
</msub>
<mo>)</mo>
</mrow>
</mrow>
Generating capacity-constrained
<mfenced open = "" close = "">
<mtable>
<mtr>
<mtd>
<mrow>
<msub>
<mi>s</mi>
<mrow>
<mi>B</mi>
<mn>0</mn>
</mrow>
</msub>
<mo>+</mo>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>f</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>F</mi>
</munderover>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>g</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>G</mi>
</munderover>
<msub>
<mi>p</mi>
<mrow>
<mi>F</mi>
<mi>B</mi>
<mi>f</mi>
<mi>g</mi>
</mrow>
</msub>
<msub>
<mi>x</mi>
<mrow>
<mi>F</mi>
<mi>B</mi>
<mi>f</mi>
<mi>g</mi>
</mrow>
</msub>
<mo>+</mo>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>h</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>H</mi>
</munderover>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>i</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>I</mi>
</munderover>
<msub>
<mi>s</mi>
<mrow>
<mi>J</mi>
<mi>B</mi>
<mi>h</mi>
<mi>i</mi>
</mrow>
</msub>
<msub>
<mi>x</mi>
<mrow>
<mi>J</mi>
<mi>B</mi>
<mi>h</mi>
<mi>i</mi>
</mrow>
</msub>
</mrow>
</mtd>
</mtr>
<mtr>
<mtd>
<mrow>
<mo>+</mo>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>j</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>J</mi>
</munderover>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>k</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>K</mi>
</munderover>
<msub>
<mi>s</mi>
<mrow>
<mi>K</mi>
<mi>B</mi>
<mi>j</mi>
<mi>k</mi>
</mrow>
</msub>
<msub>
<mi>x</mi>
<mrow>
<mi>K</mi>
<mi>B</mi>
<mi>j</mi>
<mi>k</mi>
</mrow>
</msub>
<mo>&GreaterEqual;</mo>
<mi>&lambda;</mi>
<munderover>
<mo>&Sigma;</mo>
<mi>n</mi>
<mi>N</mi>
</munderover>
<msub>
<mi>g</mi>
<mi>n</mi>
</msub>
</mrow>
</mtd>
</mtr>
</mtable>
</mfenced>
Electric quantity balancing is constrained
<mrow>
<msub>
<mi>W</mi>
<mi>B</mi>
</msub>
<mo>+</mo>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>f</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>F</mi>
</munderover>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>g</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>G</mi>
</munderover>
<msub>
<mi>w</mi>
<mrow>
<mi>F</mi>
<mi>B</mi>
<mi>f</mi>
<mi>g</mi>
</mrow>
</msub>
<msub>
<mi>x</mi>
<mrow>
<mi>F</mi>
<mi>B</mi>
<mi>f</mi>
<mi>g</mi>
</mrow>
</msub>
<mo>=</mo>
<mfrac>
<mrow>
<mi>&tau;</mi>
<munderover>
<mo>&Sigma;</mo>
<mi>n</mi>
<mi>N</mi>
</munderover>
<msub>
<mi>g</mi>
<mi>n</mi>
</msub>
</mrow>
<mrow>
<mn>1</mn>
<mo>-</mo>
<mi>&eta;</mi>
</mrow>
</mfrac>
</mrow>
Node voltage is constrained
Un min≤Un≤Un max
Branch road transimission power is constrained
Pmn min≤Pmn≤Pmn max
Distributed power source installed capacity is constrained
<mrow>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>f</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>F</mi>
</munderover>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>g</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>G</mi>
</munderover>
<msub>
<mi>p</mi>
<mrow>
<mi>F</mi>
<mi>B</mi>
<mi>f</mi>
<mi>g</mi>
</mrow>
</msub>
<msub>
<mi>x</mi>
<mrow>
<mi>F</mi>
<mi>B</mi>
<mi>f</mi>
<mi>g</mi>
</mrow>
</msub>
<mo>&le;</mo>
<mi>&sigma;</mi>
<munderover>
<mo>&Sigma;</mo>
<mi>n</mi>
<mi>N</mi>
</munderover>
<msub>
<mi>g</mi>
<mi>n</mi>
</msub>
</mrow>
Wherein, N represents grid nodes sum, PmRepresent node m injection active power, QmRepresent the node m idle work(of injection
Rate, UnRepresent node n node voltage amplitude, θnRepresent node n node voltage phase angle, sB0Represent the appearance of existing transformer station
Amount, wFBfgThe annual electricity generating capacity of f-th of node g kind distributed power source construction scheme is represented, τ represents that annual peak load is utilized
Hourage, η represents power distribution network average loss rate, UnminRepresent node n node voltage lower limit, UnmaxRepresent node n node electricity
Press the upper limit, PmnThe active power of the line transmission between node m, n is represented, λ represents region capacity-load ratio, gnRepresent node n most
Big burden with power, WBRepresent the year purchase of electricity of power distribution network superior power network, PmnminRepresent having for the line transmission between node m, n
The work(lower limit of the power, PmnmaxThe active power upper limit of the line transmission between node m, n is represented, σ represents distributed power source installation appearance
Amount accounts for the ratio upper limit of power distribution network peak load.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710506987.8A CN107171324A (en) | 2017-06-28 | 2017-06-28 | A kind of power distribution network linear programming model containing distributed power source |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710506987.8A CN107171324A (en) | 2017-06-28 | 2017-06-28 | A kind of power distribution network linear programming model containing distributed power source |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN107171324A true CN107171324A (en) | 2017-09-15 |
Family
ID=59827772
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710506987.8A Pending CN107171324A (en) | 2017-06-28 | 2017-06-28 | A kind of power distribution network linear programming model containing distributed power source |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107171324A (en) |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108988325A (en) * | 2018-07-11 | 2018-12-11 | 华北电力大学 | A kind of distribution network planning method counted and distributed generation resource and electric car access |
| CN109193779A (en) * | 2018-10-17 | 2019-01-11 | 广东电网有限责任公司电力调度控制中心 | A kind of distributed wind-power generator maximum capacity appraisal procedure |
| CN110086208A (en) * | 2019-04-18 | 2019-08-02 | 新奥数能科技有限公司 | The equipment of integrated energy system regulates and controls method and device |
| CN110245799A (en) * | 2019-06-18 | 2019-09-17 | 国网江西省电力有限公司经济技术研究院 | Consider the multi-objective planning method of the Distribution Network Frame structural transition of load flexible demand |
| CN110503340A (en) * | 2019-08-27 | 2019-11-26 | 国网湖南省电力有限公司 | A kind of ant group algorithm and system of DC ice-melting sequence |
| CN112103945A (en) * | 2020-08-20 | 2020-12-18 | 南京工程学院 | Real-time scheduling method and storage medium for heat storage electric heating system in critical safety state of power grid |
| CN112686514A (en) * | 2020-12-23 | 2021-04-20 | 华北电力大学 | Comprehensive planning method for direct-current power distribution network |
-
2017
- 2017-06-28 CN CN201710506987.8A patent/CN107171324A/en active Pending
Cited By (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108988325A (en) * | 2018-07-11 | 2018-12-11 | 华北电力大学 | A kind of distribution network planning method counted and distributed generation resource and electric car access |
| CN108988325B (en) * | 2018-07-11 | 2020-05-15 | 国网能源研究院有限公司 | Power distribution network planning method considering distributed power supply and electric vehicle access |
| CN109193779A (en) * | 2018-10-17 | 2019-01-11 | 广东电网有限责任公司电力调度控制中心 | A kind of distributed wind-power generator maximum capacity appraisal procedure |
| CN109193779B (en) * | 2018-10-17 | 2021-09-21 | 广东电网有限责任公司电力调度控制中心 | Distributed wind power generation maximum capacity evaluation method |
| CN110086208A (en) * | 2019-04-18 | 2019-08-02 | 新奥数能科技有限公司 | The equipment of integrated energy system regulates and controls method and device |
| CN110086208B (en) * | 2019-04-18 | 2023-05-12 | 新奥数能科技有限公司 | Equipment regulation and control method and device for comprehensive energy system |
| CN110245799A (en) * | 2019-06-18 | 2019-09-17 | 国网江西省电力有限公司经济技术研究院 | Consider the multi-objective planning method of the Distribution Network Frame structural transition of load flexible demand |
| CN110503340A (en) * | 2019-08-27 | 2019-11-26 | 国网湖南省电力有限公司 | A kind of ant group algorithm and system of DC ice-melting sequence |
| CN112103945A (en) * | 2020-08-20 | 2020-12-18 | 南京工程学院 | Real-time scheduling method and storage medium for heat storage electric heating system in critical safety state of power grid |
| CN112686514A (en) * | 2020-12-23 | 2021-04-20 | 华北电力大学 | Comprehensive planning method for direct-current power distribution network |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107171324A (en) | A kind of power distribution network linear programming model containing distributed power source | |
| CN106684857B (en) | A kind of linearisation optimal load flow model containing THE UPFC | |
| CN108846507B (en) | Day-ahead economic dispatching method of electric-gas coupling system based on mixed integer second-order cone programming | |
| CN105449713B (en) | Consider the intelligent Sofe Switch planing method of active power distribution network of distributed power source characteristic | |
| CN111027807B (en) | Distributed power generation site selection and volume determination method based on tide linearization | |
| CN101252280B (en) | On-line evaluating method of urban network max power supply capability | |
| CN103400208B (en) | Power distribution network distributive power supply optimal access capacity determining method based on cone optimization | |
| CN106253335A (en) | A kind of distributed power source capacity and on-position uncertain distribution network planning method | |
| CN107979092A (en) | It is a kind of to consider distributed generation resource and the power distribution network dynamic reconfiguration method of Sofe Switch access | |
| CN107358337A (en) | A kind of active power distribution network planing method based on network reconfiguration | |
| CN109659973B (en) | Distributed power supply planning method based on improved direct current power flow algorithm | |
| CN102856899B (en) | Method of reducing network loss of micro power grid | |
| CN103280821A (en) | Multi-period dynamic reactive power optimization method of intelligent power distribution system | |
| CN103593711B (en) | A kind of distributed power source Optimal Configuration Method | |
| CN104318326A (en) | Net rack optimizing model for improving renewable energy source acceptance ability | |
| CN106886839A (en) | Hydro-Thermal Systems Unit Combination Optimization Scheduling based on mixed integer programming | |
| WO2024046098A1 (en) | Planning assistance method for electricity-gas coupled integrated energy system | |
| CN106803130A (en) | Distributed power source accesses the planing method of power distribution network | |
| CN101882785A (en) | Flow analysis system and method for intelligent power distribution networks containing distributed generation | |
| CN106779313A (en) | Multiple target distributed power source addressing constant volume method based on mixed integer programming | |
| CN103824124B (en) | A kind of energy potential evaluation method for grid company | |
| CN114977320A (en) | Power distribution network source-network charge-storage multi-target collaborative planning method | |
| CN107123983A (en) | A kind of transformer station's access scheme aided assessment method based on security domain | |
| Abass et al. | Methods comparison for optimal capacitor placement in distribution system | |
| Du et al. | Deep power forecasting model for building attached photovoltaic system |
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: 20170915 |
|
| RJ01 | Rejection of invention patent application after publication |