CN101826725A - Method based on shortest path for calculating power loop-closing path - Google Patents
Method based on shortest path for calculating power loop-closing path Download PDFInfo
- Publication number
- CN101826725A CN101826725A CN200910058528A CN200910058528A CN101826725A CN 101826725 A CN101826725 A CN 101826725A CN 200910058528 A CN200910058528 A CN 200910058528A CN 200910058528 A CN200910058528 A CN 200910058528A CN 101826725 A CN101826725 A CN 101826725A
- Authority
- CN
- China
- Prior art keywords
- path
- point
- shortest path
- computer
- equipment
- 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.)
- Granted
Links
Images
Landscapes
- Supply And Distribution Of Alternating Current (AREA)
Abstract
The invention relates to a method based on shortest path for calculating power loop-closing path and the method relates to the computer application field. The method comprises the following three steps: 1. collecting data, setting each device in a grid as one point, establishing device information, establishing a corresponding relationship in a computer, including in a computer system database; 2. using the collected data to establish a topological relation in the computer; and 3. calculating the power loop-closing path with shortest path according to the topological relation. The calculation method comprises the following steps: setting the plane coordinate of each point, solving the shortest path from the originating point s to the point j; storing the path if the shortest path exists from the point s to the point j, unlinking any node on the path, solving again, and confirming the closed loop if the path exists. The invention adopts the advanced computer technology and communication technology to position and separate faults through one-step and restore electricity, thus avoiding multiple shocks of short-circuit current to the circuit and devices and increasing the degree of automation.
Description
Affiliated technical field
The present invention relates to computer application field, particularly the computer application in distribution network is managed, and specifically is based on the method for shortest path for calculating power loop-closing path.
Background technology
The solution of existing distribution network fault has three kinds: first kind is with the fault detector that is installed on the distribution line, by electric power overhaul people finder fault section, and utilizes the artificial isolated fault section of on-pole switch equipment, recovers the power supply of normal reach.The interruption duration of this mode is long, and it is slow to restore electricity.Second kind is to utilize intelligent switch equipment (as automatic circuit, sectionalizer etc.), by cooperatively interacting between them, realizes isolating automatically on the spot and restoring electricity of fault.The automatization level of this mode is higher, need not communication and just can realize controlled function, and cost is lower.Shortcoming is that switchgear need increase the number of times that closes, divides action and just can finish the isolation of fault and restore electricity.The third be switchgear and line feed terminals unit (FTU) are integrated into have data acquisition, the intelligent device of transmission, controlled function, and carry out real time communication with computer controlling center, by control centre with the remote control mode centralized control.This mode adopts the advanced computer technology and the communication technology, can disposablely finish failure location, isolate and restore electricity, and avoids the repeatedly impact of short circuit current to circuit and equipment.The major defect that exists is: depend on communication, and complex structure, the factor that influences distribution Power System Reliability is more.
Summary of the invention
The objective of the invention is deficiency, a kind of method based on shortest path for calculating power loop-closing path is provided at above-mentioned the third method.This method is based upon on the basis of the computer technology and the communication technology, utilizes existing intelligent apparatus, and the fault grid power blackout scope of repair is dropped to minimum, improves the reliability and stability of distribution system to greatest extent.
Basic ideas of the present invention are that real electric power networking is abstracted into the network topology relation in the plane coordinates of GIS GIS-Geographic Information System, clearly explain the link relation between equipment and the equipment, pass through topological relation, adopt dijkstra's algorithm to find the path that arrives identical device by different circuits, if have two different paths between two points, can confirm so to have a winding between two points, and then obtain the electric power winding according to shortest path.Adopt dijkstra's algorithm to calculate two paths between the equipment, suppose that at first each point all has a pair of label (d
j, p
j), d wherein
jBeing the length of the shortest path from originating point s to a j, is zero tunnel (road that does not have arc) from the summit to the shortest path of itself promptly, and its length equals zero; p
jThen be more preceding that j is ordered in the shortest path from s to j.The point here is exactly the power equipment of setting.
The objective of the invention is to reach like this: comprise following three steps:
Data acquisition is a point with each apparatus settings in the electrical network, and apparatus for establishing information is done a corresponding relation in computer, count the computer system data storehouse.
The data of gathering are set up topological relation in computer.
Go out electric power cyclization path according to topological relationship calculation based on shortest path.
The described computational methods that go out based on the electric power cyclization path of shortest path according to topological relationship calculation are: the plane coordinates (Vj that sets each point, pj), wherein Vj is the length of the shortest path from originating point s to a j, pj is more preceding that j is ordered in the shortest path from s to j, find the solution the shortest path from originating point s to a j, algorithmic procedure is as follows:
1) initialization, originating point is set to: 1. Vs=0, ps are empty; 2. every other some Vi=∞, pi=? 3. mark originating point s remembers k=s, and other are made as unmarked a little;
2) check from all the some k of mark to the distance of its direct-connected unlabelled some j, and Vj=min[Vj is set, Vk+lkj]
In the formula, lkj is the direct connection distance from a k to j;
3) choose next point, from all unlabelled nodes, choose minimum among a Vj i:
Vi=min[Vj, all unlabelled some j]
Point i just is chosen as a bit in the shortest path, and is made as mark;
4) find the more preceding of an i, from the point of mark, find the some j that is directly connected to an i
*, as more preceding, be set to: i=j
*
5) gauge point i, if the mark of having a few, then algorithm is released fully, otherwise note k=i goes to 2) continue;
6) if there is shortest path in s to j, preserve this path, disconnect any one node on this paths, ask the path once more one time according to top algorithm, if the path exists, then can the affirmation system there be at least one loop;
7) result with twice analysis compares, and V0 → V4 → V3 → V5 will disconnect between V0 and the V4, carries out the computing and the top class of algorithms once more seemingly, obtains the path of V0 → V5, and drawing between V0 → V4 → V3 → V5 → V0 is a ring.
Described is a point with each apparatus settings in the electrical network, and apparatus for establishing information is the electric pressure of apparatus for establishing, the on off state of equipment, the electric pressure of equipment, the situation information whether equipment is charged.
Described data with collection are set up topological relation in computer be that the annexation that equipment is connected with those equipment is stored in the plane coordinates of GIS GIS-Geographic Information System.
The present invention has the following advantages: 1, dwindle the integral body that individual user or line fault brings and have a power failure, by rational line sectionalizing quantity with the equitable subsection point is set, make the user enjoy high as far as possible power supply reliability.2, selection equipment possesses and satisfies when line fault, can automatic isolated fault section, recover the function of supplying power of non-fault section automatically.3, improve the automaticity of power department, system can at any time judge the existence of winding automatically.4, the heavier branched line of load is arranged the segmentation branch switch as far as possible, to guarantee to isolate branch's fault, guarantees that backbone is unimpeded.5, guarantee to realize the segmentation principle of main line: a impartial principle of loading; The impartial principle of b line length; The impartial principle of c number of users.
Description of drawings
Signal when Fig. 1, Fig. 5 are the point coordinates initialization that is provided with in the shortest path of the present invention.
Fig. 2, Fig. 6 be check from all the some k of mark to the signal of the distance of its direct-connected unlabelled some j.
Fig. 3, Fig. 7 are the connection signals of choosing shortest path.
Fig. 4 is based on the loop schematic diagram of shortest path.
V0, V1, V2, V3, V4, V5 represent the point of each apparatus settings in the electrical network among the figure; Final is meant whether determine a paths, exist for 1, do not exist for 0; D is a minimum value that arrives specified node; S is a set, and all members in the inside have found shortest path; V is a set, and the set that all needs are asked shortest path has been write down in the inside.If there is the path, will exist the member in path to remove.
Embodiment
The precondition of system of the present invention operation is that the electrical network network is established, switchgear and line feed terminals unit (FTU) be integrated into have data acquisition, the intelligent device of transmission, controlled function, and carry out real time communication with computer controlling center, by control centre with the remote control mode centralized control.
Electrical network ring network power supply principle: two circuits are formed a looped network hand in hand, every circuit is carried out segmentation control switch is set, the tie point of circuit is provided with interconnection switch, utilizes the time-delay of the equipment interval load transition that has a power failure.When a certain district of supply line broke down, distribution system possessed automatic isolated fault section, recovers the power supply capacity of non-fault section automatically, dwindled the power failure scope and reduced customer outage hours, improves the purpose to user's power supply reliability thereby reach.
At first the topological relation information between all devices information and the equipment in the electrical network is saved in the Computer Database table.Facility information refers to the electric pressure of equipment, the on off state of equipment, and the electric pressure of equipment, information such as whether equipment is charged, the equipment topological relation refers to that equipment is connected with those equipment, and stores in the plane coordinates position of GIS GIS-Geographic Information System.The storage of facility information is shown in the storage table.
The storage table:
| Field name | Field type | Remarks |
| ??Ggdid | ??Int | The equipment uniquely tagged |
| ??Voltage | ??Int | Electric pressure |
| ??IsPower | ??Bool | Whether be with a little |
| ??Status | ??String | On off state |
Referring to accompanying drawing 1-7.
(Vj, pj), wherein Vj is the length of the shortest path from originating point s to a j if each point all has a pair of label.Is zero tunnel from the summit to the shortest path of itself, and its length equals zero, and is the road that arc is arranged; Pj then is more preceding that j is ordered in the shortest path from s to j.The basic process of finding the solution the shortest path first from originating point s to a j is as follows:
1) initialization.Originating point is set to: 1. Vs=0, ps are empty; 2. every other point: Vi=∞, pi=? 3. mark originating point s, note k=s, other are made as unlabelled a little.As Fig. 1, shown in Figure 5.
2) check from all the some k of mark and be provided with to the distance of its direct-connected unlabelled some j: Vj=min
[Vj，Vk+lkj]
In the formula, lkj is the direct connection distance from a k to j.As Fig. 2, shown in Figure 6.V0 is 50 to the beeline of V3, the path of process be V0 → V4 → V3 and not chosen distance be path V0 → V2 → V3 of 60.
3) choose next point.From all unlabelled nodes, choose among the Vj a minimum i:Vi=min[Vj, all unlabelled some j] some i just be chosen as in the shortest path a bit, and be made as mark.
4) find that an i's is more preceding.From the point of mark, find the some j that is directly connected to an i
*,, be provided with: i=j as more preceding
*
5) gauge point i.If the mark of having a few, then algorithm is released fully, otherwise note k=i forwards 2 to) continue again.Referring to accompanying drawing 3, Fig. 7.V0 is 60 to the beeline of V5.If there is shortest path in s to j, preserve this path, we can disconnect any one node on this paths, ask the path one time according to top algorithm once more.If the path exists, can the affirmation system there be at least one loop in we so, and the result with twice analysis carries out V0 → V4 → V3 → V5 contrast then, simultaneously disconnecting between V0 and the V4, carry out the computing and the top class of algorithms once more seemingly, we can obtain the path of V0 → V5.Obtain a such ring of V0 → V4 → V3 → V5 → V0, the electric power cyclization that promptly obtains based on shortest path according to the present invention.According to said method, in case in the time of certain device fails, just can be according to the equipment state of computer real-time and the network topology relational network between the equipment, by equipment and computer real-time communication, networking in the computer is analyzed, judged between this point whether have winding, if exist, just export the path of winding, be used for engineering staff's reference.
As can be seen from the above, realize in the process of dijkstra's algorithm that core procedure is exactly a segmental arc of selecting a weights minimum from unlabelled point pressing labelling method, promptly 2 of process)～5) step.This is a recycle ratio process, if do not adopt this cyclic process, unmarked naming a person for a particular job deposited in the array with unordered form.If will select the segmental arc of a weights minimum just must all scan all points one time, under the situation of big data quantity, this is the bottleneck of a restriction computational speed beyond doubt.Address this problem, the most effective way is exactly that these weights of pressing its limit, place that will scan are carried out sequence arrangement, and every like this circulation primary can be got qualified point, can improve algorithm efficiency greatly.In addition, the data among the GIS will be carried out the calculating of shortest path, just the topological relation of building network at first.If represent this network with a matrix, not only requisite space is huge, and efficient can be very low.
Claims (3)
1. method based on shortest path for calculating power loop-closing path is characterized in that: comprise following three steps:
Data acquisition is a point with each apparatus settings in the electrical network, and apparatus for establishing information is done a corresponding relation in computer, count the computer system data storehouse;
The data of gathering are set up topological relation in computer;
Go out electric power cyclization path according to topological relationship calculation based on shortest path,
The described computational methods that go out based on the electric power cyclization path of shortest path according to topological relationship calculation are: the plane coordinates (Vj that sets each point, pj), wherein Vj is the length of the shortest path from originating point s to a j, pj is more preceding that j is ordered in the shortest path from s to j, find the solution the shortest path from originating point s to a j, algorithmic procedure is as follows:
1) initialization, originating point is set to: 1. Vs=0, ps are empty; 2. every other some Vi=∞, pi=? 3. mark originating point s remembers k=s, and other are made as unmarked a little;
2) check from all the some k of mark and be provided with to the distance of its direct-connected unlabelled some j
Vj＝min[Vj，Vk+lkj]
In the formula, lkj is the direct connection distance from a k to j;
3) choose next point, from all unlabelled nodes, choose minimum among a Vj i:
Vi=min[Vj, all unlabelled some j]
Point i just is chosen as a bit in the shortest path, and is made as mark;
4) find the more preceding of an i, from the point of mark, find the some j that is directly connected to an i
*, as more preceding,
Be set to: i=j
*
5) gauge point i, if the mark of having a few, algorithm is released fully, otherwise note k=i goes to 2) continue;
6) if there is shortest path in s to j, preserve this path, disconnect any one node on this paths, ask the path once more one time according to top algorithm, if the path exists, then can the affirmation system there be at least one loop;
7) result with twice analysis compares, and V0 → V4 → V3 → V5 will disconnect between V0 and the V4, carries out the computing and the top class of algorithms once more seemingly, obtains the path of V0 → V5, draw V0 → V4 → V3 → V5 → V0 → between be a ring.
2. the method based on shortest path for calculating power loop-closing path as claimed in claim 1, it is characterized in that: described is a point with each apparatus settings in the electrical network, apparatus for establishing information, it is the electric pressure of apparatus for establishing, the on off state of equipment, the situation the information whether electric pressure of equipment, equipment be charged.
3. the method based on shortest path for calculating power loop-closing path as claimed in claim 1 is characterized in that: described data with collection are set up topological relation in computer be that the annexation that equipment is connected with those equipment is stored in the plane coordinates of GIS GIS-Geographic Information System.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2009100585283A CN101826725B (en) | 2009-03-06 | 2009-03-06 | Method for calculating power loop-closing path based on shortest path |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2009100585283A CN101826725B (en) | 2009-03-06 | 2009-03-06 | Method for calculating power loop-closing path based on shortest path |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101826725A true CN101826725A (en) | 2010-09-08 |
| CN101826725B CN101826725B (en) | 2012-07-18 |
Family
ID=42690495
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2009100585283A Active CN101826725B (en) | 2009-03-06 | 2009-03-06 | Method for calculating power loop-closing path based on shortest path |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101826725B (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103020154A (en) * | 2012-11-23 | 2013-04-03 | 中国电力科学研究院 | Complete backspacing searching method for tracing reasons of power failure after appearance of power distribution network fault |
| CN103592568A (en) * | 2013-10-29 | 2014-02-19 | 天津大学 | Feeder line fault addressing method based on different-pulse peak sets |
| CN104143824A (en) * | 2012-10-22 | 2014-11-12 | 国网山东省电力公司青岛供电公司 | Method and system for acquiring power distribution reliability based on FTU |
| CN106444589A (en) * | 2016-12-06 | 2017-02-22 | 国网浙江省电力公司绍兴供电公司 | 30-degree phase angle difference distributing line loop closing and opening operation system |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN100438251C (en) * | 2006-12-08 | 2008-11-26 | 浙江大学 | A large electric system vulnerable line identifying method |
| CN101330457B (en) * | 2008-07-24 | 2011-03-23 | 安徽大学 | Method for searching shortest route based on quotient space overlay model |
-
2009
- 2009-03-06 CN CN2009100585283A patent/CN101826725B/en active Active
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104143824A (en) * | 2012-10-22 | 2014-11-12 | 国网山东省电力公司青岛供电公司 | Method and system for acquiring power distribution reliability based on FTU |
| CN104143824B (en) * | 2012-10-22 | 2016-03-16 | 国网山东省电力公司青岛供电公司 | A kind of power supply reliability acquisition methods based on FTU and system |
| CN103020154A (en) * | 2012-11-23 | 2013-04-03 | 中国电力科学研究院 | Complete backspacing searching method for tracing reasons of power failure after appearance of power distribution network fault |
| CN103592568A (en) * | 2013-10-29 | 2014-02-19 | 天津大学 | Feeder line fault addressing method based on different-pulse peak sets |
| CN103592568B (en) * | 2013-10-29 | 2016-05-25 | 天津大学 | Feeder fault addressing method based on different pulse crest group |
| CN106444589A (en) * | 2016-12-06 | 2017-02-22 | 国网浙江省电力公司绍兴供电公司 | 30-degree phase angle difference distributing line loop closing and opening operation system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101826725B (en) | 2012-07-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102751780B (en) | Wide area backup power auto-switch-on model self-adaptive generation method | |
| CN106374463B (en) | A kind of A+ classes power supply area power distribution network powering mode configuration method | |
| CN104578427A (en) | Fault self-healing method for power distribution network containing microgrid power source | |
| CN101826725B (en) | Method for calculating power loop-closing path based on shortest path | |
| CN105868869A (en) | Dynamic distribution automation terminal layout optimization planning method taking reliability and economic cost of power supply into account | |
| CN101409008A (en) | Integrated system for monitor, management and remotely meter-reading of power distribution network | |
| CN102213735A (en) | Typical test network with power distribution automation | |
| CN104537484A (en) | Power grid load loss risk assessment method based on PSASP model and emergency power supply automatic throw-in strategy | |
| CN112907051B (en) | Intelligent maintenance plan generation method based on allocation cooperation | |
| CN204348052U (en) | Low voltage electric network power information acquisition system | |
| CN107846015A (en) | Intelligent distribution network load transfer optimal route selection method based on peer-to-peer communication | |
| CN110197302B (en) | Power distribution network planning method considering wiring mode topology constraints | |
| CN105139081B (en) | A kind of distribution system contact point planing method of high reliability | |
| CN102496075B (en) | A kind of online data integration method based on internal memory | |
| CN114421461A (en) | Optimal algorithm-based power distribution network transfer auxiliary decision making system and method | |
| CN203896048U (en) | Ground fault detection system for power distribution networks | |
| WO2020125188A1 (en) | Power distribution network fault load transfer power restoration method | |
| CN112865090A (en) | Intelligent power distribution network fault recovery method based on organism immunity mechanism | |
| CN202383231U (en) | Undercurrent singlephase earth fault comprehensive line selection system | |
| CN112865313A (en) | Low-voltage distribution station topology identification system | |
| CN116760044A (en) | Comprehensive recovery method for load of power distribution network considering unmanned aerial vehicle emergency mobile base station | |
| CN104348131B (en) | A kind of recovery system and method based on intelligent distribution network 35kV power failures | |
| CN103051059A (en) | Feeder automation realizing method for residential area with smart distribution network | |
| CN110994588B (en) | Power distribution network structure assessment method suitable for investment planning | |
| CN113783184B (en) | Power distribution network multistage network reconstruction method based on weighted index optimization |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CP03 | Change of name, title or address | ||
| CP03 | Change of name, title or address |
Address after: 610094 16 / F, building 10, Tianfu Software Park, no.219, Tianhua Second Road, hi tech Zone, Chengdu, Sichuan Province Patentee after: Huayan Intelligent Technology (Group) Co., Ltd Address before: 610061, building 20, building B, Puli section, south section of first ring road, Sichuan, China Patentee before: Sichuan Whayer Information Industry Co., Ltd. |