CN112686514A - Comprehensive planning method for direct-current power distribution network - Google Patents
Comprehensive planning method for direct-current power distribution network Download PDFInfo
- Publication number
- CN112686514A CN112686514A CN202011554965.7A CN202011554965A CN112686514A CN 112686514 A CN112686514 A CN 112686514A CN 202011554965 A CN202011554965 A CN 202011554965A CN 112686514 A CN112686514 A CN 112686514A
- Authority
- CN
- China
- Prior art keywords
- node
- distributed power
- power supply
- formula
- expanded
- 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
- 238000000034 method Methods 0.000 title claims abstract description 34
- 238000002347 injection Methods 0.000 claims abstract description 15
- 239000007924 injection Substances 0.000 claims abstract description 15
- 238000004422 calculation algorithm Methods 0.000 claims abstract description 11
- 230000035945 sensitivity Effects 0.000 claims abstract description 10
- 239000002245 particle Substances 0.000 claims description 24
- 239000011159 matrix material Substances 0.000 claims description 18
- 238000005457 optimization Methods 0.000 claims description 15
- 230000005611 electricity Effects 0.000 claims description 9
- 238000012423 maintenance Methods 0.000 claims description 9
- 239000013598 vector Substances 0.000 claims description 9
- 239000013256 coordination polymer Substances 0.000 claims description 6
- 230000001133 acceleration Effects 0.000 claims description 3
- 230000005484 gravity Effects 0.000 claims description 3
- 230000008569 process Effects 0.000 claims description 2
- NAWXUBYGYWOOIX-SFHVURJKSA-N (2s)-2-[[4-[2-(2,4-diaminoquinazolin-6-yl)ethyl]benzoyl]amino]-4-methylidenepentanedioic acid Chemical compound C1=CC2=NC(N)=NC(N)=C2C=C1CCC1=CC=C(C(=O)N[C@@H](CC(=C)C(O)=O)C(O)=O)C=C1 NAWXUBYGYWOOIX-SFHVURJKSA-N 0.000 claims 1
- 238000012163 sequencing technique Methods 0.000 claims 1
- 238000004364 calculation method Methods 0.000 abstract description 2
- 238000011161 development Methods 0.000 description 3
- 230000006978 adaptation Effects 0.000 description 2
- 238000010586 diagram Methods 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 238000004401 flow injection analysis Methods 0.000 description 2
- 238000012545 processing Methods 0.000 description 2
- 239000000243 solution Substances 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000008901 benefit Effects 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 238000006243 chemical reaction Methods 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 230000008878 coupling Effects 0.000 description 1
- 238000010168 coupling process Methods 0.000 description 1
- 238000005859 coupling reaction Methods 0.000 description 1
- 230000001419 dependent effect Effects 0.000 description 1
- 239000006185 dispersion Substances 0.000 description 1
- 238000004146 energy storage Methods 0.000 description 1
- 238000009434 installation Methods 0.000 description 1
- 230000009191 jumping Effects 0.000 description 1
- 238000007726 management method Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 238000004088 simulation Methods 0.000 description 1
- 230000009466 transformation Effects 0.000 description 1
Images
Landscapes
- Supply And Distribution Of Alternating Current (AREA)
Abstract
The method is a comprehensive planning method for the direct-current power distribution network, and the access of distributed power supplies in the direct-current power distribution network and the expansion of the circuit loop number are considered. Selecting alternative nodes to be accessed into the distributed power supply through pre-calculation, preferentially selecting nodes with high sensitivity as access nodes of the distributed power supply according to the sensitivity of node injection power to node voltage, taking the number, types and circuit expansion loop number of the accessed distributed power supply as variables, taking the lowest comprehensive annual cost as a target function, and solving an optimal configuration scheme through a wind-driven algorithm, wherein the objective function comprises direct current power flow constraint, AC-DC converter power flow constraint, node voltage constraint, node injection constraint, distributed power supply type constraint circuit power flow constraint and circuit expansion constraint.
Description
Technical Field
The invention belongs to the field of direct current power distribution network configuration optimization, and particularly relates to a direct current power distribution network comprehensive planning method.
Background
With economic development and social progress and continuous maturity of power electronic technology, new technologies such as distributed power supplies, energy storage devices and electric vehicles mainly based on renewable energy sources are more and more paid attention to by people; compared with an alternating-current power distribution network, when the new equipment of the power distribution system is connected to a direct-current power grid, a large number of current conversion links can be saved, the loss is reduced, and the economic benefit is improved; meanwhile, the direct-current power distribution network also has the characteristics of wide transmission radius, high electric energy quality, good stability and the like; therefore, the trend of the dc power distribution network as a future power distribution system is necessary to research its strategy for optimizing scheduling and configuration.
The traditional power distribution planning task is mainly to determine an expanded construction scheme of a future power distribution network according to the future load change condition and the topological structure of the existing network; after the distributed power sources are considered and taken into consideration, because the distributed power sources have the characteristics of randomness, flexibility in dispersion and various types, the traditional method for planning the power distribution system network is not applicable due to the fact that the power purchasing amount is increased by means of load capacity, the factors such as the types, input capacities and installation places of different distributed power sources and the coupling relation between the node voltage influence and line expansion of the accessed distributed power sources are considered in the planning management of the distribution network, and a decision scheme of comprehensive consideration is made in an economical optimal mode.
Disclosure of Invention
In order to solve the problems, the invention provides a direct current distribution network comprehensive planning method, which is characterized in that on the original planning of a known direct current distribution system, the type, the number and the expansion loop number of accessed distributed power supplies are taken as variables, nodes with high sensitivity are preferably selected as alternative nodes accessed to the distributed power supplies, and the minimum comprehensive cost is taken as a target function to establish direct current flow constraint, current converter flow constraint, node voltage constraint, node injection constraint, line flow constraint and loop expansion constraint of the system; and solving the optimal distributed power supply access number and the optimal line plan through a wind-driven algorithm.
In order to achieve the above object, the present invention provides a method for comprehensively planning a dc power distribution network, which comprises the following specific steps:
(1) inputting network parameters and equipment parameters;
in the step (1), the logged network parameters include: the number and type of each node, the resistance parameter, the maximum allowable power parameter, the AC-DC converter parameter and the DC-DC converter parameter of each branch.
(2) Calculating an access node of the preferred distributed power supply based on the flexibility and determining a variable;
in the step (2), the type and number of nodes to be connected to the DG and the lines to be expanded are preset according to the following method, and the number of expansion lines of each line is used as a variable of an optimization target.
x＝[xn xs xm]
In the formula, xnAnd xsNumber variable and type variable, x, for nodes accessing distributed power supply respectivelymAnd the number of the expanded loops of the line is variable.
Presetting a node set suitable for accessing a distributed power supply according to actual requirements; the specific method is that the system power flow is pre-calculated once before planning, the pre-calculated voltage per unit value of the node is U based on the lowest voltage per unit value of 0.95pniTo U withpniAnd the node set with the/0.95 less than 1.1 is used as an alternative distributed power supply access node set.
Flow injection equation by node i
In the formula, PiInjecting a current, U, into the nodeiIs the node voltage, Y0ijThe element values of the prior node admittance matrix are expanded. Can obtain UiFor PiSensitivity of (2):
and the alternative nodes are arranged in a descending order according to the sensitivity, and the node with high sensitivity is preferentially selected as the access node of the distributed power supply. The number variable expression of the distributed power supply accessed by the upper node is as follows:
xn＝[N1,...,Nn]
in the formula NiThe number of distributed power supplies accessed for the i node accessed by the node is n, and the number of the elements of the alternative distributed power supply access node set is n.
The type variable of the node connected to the distributed power supply is
xS＝[W1,V1,G1,...,Wn,Vn,Gn]
In the formula, Wi、Vi、GiThe distributed power type wind power parameter, the photovoltaic parameter and the gas turbine parameter are respectively connected to the i node.
The parameter value is a variable from 0 to 1, and when the parameter value is 1, the distributed power supply of the type is accessed, and when the parameter value is 0, the distributed power supply of the type is not accessed. Setting each preselected node to be directly connected to one type of distributed power supply, wherein the constraint conditions of the obtained type variables are as follows:
the number of the expanded loops of the line is variable as
xm＝[L1,...,Ln]
In the formula, LjThe number of expanded loops of the jth line is m, and the number of expanded lines of the system is m.
(3) And establishing an optimized objective function based on lowest annual comprehensive cost.
In the step (3), the expression of the minimum annual integrated cost is as follows:
min C＝CI+CM+CP
wherein C is the annual comprehensive planning cost, CI is the annual investment cost, CM is the annual maintenance cost, and CP is the annual electricity purchasing cost.
The annual investment cost is as follows:
in the formula, rdg,kAnd PkRespectively the depreciation rate and depreciation age limit of different distributed power supplies, subscript k is a distributed power supply type mark, SkFor a single capacity of different distributed power supplies, CkInvestment costs per unit capacity for different distributed power supplies, NiThe number of distributed power sources incorporated for that node. r islAnd q is the depreciation rate and depreciation age of the line, ClFor the investment cost of a line of unit length,. ljIs the length of the line, LjThe number of expanded loops for the line.
The annual maintenance cost is as follows:
in the formula, Co,kAnnual operating costs for unit capacity of different distributed power supplies, PDGK is the individual power of the different distributed power sources, Co,lAnnual maintenance costs per unit volume length of line, L0,jThe number of the established lines on the jth line.
The annual electricity purchasing cost is as follows:
in the formula, CeIs a unit price of electricity, PLiIs the load power of the ith node, Ploss,jIs the loss of the jth line.
(4) Determining optimized constraint conditions;
in the step (4), in addition to the aforementioned constraints, the method further includes direct current power flow constraints, AC-DC converter power flow constraints, node voltage constraints, node injection constraints, line power flow constraints and loop expansion constraints.
The direct current power flow constraint is as follows:
in the formula, Pgi、PLiAnd PDGiRespectively node injection, node load and distributed power supply injection of the ith node, and YIj is an expanded node admittance matrix.
The expanded node admittance matrix is related to an expanded loop number variable, and admittance vectors of the expanded branch are set as follows:
yb＝[(L1+L01)*y1,(L2+L02)*y2,...,(Lm+L0m)*ym]
in the formula, yj、L0jAnd LjThe number of branch admittance, original loop number and expanded loop number of the jth branch are respectively. Then an expanded node admittance matrix expression can be obtained:
Y＝ATybA
in the formula, Y is the expanded node admittance matrix, and A is the node-branch correlation matrix of the system.
The current constraint of the AC-DC converter is as follows:
in the formula of UsiIs the effective value of the network side alternating voltage deltasiAnd deltaciRespectively, a network side AC voltage phase angle and a converter side AC voltage phase angle, PsiAnd QsiActive and reactive power, G, respectively, injected into the AC sideciAnd BciRespectively the conductance and susceptance of the current converter; u shapediIs a DC voltage value, mu is a DC voltage utilization rate, and M is a modulation ratio.
The node voltage constraint is:
Umin≤Ui≤Umax
in the formula of UiIs the value of the node voltage, UminIs node electricityLower limit of allowable pressure, UmaxAn upper limit is allowed for the node voltage.
The node injection constraints are:
PGi+NiPDGi,k≤Pimax
in the formula PGiInjecting power, P, into the AC power supplyDGi,kIs unit distributed power supply injected power, NiFor distributed power supply, PimaxPower is injected for the maximum node.
The line power flow constraint is as follows:
Ui(Ui-Uj)(L0k+Lk)gij≤Pkmax i≠j
in the formula L0kIs the original number of loops, LkNumber of loops, g, for line developmentijFor line conductance, PkmaxMaximum power is allowed for the line.
The road expansion constraint is as follows:
0≤L0k+Lk≤Lkmax
in the formula LkmaxMaximizing loop number for line
(5) Solving the optimization model by adopting a wind-driven optimization algorithm; according to the step (5), solving by adopting a wind-driven optimization algorithm, wherein the specific flow is as follows:
firstly, setting a group scale and iteration times, and inputting relevant parameters including a friction coefficient alpha, a gravity acceleration vector g, an ideal gas parameter R, a temperature parameter T and a rotation angular velocity vector omega;
secondly, initializing an air particle set, randomly distributing the position and the speed of each particle, and defining a boundary and a pressure function (namely an objective function);
thirdly, calculating the pressure values of the air particles of the current iteration, and sorting the particles again according to the pressure values;
fourthly, updating the speed of air particles;
and fifthly, updating the position of the air particles:
and sixthly, judging whether a termination condition is reached, if so, finishing the operation, and if not, turning to the third step.
Compared with the prior art, the invention has the beneficial effects that:
1. when the distributed power supply access node is selected, the node with the lower voltage level is preferentially selected as the alternative node, and the alternative nodes are sequenced according to the sensitivity of the node voltage to the node injection power, so that the use efficiency of the distributed power supply is improved;
2. the method comprehensively considers the access planning and the line expansion planning of the distributed power supply of the direct-current power distribution network, so that the annual comprehensive cost under the condition of multiple constraints is minimum;
3. the core of the wind-driven optimization algorithm adopted by the method is based on the simulation of a simplified air particle stress motion model, and the update equation of the speed and the position of the air particle in each iteration is deduced by combining Newton's second law and an ideal gas state equation. The algorithm is simple, easy to implement, less in adjustable parameters, capable of effectively jumping out of local extrema to find out the optimal extremum, capable of processing multi-mode and multi-dimensional problems and capable of processing discrete problems.
Drawings
FIG. 1 shows the steps of the comprehensive planning of the DC distribution network implemented in the present invention
FIG. 2 is a schematic diagram of a DC distribution network structure referred to in the present invention
FIG. 3 is an equivalent circuit diagram of a pi branch of a DC-DC branch
FIG. 4 is a flow chart for optimization using a wind-driven algorithm
Detailed Description
Embodiments of the present invention will be further described with reference to the accompanying drawings.
As shown in fig. 1, the present invention provides a comprehensive planning method for a dc power distribution network, which comprises the following steps:
(1) inputting network parameters and equipment parameters;
(2) calculating an access node of the preferred distributed power supply based on the flexibility and determining a variable;
(3) establishing an optimized objective function based on the lowest annual comprehensive cost;
(4) determining optimized constraint conditions;
(5) and solving the optimization model by adopting a wind-driven optimization algorithm.
In the step (1), the logged network parameters include: the number and type of each node, the resistance parameter, the maximum allowable power parameter, the AC-DC converter parameter and the DC-DC converter parameter of each branch.
Taking the direct-current power distribution network shown in fig. 2 as an example, the grid structure comprises a plurality of AC-DC converters and DC-DC converters, the C-DC converters are used for connecting an alternating-current main network, a distributed power supply and an alternating-current load to the direct-current power distribution network, and the DC-DC converters are used for connecting direct-current power distribution networks with different voltage grades; the solid line represents the line to be expanded with the built line, and the dotted line represents the line to be expanded without the built line.
The DC-DC converter branch circuit can participate in the load flow calculation of the DC topology by being converted into a pi-type branch circuit as shown in FIG. 3, and each parameter of the pi-type branch circuit is calculated as follows:
wherein, yi0For equivalent start-to-ground admittance, yj0For equivalent end-to-ground admittance, yijFor equivalent branch admittance, N is the number of submodules of the DC-DC converter, D is the duty ratio of the trigger signal, M (D) is the equivalent transformation ratio related to the duty ratio and the converter type, REFor equivalent resistance dependent on the type and parameters of the converter, UEIs the pressure drop associated with the element parameter.
In the step (2), the type and number of nodes to be connected to the DG and the lines to be expanded are preset according to the following method, and the number of expansion lines of each line is used as a variable of an optimization target.
x＝[xn xs xm]
In the formula, xnAnd xsNumber variable and type variable, x, for nodes accessing distributed power supply respectivelymAnd the number of the expanded loops of the line is variable.
Presetting a node set suitable for accessing a distributed power supply according to actual requirements; the specific method is that the system power flow is pre-calculated once before planning, the pre-calculated voltage per unit value of the node is U based on the lowest voltage per unit value of 0.95pniTo U withpniAnd the node set with the/0.95 less than 1.1 is used as an alternative distributed power supply access node set.
Flow injection equation by node i
In the formula, PiInjecting a current, U, into the nodeiIs the node voltage, Y0ijThe element values of the prior node admittance matrix are expanded. Can obtain UiFor PiSensitivity of (2):
and the alternative nodes are arranged in a descending order according to the sensitivity, and the node with high sensitivity is preferentially selected as the access node of the distributed power supply. The number variable expression of the distributed power supply accessed by the upper node is as follows:
xn＝[N1,...,Nn]
in the formula NiThe number of distributed power supplies accessed for the i node accessed by the node is n, and the number of the elements of the alternative distributed power supply access node set is n.
The type variable of the node connected to the distributed power supply is
xS＝[W1,V1,G1,...,Wn,Vn,Gn]
In the formula, Wi、Vi、GiThe distributed power type wind power parameter, the photovoltaic parameter and the gas turbine parameter are respectively connected to the i node.
The parameter value is a variable from 0 to 1, and when the parameter value is 1, the distributed power supply of the type is accessed, and when the parameter value is 0, the distributed power supply of the type is not accessed. Setting each preselected node to be directly connected to one type of distributed power supply, wherein the constraint conditions of the obtained type variables are as follows:
the number of the expanded loops of the line is variable as
xm＝[L1,...,Ln]
In the formula, LjThe number of expanded loops of the jth line is m, and the number of expanded lines of the system is m.
In the step (3), the expression of the minimum annual integrated cost is as follows:
min C＝CI+CM+CP
wherein C is the annual comprehensive planning cost, CI is the annual investment cost, CM is the annual maintenance cost, and CP is the annual electricity purchasing cost.
The annual investment cost is as follows:
in the formula, rdg,kAnd PkRespectively the depreciation rate and depreciation age limit of different distributed power supplies, subscript k is a distributed power supply type mark, SkFor a single capacity of different distributed power supplies, CkInvestment costs per unit capacity for different distributed power supplies, NiThe number of distributed power sources incorporated for that node. r islAnd q is the depreciation rate and depreciation age of the line, ClFor the investment cost of a line of unit length,. ljIs the length of the line, LjThe number of expanded loops for the line.
The annual maintenance cost is as follows:
in the formula, Co,kFor different distribution of electricityAnnual operating cost of source unit capacity, PDG,kFor a single power of different distributed power sources, Co,lAnnual maintenance costs per unit volume length of line, L0,jThe number of the established lines on the jth line.
The annual electricity purchasing cost is as follows:
in the formula, CeIs a unit price of electricity, PLiIs the load power of the ith node, Ploss,jIs the loss of the jth line.
In the step (4), in addition to the aforementioned constraints, the method further includes direct current power flow constraints, AC-DC converter power flow constraints, node voltage constraints, node injection constraints, line power flow constraints and loop expansion constraints.
The direct current power flow constraint is as follows:
in the formula, Pgi、PLiAnd PDGiRespectively node injection, node load and distributed power supply injection of the ith node, and YIj is an expanded node admittance matrix.
The expanded node admittance matrix is related to an expanded loop number variable, and admittance vectors of the expanded branch are set as follows:
yb＝[(L1+L01)*y1,(L2+L02)*y2,...,(Lm+L0m)*ym]
in the formula, yj、L0jAnd LjThe number of branch admittance, original loop number and expanded loop number of the jth branch are respectively. Then an expanded node admittance matrix expression can be obtained:
Y＝ATybA
in the formula, Y is the expanded node admittance matrix, and A is the node-branch correlation matrix of the system.
The current constraint of the AC-DC converter is as follows:
in the formula of UsiIs the effective value of the network side alternating voltage deltasiAnd deltaciRespectively, a network side AC voltage phase angle and a converter side AC voltage phase angle, PsiAnd QsiActive and reactive power, G, respectively, injected into the AC sideciAnd BciRespectively the conductance and susceptance of the current converter; u shapediIs a DC voltage value, mu is a DC voltage utilization rate, and M is a modulation ratio.
The node voltage constraint is:
Umin≤Ui≤Umax
in the formula of UiIs the value of the node voltage, UminFor the lower limit of the node voltage allowance, UmaxAn upper limit is allowed for the node voltage.
The node injection constraints are:
PGi+NiPDGi,k≤Pimax
in the formula PGiInjecting power, P, into the AC power supplyDGi,kIs unit distributed power supply injected power, NiFor distributed power supply, PimaxPower is injected for the maximum node.
The line power flow constraint is as follows:
Ui(Ui-Uj)(L0k+Lk)gij≤Pkmax i≠j
in the formula L0kIs the original number of loops, LkNumber of loops, g, for line developmentijFor line conductance, PkmaxMaximum power is allowed for the line.
The road expansion constraint is as follows:
0≤L0k+Lk≤Lkmax
in the formula LkmaxMaximizing loop number for line
According to said step (5) of the method,
the solving process of the wind-driven optimization algorithm is shown in fig. 4, and the specific flow is as follows:
firstly, setting a group scale and iteration times, and inputting relevant parameters including a friction coefficient alpha, a gravity acceleration vector g, an ideal gas parameter R, a temperature parameter T and a rotation angular velocity vector omega;
secondly, initializing an air particle set, randomly distributing the position and the speed of each particle, and defining a boundary and a pressure function (namely an objective function);
thirdly, calculating the pressure values of the air particles of the current iteration, and sorting the particles again according to the pressure values;
fourthly, updating the speed of the air particle according to the following formula:
in the formula vcurAnd vnewCurrent iteration air particle velocity and updated air particle velocity, x, respectivelycurAnd xoptCurrent air particle position and historically optimal air particle position, PcurAnd PoptRespectively, a current pressure adaptation value and a historical optimal pressure adaptation value.
And fifthly, updating the position of the air particle according to the following formula:
xnew＝xcur+unewΔt
for the sake of easy solution, Δ t is generally set to 1.
And sixthly, judging whether a termination condition is reached, if so, finishing the operation, and if not, turning to the third step.
Finally, it should be noted that the above-mentioned contents are only examples of the technical implementation of the present invention and are not limiting. Modifications and equivalents of the technical solution described in the present invention should be included in the scope of the present invention.
Claims (10)
1. A comprehensive planning method for a direct current distribution network is characterized by comprising the following steps: the method comprises the following steps:
(1) inputting network parameters and equipment parameters;
(2) calculating an access node of the preferred distributed power supply based on the flexibility and determining a variable;
(3) establishing an optimized objective function based on the lowest annual comprehensive cost;
(4) determining optimized constraint conditions;
(5) and solving the optimization model by adopting a wind-driven optimization algorithm.
2. The comprehensive planning method for comprehensively considering the direct-current distribution network according to claim 1, characterized in that: in the step (1), the logged network parameters include: the number and type of each node, the resistance parameters of each branch, the parameters of each AC-DC converter and the parameters of the DC-DC converter.
3. The method for comprehensively planning the direct-current power distribution network according to claim 1, characterized in that: in the step (2), the type and number of nodes to be connected to the DG and the lines to be expanded, which are connected to the distributed power supply, are preset according to the following method, and the number of expansion lines of each line is used as a variable of an optimization target
x＝[xn xs xm] (1)
In the formula, xnAnd xsNumber variable and type variable, x, for nodes accessing distributed power supply respectivelymAnd the number of the expanded loops of the line is variable.
4. The comprehensive planning method for comprehensively considering the direct-current distribution network according to claim 3, characterized in that: a node set suitable for accessing the distributed power supply is preset according to actual requirements. The specific method is that the system power flow is pre-calculated once before planning, and the lowest voltage is usedThe per unit value of 0.95 is the reference, and the pre-calculated voltage per unit value of the node is UpniTo U withpniAnd the node set with the/0.95 less than 1.1 is used as an alternative distributed power supply access node set.
Injecting an equation by the power flow of node i:
in the formula, PiInjecting a current, U, into the nodeiIs the node voltage, Y0ijThe element values of the prior node admittance matrix are expanded. Formula (2) can obtain UiFor PiSensitivity of (2):
and the alternative nodes are arranged in a descending order according to the sensitivity, and the node with high sensitivity is preferentially selected as the access node of the distributed power supply. The number variable expression of the distributed power supply accessed by the upper node is as follows:
xn＝[N1,...,Nn] (4)
in the formula NiThe number of distributed power supplies accessed for the i node accessed by the node is n, and the number of the elements of the alternative distributed power supply access node set is n.
5. The comprehensive planning method for comprehensively considering the direct-current distribution network according to claim 3, characterized in that: the type variable of the node connected to the distributed power supply is
xS＝[W1,V1,G1,...,Wn,Vn,Gn] (5)
In the formula, Wi、Vi、GiThe distributed power type wind power parameter, the photovoltaic parameter and the gas turbine parameter are respectively connected to the i node. The parameter value is a variable from 0 to 1, and when the parameter value is 1, the distributed power supply of the type is connected, and when the parameter value is 0, the distributed power supply is not connectedInto this type of distributed power supply. Setting each preselected node to be directly connected to one type of distributed power supply, wherein the constraint conditions of the obtained type variables are as follows:
6. the comprehensive planning method for comprehensively considering the direct-current distribution network according to claim 3, characterized in that: the number of the expanded loops of the line is variable as
xm＝[L1,...,Ln] (7)
In the formula, LjThe number of expanded loops of the jth line is m, and the number of expanded lines of the system is m.
7. The comprehensive planning method for comprehensively considering the direct-current distribution network according to claim 1, characterized in that: in the step (3), an optimization model is established by taking the annual comprehensive planning cost as the minimum as an objective function, wherein the objective function is
min C＝CI+CM+CP (8)
Wherein C is the annual comprehensive planning cost, CI is the annual investment cost, CM is the annual maintenance cost, and CP is the annual electricity purchasing cost.
The annual investment cost is as follows:
in the formula (9), rdg,kAnd PkRespectively the depreciation rate and depreciation age limit of different distributed power supplies, subscript k is a distributed power supply type mark, SkFor a single capacity of different distributed power supplies, CkInvestment costs per unit capacity for different distributed power supplies, NiThe number of distributed power sources incorporated for that node. r islAnd q is the depreciation rate and depreciation age of the line, ClFor the investment cost of a line of unit length,. ljIs the length of the line, LjThe number of expanded loops for the line.
The annual maintenance cost is as follows:
in the formula (10), Co,kAnnual operating costs for unit capacity of different distributed power supplies, PDG,kFor a single power of different distributed power sources, Co,lAnnual maintenance costs per unit volume length of line, L0,jThe number of the established lines on the jth line.
The annual electricity purchasing cost is as follows:
in the formula (11), CeIs a unit price of electricity, PLiIs the load power of the ith node, Ploss,jIs the loss of the jth line.
8. The comprehensive planning method for comprehensively considering the direct-current distribution network according to claim 1, characterized in that: in the step (4), in addition to the aforementioned constraints, the method further includes direct current power flow constraints, AC-DC converter power flow constraints, node voltage constraints, node injection constraints, line power flow constraints and loop expansion constraints.
9. The comprehensive planning method for comprehensively considering the direct-current distribution network according to claim 8, characterized in that: the DC power flow is constrained as follows
In the formula, Pgi、PLiAnd PDGiRespectively node injection, node load and distributed power supply injection of the ith node, and YIj is an expanded node admittance matrix. After expansionThe node admittance matrix is related to the number variable of the expanded loop, and the admittance vector of the branch after expansion is set as:
yb＝[(L1+L01)*y1,(L2+L02)*y2,...,(Lm+L0m)*ym] (13)
in the formula, yj、L0jAnd LjThe number of branch admittance, original loop number and expanded loop number of the jth branch are respectively. The expanded node admittance matrix expression can be obtained
Y＝ATybA (14)
In the formula, Y is the expanded node admittance matrix, and A is the node-branch correlation matrix of the system.
10. The comprehensive planning method for comprehensively considering the direct-current distribution network according to claim 1, characterized in that: in the step (5), a Wind Driven algorithm (WDO) is adopted for solving, and the solving process is as follows:
1) setting a group scale and iteration times, and inputting relevant parameters including a friction coefficient alpha, a gravity acceleration vector g, an ideal gas parameter R, a temperature parameter T and a rotation angular velocity vector omega;
2) initializing an air particle set, randomly distributing the position and the speed of each particle, and defining a boundary and a pressure function;
3) calculating the pressure value (namely fitness) of the air particles of the current iteration, and sequencing the particles again according to the pressure value;
4) updating the velocity of air particles;
5) updating the position of the air particles;
6) and judging whether a termination condition is reached, if so, finishing the operation, and if not, turning to the step 3.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011554965.7A CN112686514A (en) | 2020-12-23 | 2020-12-23 | Comprehensive planning method for direct-current power distribution network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011554965.7A CN112686514A (en) | 2020-12-23 | 2020-12-23 | Comprehensive planning method for direct-current power distribution network |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN112686514A true CN112686514A (en) | 2021-04-20 |
Family
ID=75453016
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011554965.7A Pending CN112686514A (en) | 2020-12-23 | 2020-12-23 | Comprehensive planning method for direct-current power distribution network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112686514A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2022242020A1 (en) * | 2021-05-20 | 2022-11-24 | 南瑞集团有限公司 | Method and system for optimizing direct current transmission limit within planning period |
Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102903016A (en) * | 2012-09-28 | 2013-01-30 | 南方电网科学研究院有限责任公司 | Distributed power generation planning method |
| CN103514570A (en) * | 2013-08-14 | 2014-01-15 | 国家电网公司 | Expansion planning comprehensive optimization method of power distribution network with distributed power supply |
| CN104376410A (en) * | 2014-11-06 | 2015-02-25 | 国家电网公司 | Planning method for distributed power source in power distribution network |
| CN107171324A (en) * | 2017-06-28 | 2017-09-15 | 国网河北省电力公司经济技术研究院 | A kind of power distribution network linear programming model containing distributed power source |
| CN109256768A (en) * | 2018-09-26 | 2019-01-22 | 云南电网有限责任公司电力科学研究院 | A kind of power distribution network optimal load flow algorithm based on Semidefinite Programming |
| CN109523303A (en) * | 2018-10-21 | 2019-03-26 | 天津大学 | A kind of low-voltage active power distribution network congestion management method based on deploying node |
| CN109659973A (en) * | 2018-11-28 | 2019-04-19 | 河海大学 | A kind of distributed generation resource planing method based on modified DC power flow algorithm |
| CN109787211A (en) * | 2018-12-28 | 2019-05-21 | 中国电力科学研究院有限公司 | A kind of Multi-port direct-current distribution network tidal current computing method and system based on VSC |
| CN110991727A (en) * | 2019-11-28 | 2020-04-10 | 海南电网有限责任公司 | Power grid planning method based on power flow network loss model and line constraint model |
| CN111799800A (en) * | 2020-07-21 | 2020-10-20 | 国网上海市电力公司 | AC-DC hybrid power distribution network load flow calculation method |
-
2020
- 2020-12-23 CN CN202011554965.7A patent/CN112686514A/en active Pending
Patent Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102903016A (en) * | 2012-09-28 | 2013-01-30 | 南方电网科学研究院有限责任公司 | Distributed power generation planning method |
| CN103514570A (en) * | 2013-08-14 | 2014-01-15 | 国家电网公司 | Expansion planning comprehensive optimization method of power distribution network with distributed power supply |
| CN104376410A (en) * | 2014-11-06 | 2015-02-25 | 国家电网公司 | Planning method for distributed power source in power distribution network |
| CN107171324A (en) * | 2017-06-28 | 2017-09-15 | 国网河北省电力公司经济技术研究院 | A kind of power distribution network linear programming model containing distributed power source |
| CN109256768A (en) * | 2018-09-26 | 2019-01-22 | 云南电网有限责任公司电力科学研究院 | A kind of power distribution network optimal load flow algorithm based on Semidefinite Programming |
| CN109523303A (en) * | 2018-10-21 | 2019-03-26 | 天津大学 | A kind of low-voltage active power distribution network congestion management method based on deploying node |
| CN109659973A (en) * | 2018-11-28 | 2019-04-19 | 河海大学 | A kind of distributed generation resource planing method based on modified DC power flow algorithm |
| CN109787211A (en) * | 2018-12-28 | 2019-05-21 | 中国电力科学研究院有限公司 | A kind of Multi-port direct-current distribution network tidal current computing method and system based on VSC |
| CN110991727A (en) * | 2019-11-28 | 2020-04-10 | 海南电网有限责任公司 | Power grid planning method based on power flow network loss model and line constraint model |
| CN111799800A (en) * | 2020-07-21 | 2020-10-20 | 国网上海市电力公司 | AC-DC hybrid power distribution network load flow calculation method |
Non-Patent Citations (17)
| Title |
|---|
| 任龙霞;雷金勇;甘德强;: "计及配电网节点/支路边际容量成本的分布式电源规划", 电力***自动化, no. 21 * |
| 冯俊杰;张晓辉;范学强;张志飞;闫鹏达;付佳斌;郭兴;: "直流配电网络运行优化研究", 电力科学与工程, no. 07 * |
| 刘飞;熊晓琪;查鹏程;黄鹤鸣;夏琦;余滢婷;黎雄;: "直流配电网网架结构与分布式光伏多目标协同优化", 中国电机工程学报, no. 12 * |
| 叶学顺，刘科研，孟晓丽: "含分布式电源的交直流混合配电网潮流计算", 《供用电》 * |
| 朱曈彤，顾洁，金之俭，储琳琳，张宇俊: "规划与运行整合的配电网无功补偿智能协调配置", 《电力自动化设备》, vol. 39, no. 2 * |
| 李永刚;韩冰;刘天皓;: "分布式能源接入直流配网的潮流优化", 华北电力大学学报(自然科学版), no. 02 * |
| 李珂;邰能灵;张沈习;陈曦;: "考虑相关性的分布式电源多目标规划方法", 电力***自动化, no. 09 * |
| 李霞林;郭力;王成山;李运帷;: "直流微电网关键技术研究综述", 中国电机工程学报, no. 01 * |
| 蒋贤强;徐青山;柳丹;袁晓冬;***;: "含分布式电源的交直流配网双层规划研究", 电力工程技术, no. 04 * |
| 许伟龙: "基于量子粒子群算法的含分布式电源的配网规划", 《中国优秀硕士学位论文全文数据库 工程科技II辑》, no. 10 * |
| 赵冠琨;: "直流配电网潮流计算模型及算法", 电力建设, no. 05 * |
| 赵波 等: "一种计及柔性直流环节接入的配电网优化重构策略", 电气应用, no. 11 * |
| 邵华，贺春光，安佳坤，韩文源，翟广心: "基于线性约束的有源配电网规划研究", 《电力科学与技术学报》, vol. 35, no. 5 * |
| 邵华;贺春光;安佳坤;韩文源;翟广心;: "基于线性约束的有源配电网规划研究", 电力科学与技术学报, no. 05 * |
| 鄂霖，马振，肖宇，朱永强: "直流配电网的三点估计概率潮流计算方法", 《分布式能源》, vol. 6, no. 3 * |
| 陈思佳: "配电网优化运行与分布式电源接纳能力研究", 《中国优秀博士学位论文全文数据库 工程科技II辑》, no. 12 * |
| 马骏超;江全元;余鹏;段绍辉;: "直流配电网能量优化控制技术综述", 电力***自动化, no. 24 * |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2022242020A1 (en) * | 2021-05-20 | 2022-11-24 | 南瑞集团有限公司 | Method and system for optimizing direct current transmission limit within planning period |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110460036B (en) | Distributed optimization method for alternating current-direct current power distribution network considering wind power uncertainty | |
| CN105244869B (en) | A kind of power distribution network dynamic random dispatch control method containing microgrid | |
| CN112039079B (en) | Configuration method of energy storage optimization system of active power distribution network considering voltage safety | |
| CN110266038A (en) | A kind of more virtual plant distributed coordination regulation methods | |
| Reddy et al. | 2Index and GA based optimal location and sizing of distribution system capacitors | |
| CN112380694B (en) | Power distribution network optimization planning method based on differential reliability requirements | |
| CN110620383B (en) | Day-ahead optimal scheduling method for AC/DC power distribution network based on power electronic transformer | |
| CN110808597A (en) | Distributed power supply planning method considering three-phase imbalance in active power distribution network | |
| CN107968430A (en) | Consider the defeated collaboration stochastic programming method of storage of wind-storage association system probabilistic model | |
| CN110165666A (en) | A kind of active distribution network dispatching method based on IGDT | |
| CN111884203B (en) | Micro-grid coordination optimization configuration method based on double-layer non-dominated sorting genetic algorithm | |
| CN108039741B (en) | Alternating current-direct current hybrid micro-grid optimized operation method considering micro-source residual electricity on-line | |
| CN110943465B (en) | Energy storage system site selection and volume fixing optimization method | |
| CN112561273A (en) | Active power distribution network renewable DG planning method based on improved PSO | |
| CN109383323A (en) | A kind of charge and discharge optimal control method of electric car group | |
| CN112686514A (en) | Comprehensive planning method for direct-current power distribution network | |
| CN109149658B (en) | Independent micro-grid distributed dynamic economic dispatching method based on consistency theory | |
| CN111242389A (en) | Intelligent energy storage soft switch planning method, system, equipment and medium | |
| CN105552929B (en) | The idle work optimization method of ac and dc systems based on Genetic Simulated Annealing Algorithm | |
| Nafar | PSO based optimal placement of DGs in distribution systems considering voltage stability and short circuit level improvement | |
| CN107069703B (en) | AC/DC distribution network planning method considering new energy access | |
| CN116645089A (en) | Energy storage system double-layer optimal configuration method considering capacity degradation of retired battery | |
| CN107104429B (en) | power system load scheduling method considering distributed energy storage system | |
| CN115693797A (en) | Power distribution network scheduling method, medium and system considering V2G and demand response | |
| CN115345350A (en) | Alternating current-direct current hybrid power distribution network planning method, medium and 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 |