CN103248041A - Looped network detection method based on bus depth conflict calculation - Google Patents

Looped network detection method based on bus depth conflict calculation Download PDF

Info

Publication number
CN103248041A
CN103248041A CN2013101087968A CN201310108796A CN103248041A CN 103248041 A CN103248041 A CN 103248041A CN 2013101087968 A CN2013101087968 A CN 2013101087968A CN 201310108796 A CN201310108796 A CN 201310108796A CN 103248041 A CN103248041 A CN 103248041A
Authority
CN
China
Prior art keywords
bus
calculating
looped network
depth
degree
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
Application number
CN2013101087968A
Other languages
Chinese (zh)
Other versions
CN103248041B (en
Inventor
马康
刘军
刘海涛
吕广宪
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
State Grid Corp of China SGCC
China Electric Power Research Institute Co Ltd CEPRI
State Grid Shandong Electric Power Co Ltd
Qingdao Power Supply Co of State Grid Shandong Electric Power Co Ltd
Original Assignee
State Grid Corp of China SGCC
China Electric Power Research Institute Co Ltd CEPRI
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by State Grid Corp of China SGCC, China Electric Power Research Institute Co Ltd CEPRI filed Critical State Grid Corp of China SGCC
Priority to CN201310108796.8A priority Critical patent/CN103248041B/en
Publication of CN103248041A publication Critical patent/CN103248041A/en
Application granted granted Critical
Publication of CN103248041B publication Critical patent/CN103248041B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Abstract

The invention relates to a looped network detection method based on bus depth conflict calculation. The looped network detection method comprises the following steps: traversing the calculating bus in the distribution network active island in a looped manner; judging whether the calculating bus i and looped network exit; searching in reverse flow from calculating buses j and k to calculating with the depth of O, and storing the calculating buses of the two paths into two arrays respectively; deleting one repeated calculating bus in the two arrays; determining all the calculating buses in the looped network; converting all the calculating buses to nodes to obtain all the nodes in the looped network; storing the looped network into a two-dimensional array as one row a nodes; storing all the loops in the active island and nodes in every loop by the two-dimensional array after all the calculating buses are traversed in a looped manner; and deleting repeated loops in the two-dimensional array and outputting final two-dimensional array. The looped network detection method disclosed by the invention can judge the existence of two classes of looped networks, and identify all the nodes in the loops, so that operation and control personnel of the distribution network can detect with a purpose to modify wrong telecommand data.

Description

A kind of based on the looped network detection method of calculating the conflict of the bus degree of depth
Technical field
The present invention relates to field of power, be specifically related to a kind of based on the looped network detection method of calculating the conflict of the bus degree of depth.
Background technology
The 10kV power distribution network looped network should not occur when normal operation.But because the mistake of real-time remote signalling data, looped network can appear in the topology that the power distribution network main station system is known, brings obstacle for follow-up calculating, emulation and control.
Traditional looped network detects according to the quantitative relation of point with the limit, can only survey the existence of looped network in this electric pressure (as 10kV) network.But if do not provide the more network of voltage levels (as 110kV), then can't consider to stride the existence of looped network in electric pressure (110kV and the 10kV) network.
Summary of the invention
At the deficiencies in the prior art, the purpose of this invention is to provide a kind of based on the looped network detection method of calculating the conflict of the bus degree of depth, method involved in the present invention is to need not to provide the topology of an electric pressure electrical network, can judge the existence of two class looped networks, comprise the interior looped network of this electric pressure and stride the electric pressure looped network, and identify all rings and go up node, this result can verify targetedly for power distribution network operation control personnel, with the remote signalling data that correct mistakes.
The objective of the invention is to adopt following technical proposals to realize:
A kind of based on the looped network detection method of calculating the conflict of the bus degree of depth, its improvements are that described method comprises the steps:
(1) the calculating bus in the active island of searching loop power distribution network;
(2) judge whether to exist calculating bus i, and then judge whether to exist looped network;
(3) be the search starting point to calculate bus j and k respectively, it is 0 calculating bus that adverse current is searched for to the degree of depth, and the calculating bus of two paths is deposited in respectively in two arrays;
(4) one of the calculating bus deletion that two arrays is repeated;
(5) determine calculating buses all on the looped network;
(6) all calculating buses on the looped network described in the step (5) are converted into node, then obtain nodes all on the looped network;
(7) deposit looped network in two-dimensional array as delegation's node;
(8) searching loop is after all calculate buses, and described two-dimensional array is preserved all rings active island in and all nodes that each encircles;
(9) ring that repeats in the deletion two-dimensional array, the two-dimensional array of output final result.
Preferably, in the described step (2), described calculating bus i satisfies: the calculating bus j that links to each other with described calculating bus i and the degree of depth of k all are not more than the degree of depth of calculating bus i;
Calculate bus i if exist, then have looped network, and calculate bus i on looped network.
Preferably, in the described step (3), be the search starting point to calculate bus j and k, it is 0 calculating bus that adverse current is searched for to the degree of depth, deposits the calculating bus on this two paths in expe_bs1 and expe_bs2 array respectively.
Preferably, in the described step (5), the calculating bus in the expe_bs1 array is arranged in proper order, the calculating bus backward in the expe_bs2 array is arranged and mended in the back of expe_bs1 array, add at last and calculate bus i, obtain calculating buses all on the single looped network.
Preferably, in the described step (6), according to the corresponding relation of the one-to-many that calculates bus and node, be converted into node calculating bus on the single looped network, obtain all nodes on the single looped network.
Preferably, in the described step (7), deposit described single looped network in two-dimensional array loop_set as delegation's node.
Preferably, in the described step (8), behind all calculating buses of searching loop, all nodes in the active island of two-dimensional array loop_set preservation power distribution network on all looped networks and each ring.
Preferably, in the described step (9), the ring that repeats among the deletion two-dimensional array loop_set, the two-dimensional array of output final result.
Compared with the prior art, the beneficial effect that reaches of the present invention is:
1, provided by the invention based on the looped network detection method of calculating the conflict of the bus degree of depth, the characteristic of abundant mining data structure is so that logic and succinct program are finished complex task clearly.
2, provided by the invention accurate based on the looped network detection method of calculating the conflict of the bus degree of depth: method of the present invention is through practical proof, no matter to the looped network of 10kV network internal or extend to the more looped network of voltage levels, whether all can 100% detect the existence of looped network, if exist, then point out all nodes on the looped network.
3, provided by the invention efficient based on the looped network detection method of calculating the conflict of the bus degree of depth: the search efficiency height, satisfy the operation phase fully to the requirement of real-time.
4, method of the present invention is to need not to provide the topology of an electric pressure electrical network, can judge the existence of two class looped networks, comprise the interior looped network of this electric pressure and stride the electric pressure looped network, and identify all rings and go up node, this result can verify targetedly for power distribution network operation control personnel, with the remote signalling data that correct mistakes.
Description of drawings
Fig. 1 is provided by the invention based on the looped network detection method flow chart that calculates the conflict of the bus degree of depth;
Fig. 2 is provided by the invention based on the adverse current search routine figure that calculates the bus degree of depth.
Embodiment
Below in conjunction with accompanying drawing the specific embodiment of the present invention is described in further detail.
One, the following technical term that the present invention is occurred makes an explanation:
Node: the elementary cell of power distribution network is the physical endpoint of feeder line section or switch.
Feeder line section: be one section distribution line, the electric current size and Orientation does not all change on this section circuit, and its two ends are the place that size of current or direction change.
Feeder line: one section distribution line starts from Circuit Fault on Secondary Transformer in the transformer station, till line end.
The island: power supply point (transformer) in the transformer station, all and this power supply point have the element set of communication path.Island as referred to herein all contains power supply, i.e. active island.
Distribution transforming: load transformer can refer to load.
The physics bus: i.e. the bus of necessary being is arranged in transformer station, switching station, ring main unit.
Virtual bus: for ease of calculating, Closing Switch two end nodes are merged into an imaginary bus, be virtual bus.
Calculate bus: comprise physics bus and virtual bus.
The degree of depth: be the attribute of node, calculating bus, to characterize the electrical distance distance of element and power supply more than or equal to 0 integer.Power supply node and the corresponding degree of depth of calculating bus thereof are 0, and the more little element of then representing of the degree of depth is more near to the electrical distance of power supply.
Two, it is as shown in table 1 to introduce arranging of power distribution network data structure that this algorithm relies on and element depth below:
Table 1 power distribution network data structure and element depth table is set
Figure BDA00002989964800031
Figure BDA00002989964800041
1, following rule is followed in the degree of depth setting of element:
1) degree of depth with the direct-connected calculating bus of power supply is 0;
2) degree of depth of feeder line section two ends calculating bus differs 1;
3) degree of depth of calculating bus is nonnegative integer.
2, the topological relation that calculates bus and feeder line section is represented according to following rule:
If arbitrary calculating bus i is feeder line section i 1, i 2... i nCertain end points, then calculate bus i and point to aforementioned feeder line section, the numbering that is about to this feeder line section deposits the ptr_sec member variable (shaping digit group type) that calculates bus i in; Aforementioned feeder line section is pointed to and is calculated bus i, is about to aforementioned feeder line section i mPtr_ibs or ptr_zbs assignment be i, if feeder line section i mHeadend node be node i, feeder line section i then mPtr_ibs=i, otherwise feeder line section i mPtr_zbs=i.
Calculating the corresponding relation of bus and node represents according to following rule:
If node i 1, i 2... i nBelong to and calculate bus i(and namely calculate bus i and comprise node i 1, i 2... i n, namely these nodes are linked to each other by the switch that is in closure state in twos), then with i 1, i 2... i nDeposit the ptr_nd member variable (integer digit group type) that calculates bus i in.
Embodiment
Two-dimensional array loop_set will preserve all rings and go up node, and this two-dimensional array constitutes a matrix, and any delegation of matrix represents a ring, and matrix column representative ring is gone up node.
Provided by the invention based on the looped network detection method of calculating the conflict of the bus degree of depth as shown in Figure 1, for arbitrary active island m, the flow process that detects node on looped network and the identification ring is as follows:
(1) all calculate bus in the m of searching loop island;
(2) judge whether exist to calculate bus i, if there is such calculating bus i, the degree of depth of calculating bus j, k that its institute directly links to each other is all smaller or equal to the degree of depth of calculating bus i, and then calculating bus i must be on encircling.
By the existence of searching loop calculating bus fast detecting looped network, as long as namely there is such calculating bus i, it directly links to each other with the calculating bus that the two or more degree of depth are not more than calculating bus i, then must have looped network, and aforementioned calculating bus is on ring.
Needn't provide the 110kV network topology, only need provide the 10kV network topology, can detect the looped network existence in the 10kV network and stride 110kV and the looped network existence of 10kV network, and can find out all nodes on the 10kV side ring.
(3) be starting point to calculate bus j and k respectively, adverse current search for to the degree of depth be 0 generally to refer to power supply in the power distribution network for the 0(degree of depth) the calculating bus, deposit the calculating bus on this two paths in expe_bs1 and expe_bs2 array respectively.
To calculate bus but not node is the elementary cell direction adverse current little along feeder line to the degree of depth searches for to power supply, find out ring thus and go up all and calculate buses, be converted into node again.Owing to calculate the node that bus has merged the switch both sides that are in closure state, so network element is conceptualized as only remaining Points And lines section, and problem obtains simplifying.
Differentiate the existence of looped network according to degree of depth conflict, and obtain at least three calculating buses on the looped network, as the starting point of adverse current search.
(4) the calculating bus that repeats in two arrays is deleted one.
Provided by the invention based on the adverse current search routine of calculating the bus degree of depth as shown in Figure 2, with adverse current search send out search the calculating bus that power supply connected after, calculating bus on the searching route of left side is with sequential storage, calculating bus on the searching route of right side is stored with backward, double counting bus on the two-sided search path only keeps one, then ring go up to calculate putting in order of bus and is the calculating bus that there is degree of depth conflict, calculating bus on the path, left side of sequential storage, the calculating bus on the path, right side of backward storage (remove with path, left side on the calculating bus that repeats).Constitute ring thus and go up the arranged clockwise of calculating bus.
(5) the calculating bus among the expe_bs1 is arranged in proper order, the calculating bus backward among the expe_bs2 is arranged and mended the back in expe_bs1, fill at last and calculate bus i, then these calculate all the calculating buses on ring of bus formation.
(6) according to the corresponding relation that calculates bus and node, namely calculate the one-to-many corresponding relation of bus and node, be converted into node calculating bus, then obtain all nodes on the ring.
(7) should encircle as delegation's node and deposited two-dimensional array loop_set in.
(8) behind all calculating buses of searching loop, loop_set has preserved all nodes on interior all rings of island m and each ring.
(9) ring that repeats among the deletion loop_set, then exportable final result---two-dimensional array loop_set.
Method involved in the present invention is to need not to provide the topology of an electric pressure electrical network, can judge the existence of two class looped networks, comprise the interior looped network of this electric pressure and stride the electric pressure looped network, and identify all rings and go up node, this result can verify targetedly for power distribution network operation control personnel, with the remote signalling data that correct mistakes.
Should be noted that at last: above embodiment is only in order to illustrate that technical scheme of the present invention is not intended to limit, although with reference to above-described embodiment the present invention is had been described in detail, those of ordinary skill in the field are to be understood that: still can make amendment or be equal to replacement the specific embodiment of the present invention, and do not break away from any modification of spirit and scope of the invention or be equal to replacement, it all should be encompassed in the middle of the claim scope of the present invention.

Claims (8)

1. the looped network detection method based on the conflict of the calculating bus degree of depth is characterized in that described method comprises the steps:
(1) the calculating bus in the active island of searching loop power distribution network;
(2) judge whether to exist calculating bus i, and then judge whether to exist looped network;
(3) be the search starting point to calculate bus j and k respectively, it is 0 calculating bus that adverse current is searched for to the degree of depth, and the calculating bus of two paths is deposited in respectively in two arrays;
(4) one of the calculating bus deletion that two arrays is repeated;
(5) determine calculating buses all on the looped network;
(6) all calculating buses on the looped network described in the step (5) are converted into node, then obtain nodes all on the looped network;
(7) deposit looped network in two-dimensional array as delegation's node;
(8) searching loop is after all calculate buses, and described two-dimensional array is preserved all rings active island in and all nodes that each encircles;
(9) ring that repeats in the deletion two-dimensional array, the two-dimensional array of output final result.
2. as claimed in claim 1 based on the looped network detection method of calculating the conflict of the bus degree of depth, it is characterized in that, in the described step (2), described calculating bus i satisfies: the calculating bus j that links to each other with described calculating bus i and the degree of depth of k all are not more than the degree of depth of calculating bus i;
Calculate bus i if exist, then have looped network, and calculate bus i on looped network.
3. as claimed in claim 1 based on the looped network detection method of calculating the conflict of the bus degree of depth, it is characterized in that, in the described step (3), be the search starting point to calculate bus j and k, it is 0 calculating bus that adverse current is searched for to the degree of depth, deposits the calculating bus on this two paths in expe_bs1 and expe_bs2 array respectively.
4. as claimed in claim 1 based on the looped network detection method of calculating the conflict of the bus degree of depth, it is characterized in that, in the described step (5), calculating bus in the expe_bs1 array is arranged in proper order, calculating bus backward in the expe_bs2 array is arranged and mended in the back of expe_bs1 array, add at last and calculate bus i, obtain calculating buses all on the single looped network.
5. as claimed in claim 1 based on the looped network detection method of calculating the conflict of the bus degree of depth, it is characterized in that, in the described step (6), according to the corresponding relation of the one-to-many that calculates bus and node, be converted into node calculating bus on the single looped network, obtain all nodes on the single looped network.
6. the looped network detection method based on the conflict of the calculating bus degree of depth as claimed in claim 1 is characterized in that, in the described step (7), deposits described single looped network in two-dimensional array loop_set as delegation's node.
7. as claimed in claim 1 based on the looped network detection method of calculating the conflict of the bus degree of depth, it is characterized in that, in the described step (8), behind all calculating buses of searching loop, all nodes in the active island of two-dimensional array loop_set preservation power distribution network on all looped networks and each ring.
8. the looped network detection method based on the conflict of the calculating bus degree of depth as claimed in claim 1 is characterized in that, in the described step (9), and the ring that repeats among the deletion two-dimensional array loop_set, the two-dimensional array of output final result.
CN201310108796.8A 2013-03-29 2013-03-29 Looped network detection method based on bus depth conflict calculation Active CN103248041B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201310108796.8A CN103248041B (en) 2013-03-29 2013-03-29 Looped network detection method based on bus depth conflict calculation

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201310108796.8A CN103248041B (en) 2013-03-29 2013-03-29 Looped network detection method based on bus depth conflict calculation

Publications (2)

Publication Number Publication Date
CN103248041A true CN103248041A (en) 2013-08-14
CN103248041B CN103248041B (en) 2015-01-21

Family

ID=48927348

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201310108796.8A Active CN103248041B (en) 2013-03-29 2013-03-29 Looped network detection method based on bus depth conflict calculation

Country Status (1)

Country Link
CN (1) CN103248041B (en)

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104050536A (en) * 2014-06-20 2014-09-17 国家电网公司 Topology analysis method for power distribution network crossing voltage grades
CN104122470A (en) * 2014-07-28 2014-10-29 国家电网公司 Method for determining looped operation of power distribution network
CN104537219A (en) * 2014-12-18 2015-04-22 贵州电网公司信息通信分公司 Electrification initialization method for power distribution network dynamic topology
CN108695847A (en) * 2018-05-29 2018-10-23 国网河南省电力公司南阳供电公司 A method of realizing that power distribution network dynamic topology calculates using deep identification method
CN112528449A (en) * 2021-01-01 2021-03-19 谭世克 Power distribution network computing bus forming method

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101436789A (en) * 2008-12-26 2009-05-20 北京市电力公司调度通信中心 Method for implementing power supply backward in scheduling automatization system
CN102185297A (en) * 2011-05-10 2011-09-14 中国电力科学研究院 Method for controlling system recovery based on network reconfiguration
WO2012161378A1 (en) * 2011-05-25 2012-11-29 (주)파워이십일 Method for estimating the status of a power distribution system

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101436789A (en) * 2008-12-26 2009-05-20 北京市电力公司调度通信中心 Method for implementing power supply backward in scheduling automatization system
CN102185297A (en) * 2011-05-10 2011-09-14 中国电力科学研究院 Method for controlling system recovery based on network reconfiguration
WO2012161378A1 (en) * 2011-05-25 2012-11-29 (주)파워이십일 Method for estimating the status of a power distribution system

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
杨雄平: "电力系统网络拓扑结构分析及运行方式组合研究", 《中国博士学位论文全文数据库》 *
韩学军等: "基于FVSI线稳定指标计算母线最大承载负荷确定电力系统弱母线的方法", 《广东电力》 *

Cited By (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104050536A (en) * 2014-06-20 2014-09-17 国家电网公司 Topology analysis method for power distribution network crossing voltage grades
CN104050536B (en) * 2014-06-20 2017-05-10 国家电网公司 Topology analysis method for power distribution network crossing voltage grades
CN104122470A (en) * 2014-07-28 2014-10-29 国家电网公司 Method for determining looped operation of power distribution network
CN104537219A (en) * 2014-12-18 2015-04-22 贵州电网公司信息通信分公司 Electrification initialization method for power distribution network dynamic topology
CN104537219B (en) * 2014-12-18 2017-08-04 贵州电网公司信息通信分公司 The method of the powered initialization of power distribution network dynamic topology
CN108695847A (en) * 2018-05-29 2018-10-23 国网河南省电力公司南阳供电公司 A method of realizing that power distribution network dynamic topology calculates using deep identification method
CN112528449A (en) * 2021-01-01 2021-03-19 谭世克 Power distribution network computing bus forming method
CN112528449B (en) * 2021-01-01 2022-07-05 青岛公能新能源科技有限公司 Power distribution network computing bus forming method

Also Published As

Publication number Publication date
CN103248041B (en) 2015-01-21

Similar Documents

Publication Publication Date Title
CN103762591B (en) A kind of power distribution network topology layout method
CN103001216B (en) Method for quickly restoring power supply of power distribution network containing distributed power source
CN103248041A (en) Looped network detection method based on bus depth conflict calculation
CN104578427B (en) Fault self-healing method for power distribution network containing microgrid power source
CN104218673A (en) Automatic intelligent power grid partitioning method
CN107024638A (en) A kind of electrical power distribution network fault location method and device based on modified evolutionary programming
CN103218478B (en) Depth Priority Searching and the search system of topological isolated island is eliminated for power distribution network
CN103795057B (en) Based on the power distribution network topology numbering generation method of search in distribution power system load flow calculation
CN109494719B (en) Hierarchical impedance analysis method for medium-low voltage hybrid power distribution network
CN109474023B (en) Intelligent power distribution network section real-time updating method and system, storage medium and terminal
CN102880641B (en) Parametric bus transfer method in consideration of short-distance walking station pair
CN105976048A (en) Power transmission network extension planning method based on improved artificial bee colony algorithm
CN105631768B (en) The coding method of radial topological structure in a kind of quick obtaining ring distribution system
CN107025524B (en) Equipment overload auxiliary decision-making method considering load power supply reliability requirement
CN104917293A (en) Topological mapping method for secondary virtual and physical links of intelligent substation
CN103066689A (en) Online selection system of load transferring paths of 10kV feeders
CN104393590A (en) Intelligent identification method of transient instability mode of power grid
Zhang et al. Network topology identification algorithm based on adjacency matrix
Liu et al. Importance evaluation of power network nodes based on community division and characteristics of coupled network
CN105894173B (en) A kind of service restoration scheme generation method based on multiway tree search
CN106877497A (en) A kind of electric power terminal communication access net and optimization method
CN106886655A (en) A kind of improvement minimal path reliability based on distribution geographical topology data determines method
CN110752594B (en) Power distribution network path optimization method based on improved aggregation hierarchical clustering method
CN103414788A (en) System and method for processing power distribution network data based on level peer-to-peer network
CN113783184A (en) Power distribution network multilevel network reconstruction method based on weighting 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
ASS Succession or assignment of patent right

Owner name: CHINA ELECTRIC POWER RESEARCH INSTITUTE STATE GRID

Free format text: FORMER OWNER: CHINA ELECTRIC POWER RESEARCH INSTITUTE

Effective date: 20131212

C41 Transfer of patent application or patent right or utility model
TA01 Transfer of patent application right

Effective date of registration: 20131212

Address after: 100031 Xicheng District West Chang'an Avenue, No. 86, Beijing

Applicant after: State Grid Corporation of China

Applicant after: China Electric Power Research Institute

Applicant after: State Grid Shandong Electric Power Company

Applicant after: Qingdao Power Supply Company, State Grid Shandong Electric Power Company

Address before: 100031 Xicheng District West Chang'an Avenue, No. 86, Beijing

Applicant before: State Grid Corporation of China

Applicant before: China Electric Power Research Institute

C14 Grant of patent or utility model
GR01 Patent grant