CN107301482A - A kind of power distribution network medium-voltage line paths planning method based on city integrated piping lane - Google Patents
A kind of power distribution network medium-voltage line paths planning method based on city integrated piping lane Download PDFInfo
- Publication number
- CN107301482A CN107301482A CN201710682952.XA CN201710682952A CN107301482A CN 107301482 A CN107301482 A CN 107301482A CN 201710682952 A CN201710682952 A CN 201710682952A CN 107301482 A CN107301482 A CN 107301482A
- Authority
- CN
- China
- Prior art keywords
- cable
- planning
- path
- msub
- summit
- 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
- 238000013439 planning Methods 0.000 title claims abstract description 71
- 238000000034 method Methods 0.000 title claims abstract description 56
- 238000010276 construction Methods 0.000 claims abstract description 19
- 230000005611 electricity Effects 0.000 claims description 14
- 238000012423 maintenance Methods 0.000 claims description 9
- 239000000463 material Substances 0.000 claims description 9
- 238000011161 development Methods 0.000 claims description 8
- 238000013507 mapping Methods 0.000 claims description 6
- 238000012986 modification Methods 0.000 claims description 5
- 230000004048 modification Effects 0.000 claims description 5
- 238000004364 calculation method Methods 0.000 claims description 4
- 230000005540 biological transmission Effects 0.000 claims description 3
- 230000008569 process Effects 0.000 claims description 3
- 238000013316 zoning Methods 0.000 claims description 3
- 238000000205 computational method Methods 0.000 claims description 2
- 238000005192 partition Methods 0.000 claims 1
- 230000000694 effects Effects 0.000 abstract description 6
- 238000013459 approach Methods 0.000 abstract description 4
- 238000010586 diagram Methods 0.000 description 3
- 238000005516 engineering process Methods 0.000 description 3
- 238000009412 basement excavation Methods 0.000 description 2
- 230000010354 integration Effects 0.000 description 2
- 230000003993 interaction Effects 0.000 description 2
- 238000010606 normalization Methods 0.000 description 2
- 238000005457 optimization Methods 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000015572 biosynthetic process Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 239000004744 fabric Substances 0.000 description 1
- 238000009440 infrastructure construction Methods 0.000 description 1
- 238000009434 installation Methods 0.000 description 1
- 238000007726 management method Methods 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 238000005728 strengthening Methods 0.000 description 1
- 230000001360 synchronised effect Effects 0.000 description 1
- 238000012549 training Methods 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
- G06Q10/047—Optimisation of routes or paths, e.g. travelling salesman 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
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
- G06Q10/06313—Resource planning in a project environment
-
- 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/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/067—Enterprise or organisation modelling
-
- 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
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y04—INFORMATION OR COMMUNICATION TECHNOLOGIES HAVING AN IMPACT ON OTHER TECHNOLOGY AREAS
- Y04S—SYSTEMS INTEGRATING TECHNOLOGIES RELATED TO POWER NETWORK OPERATION, COMMUNICATION OR INFORMATION TECHNOLOGIES FOR IMPROVING THE ELECTRICAL POWER GENERATION, TRANSMISSION, DISTRIBUTION, MANAGEMENT OR USAGE, i.e. SMART GRIDS
- Y04S10/00—Systems supporting electrical power generation, transmission or distribution
- Y04S10/50—Systems or methods supporting the power network operation or management, involving a certain degree of interaction with the load-side end user applications
Landscapes
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Engineering & Computer Science (AREA)
- Strategic Management (AREA)
- Economics (AREA)
- Entrepreneurship & Innovation (AREA)
- Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Marketing (AREA)
- General Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- Tourism & Hospitality (AREA)
- Development Economics (AREA)
- Quality & Reliability (AREA)
- Operations Research (AREA)
- Game Theory and Decision Science (AREA)
- Educational Administration (AREA)
- Health & Medical Sciences (AREA)
- Biodiversity & Conservation Biology (AREA)
- Life Sciences & Earth Sciences (AREA)
- Public Health (AREA)
- Water Supply & Treatment (AREA)
- General Health & Medical Sciences (AREA)
- Primary Health Care (AREA)
- Supply And Distribution Of Alternating Current (AREA)
Abstract
The invention discloses a kind of power distribution network medium-voltage line paths planning method based on city integrated piping lane, belong to distribution network planning technical field, mainly including step, S1 sets up medium-voltage line power supply plan region；S2 sets up medium-voltage line path planning model；S3 is based on dijkstra's algorithm and optimizes line route, and S4 is based on increment critical path method (CPM) and completes circuit contact.By setting up distribution network planning medium-voltage line path planning model under the pipe gallery construction background of Urban New District, path planning is divided into two steps：Power supply grid is preliminarily formed first with critical path method (CPM), and optimal, completion basic routing line planning is realized in grid inner cable path；Circuit contact is completed based on increment critical path method (CPM) again, compared to heuritic approach, this method has clear concept, and calculating speed is fast, the characteristics of planning effect is good.Power distribution network medium-voltage line after planning is not only adapted to the situation for having city integrated piping lane to build, and comprehensive method of investment expense is minimum, and cable trace is most short.
Description
Technical field
The present invention relates to distribution network planning technical field, more specifically, it relates to a kind of based on city integrated piping lane
Power distribution network medium-voltage line paths planning method.
Background technology
2013, State Council put into effect《Opinion on strengthening urban infrastructure construction》, propose with 3 years or so time
Start underground pipe gallery pilot project in 36, whole nation big and medium-sized cities, other small and medium-sized cities suit measures to local conditions to build a collection of integrated pipe
Corridor project.Meanwhile, country encourages newly-built road, Urban New District and all kinds of garden underground pipe networks to be developed by pipe gallery pattern
Build.Nearly 2 years, State Council and live to build the national ministries and commissions such as portion, the Ministry of Finance, National Energy Board and put into effect successively on in-depth
The related guidance opinion that city integrated piping lane is built, each experimental city and other Urban New District satisfied the requirements, development zones etc. are comprehensive
Close piping lane implementation management and technology is increasingly ripe, underground pipe gallery scale is increasingly huge.
The medium voltage power lines of Urban New District are based on cable at this stage, and it is empty that traditional overhead cabling method takes underground
Between it is more and relatively mixed and disorderly, when newly-increased load sets up pipeline or cable maintenance, the excavation repeatedly of road can be caused.Underground pipe gallery
Operating mode good in more power cable, intensive utilization space, piping lane, which can be stored, is easy to the operation maintenance of cable and later stage to change
Build, extend, power cable includes Urban Underground pipe gallery, and to be that science is feasible be also very important.
However, city integrated piping lane, which is built to work to distribution network planning, proposes new thinking and requirement：On the one hand, integrated pipe
Corridor planning will rely on power cable passage to plan in layout, and electric power storehouse will meet the technical requirements of cable, optimization pipe in piping lane
Corridor section arrangement；On the other hand, power cable passage planning reasonable integration should also return on the basis of the programming and distribution of pipe gallery
And channel resource, the intensive utilization underground space and underground pipe gallery are planned to form good interaction.Above-mentioned line route is planned
The important step of distribution network planning, plans same when current method is most of by line route planning and power distribution network topological structure
Step is carried out, and based on heuritic approach, it is ensured that the normalization and expansibility of distribution net work structure, but line route is not necessarily
It can be optimal, also the uncomfortable situation that should have city integrated piping lane to build, needs to be proposed more novel effective method.
The content of the invention
It can not necessarily be optimal for city integrated piping lane power distribution network medium-voltage line path planning in practice, i.e.,
This problem of investment cost minimum.The characteristics of present invention is built based on Urban New District pipe gallery, with reference to distribution net gridding rule
The requirement drawn, proposes a kind of power distribution network medium-voltage line paths planning method based on city integrated piping lane, with year comprehensive method of investment expense
Minimum object function is used, cable run shortest path, Optimizing City new district electric power facility cloth are solved using dijkstra's algorithm
Office, guiding power grid construction scientific order is carried out.
The solution of the present invention：Power distribution network medium-voltage line paths planning method based on city integrated piping lane, this method
Comprise the following steps：
S1, sets up medium-voltage line power supply plan region；
S2, sets up medium-voltage line path planning model, including,
S21, sets target function,
It is minimum as the object of planning using year comprehensive method of investment expense f (x), (contain civil engineering costs and electricity including cable constructions investment
Cable Master Cost), annual operating cost and loss：
Section 1 is that year fixed investment and year operation and maintenance expenses are used on the right of equation, and its middle aged operation and maintenance expenses takes the folding of year fixed investment necessarily
Coefficient m is calculated, using " present worth coming year method ", total expense is converted to the construction cost in annual,It is worth for year
Coefficient, wherein r0For power industry investment yield, n is the Economic Life of electrical equipment, DiFor the branch road for thering is cable to pass through
Set, xiFor the length of every section of branch road,For the cable passage unit length cost of different overhead cabling methods；For
Cable material expense in branch road i, LCFor selected cable unit length cost, k is the cable loop number in branch road i；
Section 2 is cost of losses on the right of equation, and λ is total rate of electricity；ΔPjiFor the active loss of the branch road i in passage path j,PjiFor all power sums (in the case of maximum load) in the j of path by branch road i, UiIt is first for branch road i
Terminal voltage, takes average rated voltage herein, and ρ is the unitary resistance value of selected cable；τmaxFor number of working hours based on maximum load.
S22, sets constraints,
A, open loop power constraint,
Using the double circuit power supply pattern such as power supply-switchyard, the condition is met when forming supply path；
B, cable capacity constraint,
Flow through the power P of every section of branch cablejiLess than limit value Pji(lim), i.e.,：
Pji≤Pji(lim), j=1,2 ..., Dj；I=1,2 ..., Di (2)
C, the constraint of cabling feeder number,
On every branch road, using different overhead cabling methods, its cable bar number niIt must not exceed pipe gallery electric power storehouse or electricity
The upper limit N of cable comb scalei(max)：
0≤ni≤Ni(max) (3)
D, transformer station's outlet number constraint,
The outlet number m of each transformer stationbThe outlet number limit value m allowed less than or equal to transformer stationb(max), i.e.,
0≤mb≤mb(max) (4)
E, radius of electricity supply constraint,
The radius of electricity supply of transformer station is considered when setting up and forming planning region, it is ensured that power supply of all switchyard loads in transformer station
In radius；
S3, line route is optimized based on dijkstra's algorithm,
According to the transformer station in the planning region and the distribution of load point, figure G=(V, E) is set up, it is one to make G=(V, E)
Individual Weighted Directed Graph, above-mentioned Weighted Directed Graph is made up of set V and E, and wherein V is being made up of limited summit for non-NULL
Vertex set, E is then the set of paths to being constituted by summit, and above-mentioned summit is to being also known as side (Edge), i.e. path；By in figure
Vertex set V be divided into two groups, first group is the vertex set S for having obtained shortest path, only active in vertex set S when initial
Node, often tries to achieve a shortest path later, and just its corresponding summit is added in vertex set S, until whole summits all
It is added in vertex set S；Second group is the vertex set U for not determining shortest path, in adition process, total to keep from source section
The shortest path length on each summit is not more than from source node v to vertex set U that any summit is most in point v to vertex set S
Short path length；
The calculation procedure of dijkstra's algorithm is as follows：
S31, during initialization, above-mentioned vertex set S is containing only active node；
S32, chooses one in summit k addition vertex sets S minimum v, the selected distance is exactly from vertex set U
V to k shortest path length；
S33, using k as the intermediate point newly considered, changes the distance on each summit in vertex set U；If from source node v to summit u's
(by summit k), than original distance, (, then modification summit u distance value short without summit k), amended distance value is distance
Summit k distance adds k to u distance；
S34, repeat step S32 and S33, until all summits are included in vertex set S.
Further, described to set up medium-voltage line power supply plan region in the step S1, specific steps include：
S11, according to Urban New District total arrangement, some functional areas are divided into by Urban New District by street river etc.；
S12, is divided into Development control area unit by the function zoning according to land character, i.e., is used as construction using the grid that road network is formed
Development block；
S13, planning region internal loading is counted in units of the grid, and medium voltage distribution network is constituted is with Switching Station (looped network room)
The medium voltage distribution network bulk transmission grid of node.
Further, the idiographic flow for setting up figure G=(V, E) includes,
By the transformer station in planning region and load point when the summit of mapping, the cable duct that pipe gallery will be planned or may be excavated
The infall in corridor is referred to as crosspoint, and summit and crosspoint are referred to as into node, conduit line will may be excavated between each node
Corridor be referred to as path, by the path using summit as end points when mapping side, by the construction cost of circuit on each paths and side
The side and power of (including line material expense and operating expenses) respectively as each paths, the power of each paths are represented with w, with this
Distribution network planning domain is converted into a weighted graph G=(V, E), wherein V and E represent the collection on all summits and side in figure respectively
Close.
Further, when newly-increased path and when improving path, the computational methods of each paths weights are,
The weights in path are to increase newly after a switchyard load, and each branch road expense in network, to branch road i, can be expressed as：
Wi=Wfi+Wli (5)
WfiFor cable investment comprehensive cost, including cable passage construction cost WDiWith cable material investment cost WCi, WliFor net
Damage expense, is calculated referring to formula (1).
The beneficial effect of technical solution of the present invention at least includes：
Delimit after planning region, each planning region is matched somebody with somebody in latticed by setting up under the pipe gallery construction background of Urban New District
Electric Power Network Planning medium-voltage line path planning model, is divided into two steps by path planning：Confession is preliminarily formed first with critical path method (CPM)
Power grid, and optimal, completion basic routing line planning is realized in grid inner cable path；Circuit is completed based on increment critical path method (CPM) again
Contact, compared to heuritic approach, this method has clear concept, and calculating speed is fast, the characteristics of planning effect is good.Matching somebody with somebody after planning
Power network medium-voltage line is not only adapted to the situation for having city integrated piping lane to build, and comprehensive method of investment expense is minimum, cable trace
It is most short.
Brief description of the drawings
Fig. 1 is the schematic flow sheet of the power distribution network medium-voltage line paths planning method based on city integrated piping lane；
Fig. 2 is the calculation procedure flow chart of dijkstra's algorithm in technical solution of the present invention；
Fig. 3 sets up the step flow chart in medium-voltage line power supply plan region for the present invention；
Fig. 4 is that distribution net gridding plans geographical schematic；
Fig. 5 is that distribution net gridding plans electrical schematics；
Fig. 6 is to realize the optimal flow chart in power distribution network grid inner cable path using critical path method (CPM)；
Fig. 7 is the contact path that each power supply network compartment is determined using increment shortest path first, algorithm flow chart；
Fig. 8 is the planning chart of pipe gallery in case city；
Fig. 9 is that power distribution network is powered grid chart in case city；
Figure 10 is distribution network planning result figure in case city；
Figure 11 is midium voltage cable line route program results schematic diagram.
Embodiment
The medium-voltage line system of laying occupancy underground space of current Urban New District is more and relatively mixed and disorderly, and newly-increased load sets up pipe
When road or cable maintenance, the excavation repeatedly of road can be caused, be combined with city integrated piping lane carry out Cable layout planning can be with
Solve the above problems.But, in the planning of power cable passage, how reasonable integration is returned on the basis of the programming and distribution of pipe gallery
And channel resource, the intensive utilization underground space and underground pipe gallery plan to form good interaction, becomes new path planning
Difficult point.By line route planning development synchronous with the planning of power distribution network topological structure when current method is most of, with heuristic
Based on algorithm, it is ensured that the normalization and expansibility of distribution net work structure, but line route differs and is surely optimal, also not
Adapt to the situation for having there is city integrated piping lane to build.
Technical solution of the present invention propose resolving ideas be：Power supply grid is preliminarily formed first with critical path method (CPM), and
Realize optimal, completion basic routing line planning in grid inner cable path；Circuit contact, the party are completed based on increment critical path method (CPM) again
Method has clear concept, and calculating speed is fast, the characteristics of planning effect is good.
With reference to embodiment and figure, the present invention is described in further detail, but embodiments of the present invention are not only limited
In this.
A kind of power distribution network medium-voltage line paths planning method based on city integrated piping lane, as shown in figure 1, this method includes
Following steps：
S1, sets up medium-voltage line power supply plan region；
S2, sets up medium-voltage line path planning model, including：
S21, sets target function,
It is minimum as the object of planning using year comprehensive method of investment expense f (x), (contain civil engineering costs and electricity including cable constructions investment
Cable Master Cost), annual operating cost and loss：
Section 1 is that year fixed investment and year operation and maintenance expenses are used on the right of equation, and its middle aged operation and maintenance expenses takes the folding of year fixed investment necessarily
Coefficient m is calculated, using " present worth coming year method ", total expense is converted to the construction cost in annual,It is worth for year
Coefficient, wherein r0For power industry investment yield, n is the Economic Life of electrical equipment, DiFor the branch road for thering is cable to pass through
Set, xiFor the length of every section of branch road,For the cable passage unit length cost of different overhead cabling methods；For
Cable material expense in branch road i, LCFor selected cable unit length cost, k is the cable loop number in branch road i；
Section 2 is cost of losses on the right of equation, and λ is total rate of electricity；ΔPjiFor the active loss of the branch road i in passage path j,PjiFor all power sums (in the case of maximum load) in the j of path by branch road i, UiIt is first for branch road i
Terminal voltage, takes average rated voltage herein, and ρ is the unitary resistance value of selected cable；τmaxFor number of working hours based on maximum load.
S22, sets constraints,
A, open loop power constraint,
Using the double circuit power supply pattern such as power supply-switchyard, the condition is met when forming supply path；
B, cable capacity constraint,
Flow through the power P of every section of branch cablejiLess than limit value Pji(lim), i.e.,：
Pji≤Pji(lim), j=1,2 ..., Dj；I=1,2 ..., Di (2)
C, the constraint of cabling feeder number,
On every branch road, using different overhead cabling methods, its cable bar number niIt must not exceed pipe gallery electric power storehouse or electricity
The upper limit N of cable comb scalei(max)：
0≤ni≤Ni(max) (3)
D, transformer station's outlet number constraint,
The outlet number m of each transformer stationbThe outlet number limit value m allowed less than or equal to transformer stationb(max), i.e.,
0≤mb≤mb(max) (4)
E, radius of electricity supply constraint,
The radius of electricity supply of transformer station is considered when setting up and forming planning region, it is ensured that power supply of all switchyard loads in transformer station
In radius.
S3, line route is optimized based on dijkstra's algorithm,
According to the transformer station in the planning region and the distribution of load point, figure G=(V, E) is set up, it is one to make G=(V, E)
Individual Weighted Directed Graph, above-mentioned Weighted Directed Graph is made up of set V and E, and wherein V is being made up of limited summit for non-NULL
Vertex set, E is then the set of paths to being constituted by summit, and above-mentioned summit is to being also known as side (Edge), i.e. path；By in figure
Vertex set V be divided into two groups, first group is the vertex set S for having obtained shortest path, only active in vertex set S when initial
Node, often tries to achieve a shortest path later, and just its corresponding summit is added in vertex set S, until whole summits all
It is added in vertex set S；Second group is the vertex set U for not determining shortest path, in adition process, total to keep from source section
The shortest path length on each summit is not more than from source node v to vertex set U that any summit is most in point v to vertex set S
Short path length.
As shown in Fig. 2 the calculation procedure of dijkstra's algorithm is as follows：
S31, during initialization, above-mentioned vertex set S is containing only active node；
S32, chooses one in summit k addition vertex sets S minimum v, the selected distance is exactly from vertex set U
V to k shortest path length；
S33, using k as the intermediate point newly considered, changes the distance on each summit in vertex set U；If from source node v to summit u's
(by summit k), than original distance, (, then modification summit u distance value short without summit k), amended distance value is distance
Summit k distance adds k to u distance；
S34, repeat step S32 and S33, until all summits are included in vertex set S.
Dijkstra (Di Jiesitela) algorithms are powered during optimal repairing path is calculated in power distribution network and are applied, known
Under conditions of channel information and transformer station, switch station location, technical solution of the present invention utilizes dijkstra's algorithm, calculates switchyard
Shortest path (new expense being produced during newly-increased node minimum) between transformer station, makes the cable trace in power supply grid optimal.
When planning grid supply path using critical path method (CPM), when newly-increased path is with path is improved, meter is required for
Calculate routine weight value.The weights in path are to increase newly after a switchyard load, and each branch road expense in network, to branch road i, can be represented
Into：
Wi=Wfi+Wli (5)
WfiFor cable investment comprehensive cost, including cable passage construction cost WDiWith cable material investment cost WCi, WliFor net
Damage expense, is calculated referring to formula (1).
As shown in figure 3, in the step S1, described to set up medium-voltage line power supply plan region, specific steps include：
S11, according to Urban New District total arrangement, some functional areas are divided into by Urban New District by street river etc.；
S12, is divided into Development control area unit by the function zoning according to land character, i.e., is used as construction using the grid that road network is formed
Development block；
S13, planning region internal loading is counted in units of the grid, and medium voltage distribution network is constituted is with Switching Station (looped network room)
The medium voltage distribution network bulk transmission grid of node.
Above-mentioned this powering mode makes the supply district of medium-voltage line that the form of " gridding ", distribution net gridding is also presented
Plan geographical schematic and electrical schematics respectively as shown in accompanying drawing 4, accompanying drawing 5.
In step s3, during transformer station-switchyard cable trace determines using the key issue of dijkstra's algorithm be as
What is converted into problem to be studied corresponding relation between graph theoretic problem, i.e., each correlative.It is described to build in technical solution of the present invention
Vertical figure G=(V, E) idiographic flow includes,
By the transformer station in planning region and load point when the summit of mapping, the cable duct that pipe gallery will be planned or may be excavated
The infall in corridor is referred to as crosspoint, and summit and crosspoint are referred to as into node, conduit line will may be excavated between each node
Corridor be referred to as path, by the path using summit as end points when mapping side, by the construction cost of circuit on each paths and side
The side and power of (including line material expense and operating expenses) respectively as each paths, the power of each paths are represented with w, with this
Distribution network planning domain is converted into a weighted graph G=(V, E), wherein V and E represent the collection on all summits and side in figure respectively
Close.
The optimal flow in power distribution network grid inner cable path is realized using critical path method (CPM) as shown in Figure 6, using most short
Routing algorithm, determines the contact path of each power supply network compartment, algorithm flow is as shown in Figure 7.
Case study on implementation：
Certain city's Science and Technology City is located at by technical research area, Sci-tech Pioneering area, educational training area, the big mac function structure in service for life area four
Into as shown in figure 8, planning formation is mutually coordinated with urban planning, urban road lower space is rationally and effectively used, and has
Advanced, comprehensive, reasonability, the pipe gallery system of practicality.
Powered grid cable according to the plan model proposed in technical solution of the present invention and the power distribution network based on shortest path
Line optimization method, in the case where completing load prediction, high voltage distribution network planning, determining switchyard (looped network room) position, is adopted
The power distribution network formed with planning algorithm powers grid as shown in case diagram 9.
Wherein, parameter is given below：r0=0.1；N=30；For pipe gallery, enter corridor construction cost temporarily by directly buried installation
Cost is estimated, in addition to pipe gallery, only considers three kinds of cable duct bank, respectively 8 holes, 12 holes and 24 holes.Distribution network planning
As a result as shown in Figure 10, midium voltage cable line route program results schematic diagram is as shown in figure 11.
Due to during medium-voltage line path planning, having fully taken into account the factor of Urban New District pipe gallery, planning
Power distribution network medium-voltage line afterwards is not only adapted to the situation for having city integrated piping lane to build, and as a result of the year comprehensive method of investment
The minimum object function of expense, effectively with reference to dijkstra's algorithm so that cable trace is most short, investment cost is minimum.Compared to
Heuritic approach, this method also has clear concept, and calculating speed is fast, the characteristics of planning effect is good.
Described above is only the preferred embodiment of the present invention, and protection scope of the present invention is not limited merely to above-mentioned implementation
Example, all technical schemes belonged under thinking of the present invention belong to protection scope of the present invention.It should be pointed out that for the art
Those of ordinary skill for, some improvements and modifications without departing from the principles of the present invention, these improvements and modifications
It should be regarded as protection scope of the present invention.
Claims (4)
1. a kind of power distribution network medium-voltage line paths planning method based on city integrated piping lane, it is characterised in that including following step
Suddenly：
S1, sets up medium-voltage line power supply plan region；
S2, sets up medium-voltage line path planning model,
S21, sets target function,
It is minimum as the object of planning using year comprehensive method of investment expense f (x), (contain civil engineering costs and electricity including cable constructions investment
Cable Master Cost), annual operating cost and loss：
<mrow>
<mi>min</mi>
<mi>f</mi>
<mrow>
<mo>(</mo>
<mi>x</mi>
<mo>)</mo>
</mrow>
<mo>=</mo>
<mrow>
<mo>(</mo>
<mi>&omega;</mi>
<munder>
<mi>&Sigma;</mi>
<mrow>
<mi>i</mi>
<mo>&Element;</mo>
<msub>
<mi>D</mi>
<mi>i</mi>
</msub>
</mrow>
</munder>
<mrow>
<mo>(</mo>
<msub>
<mi>L</mi>
<msub>
<mi>D</mi>
<mi>i</mi>
</msub>
</msub>
<mo>+</mo>
<msub>
<mi>L</mi>
<msub>
<mi>C</mi>
<mi>i</mi>
</msub>
</msub>
<mo>)</mo>
</mrow>
<msub>
<mi>x</mi>
<mi>i</mi>
</msub>
<mo>)</mo>
</mrow>
<mrow>
<mo>(</mo>
<mn>1</mn>
<mo>+</mo>
<mi>m</mi>
<mo>)</mo>
</mrow>
<mo>+</mo>
<munder>
<mi>&Sigma;</mi>
<mrow>
<mi>j</mi>
<mo>&Element;</mo>
<msub>
<mi>D</mi>
<mi>j</mi>
</msub>
</mrow>
</munder>
<munder>
<mi>&Sigma;</mi>
<mrow>
<mi>i</mi>
<mo>&Element;</mo>
<msub>
<mi>D</mi>
<mi>i</mi>
</msub>
</mrow>
</munder>
<mi>&lambda;&Delta;</mi>
<msub>
<mi>P</mi>
<mi>ji</mi>
</msub>
<msub>
<mi>&tau;</mi>
<mi>max</mi>
</msub>
<mo>-</mo>
<mo>-</mo>
<mo>-</mo>
<mrow>
<mo>(</mo>
<mn>1</mn>
<mo>)</mo>
</mrow>
</mrow>
Section 1 is that year fixed investment and year operation and maintenance expenses are used on the right of equation, and its middle aged operation and maintenance expenses takes the folding of year fixed investment necessarily
Coefficient m is calculated, using " present worth coming year method ", total expense is converted to the construction cost in annual,It is worth for year
Coefficient, wherein r0For power industry investment yield, n is the Economic Life of electrical equipment, DiFor the branch road for thering is cable to pass through
Set, xiFor the length of every section of branch road,For the cable passage unit length cost of different overhead cabling methods；For
Cable material expense in branch road i, LCFor selected cable unit length cost, k is the cable loop number in branch road i；
Section 2 is cost of losses on the right of equation, and λ is total rate of electricity；ΔPjiFor the active loss of the branch road i in passage path j,PjiFor all power sums (in the case of maximum load) in the j of path by branch road i, UiIt is first for branch road i
Terminal voltage, takes average rated voltage herein, and ρ is the unitary resistance value of selected cable；τmaxFor number of working hours based on maximum load；
S22, sets constraints,
A, open loop power constraint,
Using the double circuit power supply pattern such as power supply-switchyard, the condition is met when forming supply path；
B, cable capacity constraint,
The power for flowing through every section of branch cable is less than limit value, i.e.,：
Pji≤Pji(lim), j=1,2 ..., Dj；I=1,2 ..., Di (2)
C, the constraint of cabling feeder number,
On every branch road, using different overhead cabling methods, its cable bar number niIt must not exceed pipe gallery electric power storehouse or cable
The upper limit N of comb scalei(max)：
0≤ni≤Ni(max) (3)
D, transformer station's outlet number constraint,
The outlet number m of each transformer stationbThe outlet number limit value m allowed less than or equal to transformer stationb(max), i.e.,
0≤mb≤mb(max)(4)
E, radius of electricity supply constraint,
The radius of electricity supply of transformer station is considered when setting up and forming planning region, it is ensured that power supply of all switchyard loads in transformer station
In radius；
S3, line route is optimized based on dijkstra's algorithm,
According to the transformer station in the planning region and the distribution of load point, figure G=(V, E) is set up, it is one to make G=(V, E)
Individual Weighted Directed Graph, above-mentioned Weighted Directed Graph is made up of set V and E, and wherein V is being made up of limited summit for non-NULL
Vertex set, E is then the set of paths to being constituted by summit, and above-mentioned summit is to being also known as side (Edge), i.e. path；By in figure
Vertex set V be divided into two groups, first group is the vertex set S for having obtained shortest path, an active node in S when initial, with
A shortest path is often tried to achieve afterwards, just its corresponding summit is added in vertex set S, until whole summits are all added to top
In point set S；Second group is the vertex set U for not determining shortest path, in adition process, is always kept from source node v to top
The shortest path length on each summit is not more than the shortest path path length on any summit from source node v to vertex set U in point set S
Degree；
The calculation procedure of Diikstra algorithms is as follows：
S31, during initialization, vertex set S is containing only active node；
S32, chooses one in summit k addition vertex sets S minimum v, the selected distance is exactly from vertex set U
V to k shortest path length；
S33, using k as the intermediate point newly considered, changes the distance on each summit in vertex set U；If from source node v to summit u's
(by summit k), than original distance, (, then modification summit u distance value short without summit k), amended distance value is distance
Summit k distance adds k to u distance；
S34, repeat step S32 and S33, until all summits are included in vertex set S.
2. according to the method described in claim 1, it is characterised in that in the step S1, the medium-voltage line of setting up is powered rule
Partition domain, specific steps include：
S11, according to Urban New District total arrangement, some functional areas are divided into by Urban New District by street river etc.；
S12, is divided into Development control area unit by the function zoning according to land character, i.e., is used as construction using the grid that road network is formed
Development block；
S13, planning region internal loading is counted in units of the grid, and medium voltage distribution network is constituted is with Switching Station (looped network room)
The medium voltage distribution network bulk transmission grid of node.
3. method according to claim 2, it is characterised in that the idiographic flow for setting up figure G=(V, E) includes,
By the transformer station in planning region and load point when the summit of mapping, the cable duct that pipe gallery will be planned or may be excavated
The infall in corridor is referred to as crosspoint, and summit and crosspoint are referred to as into node, conduit line will may be excavated between each node
Corridor be referred to as path, by the path using summit as end points when mapping side, by the construction cost of circuit on each paths and side
The side and power of (including line material expense and operating expenses) respectively as each paths, the power of each paths are represented with w, with this
Distribution network planning domain is converted into a weighted graph G=(V, E), wherein V and E represent the collection on all summits and side in figure respectively
Close.
4. method according to claim 3, it is characterised in that when newly-increased path is with path is improved, each paths weights
Computational methods be,
The weights in path are to increase newly after a switchyard load, and each branch road expense in network, to branch road i, can be expressed as：
Wi=Wfi+Wli (5)
WfiFor cable investment comprehensive cost, including cable passage construction cost WDiWith cable material investment cost WCi, WliFor network loss
Expense, is calculated referring to formula (1).
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710682952.XA CN107301482A (en) | 2017-08-10 | 2017-08-10 | A kind of power distribution network medium-voltage line paths planning method based on city integrated piping lane |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710682952.XA CN107301482A (en) | 2017-08-10 | 2017-08-10 | A kind of power distribution network medium-voltage line paths planning method based on city integrated piping lane |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN107301482A true CN107301482A (en) | 2017-10-27 |
Family
ID=60134544
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710682952.XA Pending CN107301482A (en) | 2017-08-10 | 2017-08-10 | A kind of power distribution network medium-voltage line paths planning method based on city integrated piping lane |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107301482A (en) |
Cited By (17)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107909222A (en) * | 2017-12-11 | 2018-04-13 | 北京天润新能投资有限公司 | A kind of wind power plant collection electric line three-dimensional path planning method and system based on fan intelligent packet |
| CN108074043A (en) * | 2018-01-04 | 2018-05-25 | 贵州大学 | A kind of mating Electric power network planning method of city integrated piping lane |
| CN108199367A (en) * | 2017-12-11 | 2018-06-22 | 上海交通大学 | One kind is based on medium voltage distribution network unit style grid power supply plan method |
| CN108509740A (en) * | 2018-04-09 | 2018-09-07 | 长沙市海图科技有限公司 | Pipeline path method and device for planning based on piping lane |
| CN108694506A (en) * | 2018-05-14 | 2018-10-23 | 广州供电局有限公司 | Power distribution network cable tunnel construction demand amount determines method and device |
| CN108881025A (en) * | 2018-06-01 | 2018-11-23 | 国电南瑞科技股份有限公司 | More power grid regulation system interface unified view integrated approaches based on cloud terminal mode |
| CN110416925A (en) * | 2019-07-12 | 2019-11-05 | 上海电机学院 | A kind of submarine cable Wiring design method of offshore wind farm |
| CN110765563A (en) * | 2019-10-08 | 2020-02-07 | 杭州阳斯信息技术有限公司 | Automatic wiring method for power distribution network based on shortest paths of multiple essential points |
| CN111444586A (en) * | 2020-03-30 | 2020-07-24 | 国家能源集团宁夏煤业有限责任公司 | Automatic arrangement method and system for pipelines in roadway and pipe gallery |
| CN111882201A (en) * | 2020-07-24 | 2020-11-03 | 海南电网有限责任公司 | Grid-based medium-voltage line automatic planning method and system |
| CN112101668A (en) * | 2020-09-18 | 2020-12-18 | 福建永福电力设计股份有限公司 | Medium-voltage line automatic planning method based on GIS |
| CN112231811A (en) * | 2020-10-15 | 2021-01-15 | 国网河北省电力有限公司雄安新区供电公司 | BIM-based urban medium-voltage distribution network transition net rack transformation method |
| CN112541614A (en) * | 2020-11-23 | 2021-03-23 | 浙江泰仑电力集团有限责任公司 | Power supply path optimization method for distributed active power grid and system for implementing method |
| CN112862625A (en) * | 2021-01-07 | 2021-05-28 | 国网浙江杭州市余杭区供电有限公司 | Power supply path acquisition method based on Dijkstra algorithm |
| CN113239540A (en) * | 2021-05-11 | 2021-08-10 | 山东大学 | Urban power distribution network line dynamic planning method and system |
| CN113609649A (en) * | 2018-02-13 | 2021-11-05 | 三峡大学 | Method for constructing power distribution network medium-voltage line planning model based on opportunity constraint |
| CN116451876A (en) * | 2023-06-15 | 2023-07-18 | 国网江西省电力有限公司信息通信分公司 | Power distribution network fault prediction and active overhaul system based on artificial intelligence |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101764407A (en) * | 2010-01-08 | 2010-06-30 | 杨毅 | Planning method of distribution network based on fuzzy expected value model |
| CN103093391A (en) * | 2011-10-28 | 2013-05-08 | 上海博英信息科技有限公司 | City power distribution network arranging method |
| CN103489076A (en) * | 2013-09-30 | 2014-01-01 | 国家电网公司 | Method for planning substations of power distribution network |
| CN103559553A (en) * | 2013-10-25 | 2014-02-05 | 国家电网公司 | Distributing line planning and distribution transform site selection optimizing method based on load moment theory |
| CN105141464A (en) * | 2015-09-24 | 2015-12-09 | 国网上海市电力公司 | Grid structure planning method for coordinated power transmission and distribution |
| CN106208040A (en) * | 2016-07-18 | 2016-12-07 | 国网河南省电力公司电力科学研究院 | The optimization method in power supply network path |
| CN106779168A (en) * | 2016-11-23 | 2017-05-31 | 国网山东省电力公司威海供电公司 | A kind of distribution transformer addressing and low pressure rack plan optimization method |
-
2017
- 2017-08-10 CN CN201710682952.XA patent/CN107301482A/en active Pending
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101764407A (en) * | 2010-01-08 | 2010-06-30 | 杨毅 | Planning method of distribution network based on fuzzy expected value model |
| CN103093391A (en) * | 2011-10-28 | 2013-05-08 | 上海博英信息科技有限公司 | City power distribution network arranging method |
| CN103489076A (en) * | 2013-09-30 | 2014-01-01 | 国家电网公司 | Method for planning substations of power distribution network |
| CN103559553A (en) * | 2013-10-25 | 2014-02-05 | 国家电网公司 | Distributing line planning and distribution transform site selection optimizing method based on load moment theory |
| CN105141464A (en) * | 2015-09-24 | 2015-12-09 | 国网上海市电力公司 | Grid structure planning method for coordinated power transmission and distribution |
| CN106208040A (en) * | 2016-07-18 | 2016-12-07 | 国网河南省电力公司电力科学研究院 | The optimization method in power supply network path |
| CN106779168A (en) * | 2016-11-23 | 2017-05-31 | 国网山东省电力公司威海供电公司 | A kind of distribution transformer addressing and low pressure rack plan optimization method |
Non-Patent Citations (4)
| Title |
|---|
| 方毅立等: "电力建设用地的有效规划控制_浙江省电力设施布局规划探索", 《城市规划和科学发展——2009中国城市规划年会论文集》 * |
| 曲伟君等: "开式配电网络的优化设计", 《水电能源科学》 * |
| 曹磊: "基于图论的配电网规划问题", 《科技尚品》 * |
| 朱新红等: "城市地下综合管廊的体系构建与电力电缆通道规划的关系_以《南京市城市地下综合管廊总体规划》为例", 《2016中国城市规划年会论文集》 * |
Cited By (28)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107909222A (en) * | 2017-12-11 | 2018-04-13 | 北京天润新能投资有限公司 | A kind of wind power plant collection electric line three-dimensional path planning method and system based on fan intelligent packet |
| CN108199367A (en) * | 2017-12-11 | 2018-06-22 | 上海交通大学 | One kind is based on medium voltage distribution network unit style grid power supply plan method |
| CN107909222B (en) * | 2017-12-11 | 2021-02-19 | 北京天润新能投资有限公司 | Wind power plant current collection line three-dimensional path planning method and system based on intelligent fan grouping |
| CN108199367B (en) * | 2017-12-11 | 2020-07-14 | 上海交通大学 | Power supply planning method based on medium-voltage distribution network unit grid |
| CN108074043A (en) * | 2018-01-04 | 2018-05-25 | 贵州大学 | A kind of mating Electric power network planning method of city integrated piping lane |
| CN113609649A (en) * | 2018-02-13 | 2021-11-05 | 三峡大学 | Method for constructing power distribution network medium-voltage line planning model based on opportunity constraint |
| CN113609649B (en) * | 2018-02-13 | 2024-03-15 | 三峡大学 | Method for constructing medium-voltage line planning model of power distribution network based on opportunity constraint |
| CN108509740A (en) * | 2018-04-09 | 2018-09-07 | 长沙市海图科技有限公司 | Pipeline path method and device for planning based on piping lane |
| CN108509740B (en) * | 2018-04-09 | 2022-05-27 | 长沙市海图科技有限公司 | Pipeline path planning method and device based on pipe gallery |
| CN108694506A (en) * | 2018-05-14 | 2018-10-23 | 广州供电局有限公司 | Power distribution network cable tunnel construction demand amount determines method and device |
| CN108694506B (en) * | 2018-05-14 | 2021-06-18 | 广东电网有限责任公司广州供电局 | Method and device for determining construction demand of power distribution network cable tunnel |
| CN108881025A (en) * | 2018-06-01 | 2018-11-23 | 国电南瑞科技股份有限公司 | More power grid regulation system interface unified view integrated approaches based on cloud terminal mode |
| CN108881025B (en) * | 2018-06-01 | 2021-04-09 | 国电南瑞科技股份有限公司 | Multi-power-grid regulation and control system image unified browsing integration method based on cloud terminal mode |
| CN110416925A (en) * | 2019-07-12 | 2019-11-05 | 上海电机学院 | A kind of submarine cable Wiring design method of offshore wind farm |
| CN110416925B (en) * | 2019-07-12 | 2021-07-20 | 上海电机学院 | Submarine cable wiring design method for offshore wind power |
| CN110765563A (en) * | 2019-10-08 | 2020-02-07 | 杭州阳斯信息技术有限公司 | Automatic wiring method for power distribution network based on shortest paths of multiple essential points |
| CN111444586B (en) * | 2020-03-30 | 2022-11-22 | 国家能源集团宁夏煤业有限责任公司 | Automatic arrangement method and system for pipelines in roadway and pipe gallery |
| CN111444586A (en) * | 2020-03-30 | 2020-07-24 | 国家能源集团宁夏煤业有限责任公司 | Automatic arrangement method and system for pipelines in roadway and pipe gallery |
| CN111882201A (en) * | 2020-07-24 | 2020-11-03 | 海南电网有限责任公司 | Grid-based medium-voltage line automatic planning method and system |
| CN112101668A (en) * | 2020-09-18 | 2020-12-18 | 福建永福电力设计股份有限公司 | Medium-voltage line automatic planning method based on GIS |
| CN112231811A (en) * | 2020-10-15 | 2021-01-15 | 国网河北省电力有限公司雄安新区供电公司 | BIM-based urban medium-voltage distribution network transition net rack transformation method |
| CN112231811B (en) * | 2020-10-15 | 2022-11-11 | 国网河北省电力有限公司雄安新区供电公司 | BIM-based urban medium-voltage distribution network transition net rack transformation method |
| CN112541614A (en) * | 2020-11-23 | 2021-03-23 | 浙江泰仑电力集团有限责任公司 | Power supply path optimization method for distributed active power grid and system for implementing method |
| CN112862625A (en) * | 2021-01-07 | 2021-05-28 | 国网浙江杭州市余杭区供电有限公司 | Power supply path acquisition method based on Dijkstra algorithm |
| CN113239540A (en) * | 2021-05-11 | 2021-08-10 | 山东大学 | Urban power distribution network line dynamic planning method and system |
| CN113239540B (en) * | 2021-05-11 | 2023-05-12 | 山东大学 | Urban power distribution network line dynamic planning method and system |
| CN116451876A (en) * | 2023-06-15 | 2023-07-18 | 国网江西省电力有限公司信息通信分公司 | Power distribution network fault prediction and active overhaul system based on artificial intelligence |
| CN116451876B (en) * | 2023-06-15 | 2023-09-22 | 国网江西省电力有限公司信息通信分公司 | Power distribution network fault prediction and active overhaul system based on artificial intelligence |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107301482A (en) | A kind of power distribution network medium-voltage line paths planning method based on city integrated piping lane | |
| CN110717226B (en) | Regional comprehensive energy system layout planning method considering topological characteristics of energy network | |
| Wei et al. | Expansion planning of urban electrified transportation networks: A mixed-integer convex programming approach | |
| CN107742167A (en) | The accurate planing method of middle voltage distribution networks based on three layers of macroscopical networking constraint | |
| CN106503839A (en) | A kind of marine wind electric field annular current collection network hierarchy planing method | |
| Wang et al. | An improved substation locating and sizing method based on the weighted voronoi diagram and the transportation model | |
| CN109409699A (en) | A kind of electricity changes the accurate investment planning method of middle voltage distribution networks under environment | |
| CN105069700A (en) | Layered and partitioned power distribution network frame programming method | |
| CN104331847A (en) | Power supply zone partitioning method by use of Delaunay triangulation | |
| CN113343426A (en) | Urban distribution network line gauge method and system considering real demand guidance | |
| CN109598377A (en) | A kind of alternating current-direct current mixing power distribution network robust planing method based on failure constraint | |
| CN104573868B (en) | A kind of power distribution network repairing Meshing Method and equipment | |
| Sheng et al. | A potential security threat and its solution in coupled urban power-traffic networks with high penetration of electric vehicles | |
| Bosisio et al. | GIS-based urban distribution networks planning with 2-step ladder topology considering electric power cable joints | |
| CN108667027A (en) | Ac and dc systems power flow transfer search containing flexible direct current and quantitative analysis method | |
| Chen et al. | Optimal weighted voronoi diagram method of distribution network planning considering city planning coordination factors | |
| Li et al. | An MILP model for urban distribution network planning considering street layout and block loads | |
| CN104836240A (en) | Power grid inherent structural characteristic-based power distribution network optimal reactive compensation method | |
| CN110414836A (en) | Consider the probabilistic substation's probability plan method of comprehensive energy station power demand | |
| CN102751722A (en) | Grid network optimization method based on shortest feasible path and historical flow data | |
| Li et al. | Hierarchical and partitioned planning strategy for closed-loop devices in low-voltage distribution network based on improved KMeans partition method | |
| Zhang et al. | Joint PEV charging station and distributed PV generation planning | |
| CN206932003U (en) | A kind of expansible how annular Urban Medium Voltage Distribution Network system | |
| CN105449672A (en) | Method for estimating total supply capability of 220KV loop ring network | |
| CN107425519A (en) | Three-phase distribution net net capability computational methods containing distributed power source |
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 | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20171027 |