CN110197305A - A kind of relay protection data model chess game optimization method and system based on shortest path first - Google Patents
A kind of relay protection data model chess game optimization method and system based on shortest path first Download PDFInfo
- Publication number
- CN110197305A CN110197305A CN201910471052.XA CN201910471052A CN110197305A CN 110197305 A CN110197305 A CN 110197305A CN 201910471052 A CN201910471052 A CN 201910471052A CN 110197305 A CN110197305 A CN 110197305A
- Authority
- CN
- China
- Prior art keywords
- data
- node
- association
- data model
- relay protection
- 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
- 238000013499 data model Methods 0.000 title claims abstract description 117
- 238000005457 optimization Methods 0.000 title claims abstract description 37
- 238000000034 method Methods 0.000 title claims abstract description 32
- 238000004422 calculation algorithm Methods 0.000 claims abstract description 9
- 238000004321 preservation Methods 0.000 claims abstract description 7
- 239000013589 supplement Substances 0.000 claims description 28
- 238000004364 calculation method Methods 0.000 claims description 12
- 238000012935 Averaging Methods 0.000 claims description 6
- 230000002776 aggregation Effects 0.000 claims description 6
- 238000004220 aggregation Methods 0.000 claims description 6
- 238000013507 mapping Methods 0.000 claims description 4
- 230000000875 corresponding effect Effects 0.000 description 21
- 230000001681 protective effect Effects 0.000 description 13
- 230000008859 change Effects 0.000 description 8
- 238000011156 evaluation Methods 0.000 description 3
- 238000007726 management method Methods 0.000 description 3
- 230000008569 process Effects 0.000 description 3
- 230000008901 benefit Effects 0.000 description 2
- 238000004590 computer program Methods 0.000 description 2
- 238000011161 development Methods 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 238000007689 inspection Methods 0.000 description 2
- 238000004458 analytical method Methods 0.000 description 1
- 238000013473 artificial intelligence Methods 0.000 description 1
- 238000006243 chemical reaction Methods 0.000 description 1
- 230000002596 correlated effect Effects 0.000 description 1
- 238000013500 data storage Methods 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000003745 diagnosis Methods 0.000 description 1
- 230000008030 elimination Effects 0.000 description 1
- 238000003379 elimination reaction Methods 0.000 description 1
- 230000004927 fusion Effects 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
- 238000012423 maintenance Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 238000012544 monitoring process Methods 0.000 description 1
- 238000013139 quantization Methods 0.000 description 1
- 230000008439 repair process Effects 0.000 description 1
- 230000004044 response Effects 0.000 description 1
- 238000007619 statistical method Methods 0.000 description 1
- 238000006467 substitution reaction 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/0639—Performance analysis of employees; Performance analysis of enterprise or organisation operations
- G06Q10/06393—Score-carding, benchmarking or key performance indicator [KPI] analysis
-
- 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—Systems or methods specially adapted for specific business sectors, e.g. utilities or tourism
- G06Q50/06—Electricity, gas or water supply
Abstract
The relay protection data model chess game optimization method and system based on shortest path first that the invention discloses a kind of; the described method includes: acquisition relay protection data; the relay protection data include the tables of data of multiple and different types, include a certain amount of data in each tables of data；Data model is established according to the incidence relation between the data object of the relay protection data；Increase the reference association between the tables of data of the data model according to preset rules；The superiority index that each reference is associated in association front and back data model is calculated, if superiority index saves reference association better than the superiority index before association after association for the reference association；The reference association of all preservations is added in data model, the relay protection data model of structure optimization is obtained；A specific node in the data model is accessed in a certain start node to calculate by dijkstra's algorithm there are when mulitpath and obtain shortest path.
Description
Technical field
The present invention relates to technical field of electric power, more particularly, to a kind of relay protection number based on shortest path first
According to pattern search optimization method and system.
Background technique
Relay protection specialized management includes protective device state evaluation, motion analysis, cover defect elimination, maintenance, it is counter arrange, skill
Change, the whole-life cycle fee that inspection is maked an inspection tour, is distributed in relay protection statistical analysis and operational management, relay protection state evaluation
And repair based on condition of component, relay protection and fault information system, failure wave-recording networked system, in-service monitoring and intelligent diagnosis system, SCD
In multiple relay protection professional software systems such as file managing and control system.Relay protection specialized information obtaining means are increasingly rich, letter
Breath integrality is constantly promoted, however, different information systems are relatively independent, data interaction is limited, it is difficult to be relay protection profession pipe
Reason provides global application support.It is run to the requirements at the higher level of relay protection using alternating current-direct current mixed connection bulk power grid as target, and along with
The fast development of big data and artificial intelligence technology, relay protection specialized management are undergoing different relay protection professional system numbers
According to fusion, the career development process of in-depth relay protection global application.Relay protection data model is between data object at present
Basic incidence relation be foundation, incidence relation between data object is organized by business procedure.
Various types protective relaying device is numerous, and the data object that different classes of, different characteristics protective device includes is abundant,
Different data Properties of Objects, data volume, flowing of access have suitable difference, and the associate feature between data object is different, including one
To one, one-to-many, many-one, many-to-many relationship etc., data model structure reasonability accesses data to relay protection service application
Efficiency generate direct influence；The unreasonable access efficiency that can seriously affect magnanimity isomeric data of data model structure.Having must
Consider the incidence relation between different data plant characteristic, data volume, the otherness of flowing of access and different data object,
Relay protection expert data access path is optimized, promotes professional application to the access efficiency of magnanimity isomeric data.
Summary of the invention
In order to solve the unreasonable access that can seriously affect magnanimity isomeric data of data model structure existing for background technique
The problem of efficiency, the relay protection data model chess game optimization method based on shortest path first that the present invention provides a kind of and it is
System, the method and system are excellent by the layering to data model by the way that relay protection data are mapped as network data model
Change and reference is associated with, optimizes the structure of relay protection data model, to improve search access efficiency；It is described a kind of based on most short
The relay protection data model chess game optimization method of routing algorithm includes:
Relay protection data are acquired, the relay protection data include the tables of data of multiple and different types, each tables of data
Interior includes a certain amount of data；
Data model is established according to the incidence relation between the data object of the relay protection data；Wherein, the data
Table is mapped as the node of data model, tables of data access order is mapped as the path of data model, the mapping of the data volume of tables of data
For path length；
Increase the reference association between the tables of data of the data model according to preset rules；
The superiority index that each reference is associated in association front and back data model is calculated, if superiority after reference association
Index then saves reference association better than the superiority index before association；The superiority index includes average road length, cluster system
Several and average degree；
The reference association of all preservations is added in data model, the relay protection data model of structure optimization is obtained；
A specific node in the data model is accessed in a certain start node to pass through there are when mulitpath
Dijkstra's algorithm, which calculates, obtains shortest path.
Further, the incidence relation between the data object according to the relay protection data establishes data model,
Include:
According to the level incidence relation of entity described in the data object of the relay protection data itself, data are constructed
Model structure.
Further, the reference association includes directly supplement association；
The directly supplement association is for there is no two nodes in path to establish association；Each of two nodes
In the presence of there are the new nodes in path with the node, association is established to two new nodes.
Further, the reference association includes recursion supplement association；
The recursion supplement association is for corresponding to the start node in two nodes for having existed at least one path
Tables of data attribute field in increase redundancy it is external, realization corresponding data in another node corresponding data table in the path is drawn
With.
Further, the average value of the shortest path length between the average a length of every two node in road；The average road
The calculation formula of long L are as follows:
Wherein, n is number of nodes, dijFor the shortest path length of i-th of node j node on earth；If between two nodes
There is no path, then corresponding dijIt is 0.
Further, for the cluster coefficient for indicating data model interior joint aggregation extent, the cluster coefficient C is every
The cluster degree C of one nodeiAverage value, the cluster degree C of each nodeiCalculation formula are as follows:
Wherein, kiIndicate the number for the node being connected with i-th of node, tiFor i-th of node and kiA connected node
Between side quantity.
Further, the average degree presses each node corresponding data by the degree of all nodes in the data model
The inverse of the data volume of table is that weight is averaging acquisition；The degree of the node is the quantity on the side of connection on this node.
A kind of relay protection data model chess game optimization system based on shortest path first includes:
Data acquisition unit, the data acquisition unit is for acquiring relay protection data, the relay protection data packet
The tables of data of multiple and different types is included, includes a certain amount of data in each tables of data；
Data model establishes unit, and the data model establishes unit for the data pair according to the relay protection data
As incidence relation establish data model；Wherein, the tables of data is mapped as the node of data model, tables of data access order
The data volume in the path, tables of data that are mapped as data model is mapped as path length；
Associative cell is quoted, the reference associative cell is used to increase according to preset rules the tables of data of the data model
Between reference association；
Optimize judging unit, the optimization judging unit is used to calculate each reference and is associated in association front and back data model
Superiority index, if superiority index saves reference association better than the superiority index before association after the reference association；
The superiority index includes long average road, cluster coefficient and average degree；
The optimization judging unit is used to add to the reference association of all preservations in data model, obtains structure optimization
Relay protection data model；
Shortest path computing unit, there are a plurality of for a specific node in a certain start node access data model
When path, the shortest path computing unit is calculated by dijkstra's algorithm and obtains shortest path.
Further, the data model establishes unit for according to described by the data object of the relay protection data
Entity itself level incidence relation, construct data model structure.
Further, the reference associative cell carries out reference association by directly supplement association；
The directly supplement association is for there is no two nodes in path to establish association；Each of two nodes
In the presence of there are the new nodes in path with the node, association is established to two new nodes.
Further, the reference associative cell carries out reference association by recursion supplement association；
The recursion supplement association is for corresponding to the start node in two nodes for having existed at least one path
Tables of data attribute field in increase redundancy it is external, realization corresponding data in another node corresponding data table in the path is drawn
With.
Further, the optimization judging unit is long for calculating average road；Between the average a length of every two node in road
Shortest path length average value；The calculation formula of the average long L in road are as follows:
Wherein, n is number of nodes, dijFor the shortest path length of i-th of node j node on earth；If between two nodes
There is no path, then corresponding dijIt is 0.
Further, the optimization judging unit is used for computing cluster coefficient；The cluster coefficient is for indicating data mould
Type interior joint aggregation extent, the cluster coefficient C are the cluster degree C of each nodeiAverage value, each described node
Cluster degree CiCalculation formula are as follows:
Wherein, kiIndicate the number for the node being connected with i-th of node, tiFor i-th of node and kiA connected node
Between side quantity.
Further, the optimization judging unit is for calculating average degree；The average degree passes through the data mould
The degree of all nodes is that weight is averaging acquisition by the inverse of the data volume of each node corresponding data table in type；The node
The quantity on side of the degree for connection on this node.
The invention has the benefit that technical solution of the present invention, gives a kind of relay based on shortest path first
Data model chess game optimization method and system are protected, it is interrelated between the method and system consideration relay protection data object,
Data object is abstracted as network node, relay protection data model is characterized using latticed form, so that relay protection data mould
Type structure and chess game optimization are converted to network data model structure optimization and search for the optimal path of complex network；The method and
System is by the hierarchy optimization to data model and quotes association, optimizes the structure of relay protection data model, improves specially
Industry applies the access efficiency to magnanimity isomeric data.
Detailed description of the invention
By reference to the following drawings, exemplary embodiments of the present invention can be more fully understood by:
Fig. 1 is that a kind of relay protection data model search based on shortest path first of the specific embodiment of the invention is excellent
The flow chart of change method；
Fig. 2 is that a kind of relay protection data model search based on shortest path first of the specific embodiment of the invention is excellent
The structure chart of change system.
Specific embodiment
Exemplary embodiments of the present invention are introduced referring now to the drawings, however, the present invention can use many different shapes
Formula is implemented, and is not limited to the embodiment described herein, and to provide these embodiments be at large and fully disclose
The present invention, and the scope of the present invention is sufficiently conveyed to person of ordinary skill in the field.Show for what is be illustrated in the accompanying drawings
Term in example property embodiment is not limitation of the invention.In the accompanying drawings, identical cells/elements use identical attached
Icon note.
Unless otherwise indicated, term (including scientific and technical terminology) used herein has person of ordinary skill in the field
It is common to understand meaning.Further it will be understood that with the term that usually used dictionary limits, should be understood as and its
The context of related fields has consistent meaning, and is not construed as Utopian or too formal meaning.
Fig. 1 is that a kind of relay protection data model search based on shortest path first of the specific embodiment of the invention is excellent
The flow chart of change method；As shown in Figure 1, which comprises
Step 110, relay protection data are acquired, the relay protection data include the tables of data of multiple and different types, often
It include a certain amount of data in a tables of data；
In the present embodiment, the relay protection data include existing a variety of data during relay protection, for example including
Protective device, board information, warning information, alarm configuration, data set, IED configuration etc.；Above-mentioned each (such as board information)
The data of type, correspond to a tables of data, include the data of certain data volume in each tables of data.
Step 120, data model is established according to the incidence relation between the data object of the relay protection data；Wherein,
The tables of data is mapped as the node of data model, tables of data access order is mapped as the number in the path of data model, tables of data
Path length is mapped as according to amount；
The data object of relay protection data is the description to different entities characteristic, these entities include protective device type
Number, protective device, protective device plug-in unit, device internal information etc..Establishing relay protection data model should be according to data model pair
The hierarchical relationship of entity as described in itself constructs parallel data model structure, so that the key node of data model structure
Just for the data model of the key message of each gradation entity, the data model for avoiding key node from selecting high-level entity leads to letter
Breath description is insufficient, for example, selecting the number of description protective device model on the critical data model node of protective relaying device
According to model, protective device model can not reflect the individual information of protective device, be unable to satisfy service application demand；It avoids closing simultaneously
Key node selects the data model of low level entity to cause key node data re-quantization, for example, in the pass of protective relaying device
The data model that description protective device plug-in unit or internal information are selected on key data model node, causes to access the key node
Time-consuming increases, and seriously reduces efficiency data query.Pass through the hierarchical relationship point by data model objects according to entity described by it
Layout layer can choose light-weighted modeling scheme for the key node in data model structure, effectively promote access critical section
The efficiency of point.
In the present embodiment, incidence relation of the path between two nodes, i.e. tables of data access order；For not direct
Two connected nodes, path may be to be formed by other nodes, it is also possible to path be not present.
The path length is mapped by the data volume of tables of data, in the present embodiment, by will count contained by reference data table
Query time mapping path length is converted to according to amount.
Under typical data storage architecture, the average response time of a tables of data is inquiredAre as follows:
In formula, C1It is the number of servers of inquiry application deployment.k1It is routing coefficient, is constant under cluster environment, it is typical
Value is 65.R1It is the routing addressing number of single inquiry.Such as under HBase framework, R1Take 2 (HBase0.94 or less versions) or
3 (HBase0.96 or more versions).k2It is data query coefficient, is positively correlated with data volume contained by inquiry tables of data, representative value is
600。λ1The optimization degree of inquiry application is indicated, if it is excellent to execute literary data base querying bottom Optimized Measures data base querying bottom completely
Change measure, λ1Desirable 0.1.
Step 130, increase the reference association between the tables of data of the data model according to preset rules；
Further, the reference association includes directly supplement association；
The directly supplement association is for there is no two nodes in path to establish association；Each of two nodes
In the presence of there are the new nodes in path with the node, association is established to two new nodes.
Such as: u is not present in the data model network architecture at present1To v1Path P1(u1,v1), i.e.,(Ω
(u, v) is in G with u, and v is the set of paths of endpoint), but there are u1To u2And v2To v1Path, i.e.,AndThen establish u2To v2Association；
Further, the reference association includes recursion supplement association；
The recursion supplement association is for corresponding to the start node in two nodes for having existed at least one path
Tables of data attribute field in increase redundancy it is external, realization corresponding data in another node corresponding data table in the path is drawn
With.
Directly supplement typically to the needs for meeting service application, it is established that complicated and simple degree it is different tables of data association
Relationship.And recursion supplement is to improve efficiency data query as the association supplement of the nonessential tables of data of target, the present invention, which provides, to be commented
The necessity of valence recursion supplement, i.e. evaluation recursion augment the method that whether can be improved efficiency data query.
Step 140, the superiority index that each reference is associated in association front and back data model is calculated, if the reference is associated with
Superiority index then saves reference association better than the superiority index before association afterwards；The superiority index includes average road
Long, cluster coefficient and average degree；
Further, the average value of the shortest path length between the average a length of every two node in road；The average road
The calculation formula of long L are as follows:
Wherein, n is number of nodes, dijFor the shortest path length of i-th of node j node on earth；If between two nodes
There is no path, then corresponding dijIt is 0.
Further, for the cluster coefficient for indicating data model interior joint aggregation extent, the cluster coefficient C is every
The cluster degree C of one nodeiAverage value, the cluster degree C of each nodeiCalculation formula are as follows:
Wherein, kiIndicate the number for the node being connected with i-th of node, tiFor i-th of node and kiA connected node
Between side quantity.
Further, the average degreeIt is corresponding by each node by the degree of all nodes in the data model
The inverse of the data volume of tables of data is that weight is averaging acquisition；The degree of the node is the quantity on the side of connection on this node.
Judge whether superiority index after the association is better than the rule of the superiority index before association are as follows: if relay protection
Data model structure about optimizes, search efficiency is higher, the road length that is averaged should shorter, aggregation extent should higher, average degree
It also should be higher.
Step 150, the reference association of all preservations is added in data model, obtains the relay protection number of structure optimization
According to model.
Step 160, a specific node in the data model is accessed in a certain start node to lead to there are when mulitpath
It crosses dijkstra's algorithm and calculates acquisition shortest path.
In the present embodiment, for accessing some data model node v, there are the situations of mulitpath, if start node is
U,In data model network G the distance ω (e) of each side e be taken as being cited data volume contained by tables of data conversion
At query time, using dijkstra's algorithm, in Θ (ν, ε)=Ο (ξ2) in step number, the shortest path P of u to v can be calculated0
(u, v) and corresponding retrieval time duv, to realize relay protection data model chess game optimization.
The step of dijkstra's algorithm, is:
1) when u, v are non-conterminous, ω (u, v)=∞ is taken；
2) l (u is enabled0)=0；L (v)=∞, v ≠ u0；S0={ u0, i=0；
3) to eachWith min { l (v), l (ui)+ω(ui, v) } substitution l (v)；If ui+1It is to be minimized l (v)
V (G)-SiIn top, enable Si+1=Si∪{ui+1}；
If 4)Stop；IfI is substituted with i+1, is turned 3).
Fig. 2 is that a kind of relay protection data model search based on shortest path first of the specific embodiment of the invention is excellent
The structure chart of change system.As shown in Fig. 2, the system comprises:
Data acquisition unit 210, the data acquisition unit 210 is for acquiring relay protection data, the relay protection
Data include the tables of data of multiple and different types, include a certain amount of data in each tables of data；
Data model establishes unit 220, and the data model establishes unit 220 for according to the relay protection data
Incidence relation between data object establishes data model；Wherein, the tables of data is mapped as the node of data model, tables of data is visited
Ask that Sequential Mapping is mapped as path length for the path of data model, the data volume of tables of data；
Further, the data model establishes unit 220 for the data object institute according to the relay protection data
The level incidence relation of the entity of description itself constructs data model structure.
Associative cell 230 is quoted, the reference associative cell 230 is used to increase the data model according to preset rules
Reference association between tables of data；
Further, the reference associative cell 230 carries out reference association by directly supplement association；
The directly supplement association is for there is no two nodes in path to establish association；Each of two nodes
In the presence of there are the new nodes in path with the node, association is established to two new nodes.
Further, the reference associative cell 230 carries out reference association by recursion supplement association；
The recursion supplement association is for corresponding to the start node in two nodes for having existed at least one path
Tables of data attribute field in increase redundancy external key, realization corresponding data in another node corresponding data table in the path is drawn
With.
Optimize judging unit 240, the optimization judging unit 240 is associated in association front and back data for calculating each reference
The superiority index of model, if superiority index saves this and draw better than the superiority index before association after the reference association
With association；The superiority index includes long average road, cluster coefficient and average degree；
The optimization judging unit 240 is used to add to the reference association of all preservations in data model, obtains structure
The relay protection data model of optimization.
Shortest path computing unit 250, a specific node exists in the data model described in a certain enlightenment node visit
When mulitpath, the shortest path computing unit 250 is calculated by dijkstra's algorithm and obtains shortest path.
Further, the optimization judging unit 240 is long for calculating average road；The average a length of every two node in road
Between shortest path length average value；The calculation formula of the average long L in road are as follows:
Wherein, n is number of nodes, dijFor the shortest path length of i-th of node j node on earth；If between two nodes
There is no path, then corresponding dijIt is 0.
Further, the optimization judging unit 240 is used for computing cluster coefficient；The cluster coefficient is for indicating data
Model interior joint aggregation extent, the cluster coefficient C are the cluster degree C of each nodeiAverage value, it is described each section
The cluster degree C of pointiCalculation formula are as follows:
Wherein, kiIndicate the number for the node being connected with i-th of node, tiFor i-th of node and kiA connected node
Between side quantity.
Further, the optimization judging unit 240 is for calculating average degree；The average degree passes through the data
The degree of all nodes is that weight is averaging acquisition by the inverse of the data volume of each node corresponding data table in model；The node
Degree be connection side on this node quantity.
In the instructions provided here, numerous specific details are set forth.It is to be appreciated, however, that the implementation of the disclosure
Example can be practiced without these specific details.In some instances, well known method, structure is not been shown in detail
And technology, so as not to obscure the understanding of this specification.
Those skilled in the art will understand that can be carried out adaptively to the module in the equipment in embodiment
Change and they are arranged in one or more devices different from this embodiment.It can be the module or list in embodiment
Member or component are combined into a module or unit or component, and furthermore they can be divided into multiple submodule or subelement or
Sub-component.Other than such feature and/or at least some of process or unit exclude each other, it can use any
Combination is to all features disclosed in this specification (including adjoint claim, abstract and attached drawing) and so disclosed
All process or units of what method or apparatus are combined.Unless expressly stated otherwise, this specification is (including adjoint power
Benefit require, abstract and attached drawing) disclosed in each feature can carry out generation with an alternative feature that provides the same, equivalent, or similar purpose
It replaces.The step of being related in this specification, which numbers, is only used for distinguishing each step, and the time being not limited between each step
Or the relationship of logic, restriction unless the context clearly, otherwise the relationship between each step includes the case where various possible.
In addition, it will be appreciated by those of skill in the art that although some embodiments described herein include other embodiments
In included certain features rather than other feature, but the combination of the feature of different embodiments means to be in the disclosure
Within the scope of and form different embodiments.For example, embodiment claimed in detail in the claims is one of any
Can in any combination mode come using.
The various component embodiments of the disclosure can be implemented in hardware, or to run on one or more processors
Software module realize, or be implemented in a combination thereof.The disclosure is also implemented as executing side as described herein
The some or all equipment or system program (for example, computer program and computer program product) of method.It is such
It realizes that the program of the disclosure can store on a computer-readable medium, or can have the shape of one or more signal
Formula.Such signal can be downloaded from an internet website to obtain, and perhaps be provided on the carrier signal or with any other shape
Formula provides.
The disclosure is limited it should be noted that above-described embodiment illustrates rather than the disclosure, and ability
Field technique personnel can be designed alternative embodiment without departing from the scope of the appended claims.Word "comprising" is not arranged
Except there are element or steps not listed in the claims.Word "a" or "an" located in front of the element does not exclude the presence of more
A such element.The disclosure can be by means of including the hardware of several different elements and by means of properly programmed calculating
Machine is realized.If several in these systems can be by same in the unit claim for listing dry systems
Hardware branch embodies.
The above is only the specific embodiment of the disclosure, it is noted that for the ordinary skill people of this field
Member for, do not depart from the disclosure spirit under the premise of, can make several improvements, modify and deform, these improve, modification,
It is regarded as falling within the scope of protection of this application with deformation.
Claims (14)
1. a kind of relay protection data model chess game optimization method based on shortest path first, which comprises
Relay protection data are acquired, the relay protection data include the tables of data of multiple and different types, packet in each tables of data
Include a certain amount of data；
Data model is established according to the incidence relation between the data object of the relay protection data；Wherein, the tables of data is reflected
Penetrate the node for data model, tables of data access order is mapped as the path of data model, the data volume of tables of data is mapped as road
Electrical path length；
Increase the reference association between the tables of data of the data model according to preset rules；
The superiority index that each reference is associated in association front and back data model is calculated, if reference association is excellent after association
Property index better than association before superiority index, then save the reference association；The superiority index includes average road length, cluster
Coefficient and average degree；
The reference association of all preservations is added in data model, the relay protection data model of structure optimization is obtained；
A specific node in the data model is accessed in a certain start node to calculate there are when mulitpath by Dijkstra
Method, which calculates, obtains shortest path.
2. the method according to claim 1, wherein between the data object according to the relay protection data
Incidence relation establish data model, comprising:
According to the level incidence relation of entity described in the data object of the relay protection data itself, data model is constructed
Structure.
3. according to the method described in claim 1, it is characterized by: reference association includes directly supplement association；
The directly supplement association is for there is no two nodes in path to establish association；Each of two nodes are deposited
There are the new nodes in path with the node, to two new nodes foundation associations.
4. according to the method described in claim 1, it is characterized by: reference association includes recursion supplement association；
The recursion supplement association is for the corresponding number of start node in two nodes for having existed at least one path
It is external according to redundancy is increased in the attribute field of table, realize the reference to corresponding data in another node corresponding data table in the path.
5. according to the method described in claim 1, it is characterized by: shortest path between the average a length of every two node in road
The average value of length；The calculation formula of the average long L in road are as follows:
Wherein, n is number of nodes, dijFor the shortest path length of i-th of node j node on earth；If not deposited between two nodes
In path, then corresponding dijIt is 0.
6. according to the method described in claim 1, it is characterized by: the cluster coefficient is for indicating that data model interior joint is poly-
Collection degree, the cluster coefficient C are the cluster degree C of each nodeiAverage value, the cluster degree of each node
CiCalculation formula are as follows:
Wherein, kiIndicate the number for the node being connected with i-th of node, tiFor i-th of node and kiBetween a connected node
The quantity on side.
7. according to the method described in claim 1, it is characterized by: the average degree passes through all sections in the data model
The degree of point is that weight averaging obtains by the inverse of the data volume of each node corresponding data table；The degree of the node is to be connected to
The quantity on the side on the node.
8. a kind of relay protection data model chess game optimization system based on shortest path first, the system comprises:
Data acquisition unit, the data acquisition unit include more for acquiring relay protection data, the relay protection data
A different types of tables of data, interior each tables of data includes a certain amount of data；
Data model establishes unit, and the data model establishes unit between the data object according to the relay protection data
Incidence relation establish data model；Wherein, the tables of data is mapped as the node of data model, the mapping of tables of data access order
Path length is mapped as the path of data model, the data volume of tables of data；
Associative cell is quoted, the reference associative cell is used to increase according to preset rules between the tables of data of the data model
Reference association；
Optimize judging unit, the optimization judging unit is used to calculate each reference and is associated in the excellent of association front and back data model
Property index, if it is described reference association after superiority index better than association before superiority index, save the reference association；It is described
Superiority index includes long average road, cluster coefficient and average degree；
The optimization judging unit is used to add to the references of all preservations association in data model, obtain structure optimization after
Electric protection data model；
Shortest path computing unit, there are mulitpaths for a specific node in a certain start node access data model
When, the shortest path computing unit is calculated by dijkstra's algorithm and obtains shortest path.
9. system according to claim 8, it is characterised in that: the data model establishes unit for according to the relay
The level incidence relation of entity described in the data object of data itself is protected, data model structure is constructed.
10. system according to claim 8, it is characterised in that: the reference associative cell by directly supplement be associated with into
Row reference association；
The directly supplement association is for there is no two nodes in path to establish association；Each of two nodes are deposited
There are the new nodes in path with the node, to two new nodes foundation associations.
11. system according to claim 8, it is characterised in that: the reference associative cell by recursion supplement be associated with into
Row reference association；
The recursion supplement association is for the corresponding number of start node in two nodes for having existed at least one path
It is external according to redundancy is increased in the attribute field of table, realize the reference to corresponding data in another node corresponding data table in the path.
12. system according to claim 8, it is characterised in that: the optimization judging unit is long for calculating average road；Institute
State the average value of the shortest path length between a length of every two node in average road；The calculation formula of the average long L in road are as follows:
Wherein, n is number of nodes, dijFor the shortest path length of i-th of node j node on earth；If not deposited between two nodes
In path, then corresponding dijIt is 0.
13. system according to claim 8, it is characterised in that: the optimization judging unit is used for computing cluster coefficient；Institute
It is the cluster degree of each node that cluster coefficient, which is stated, for indicating data model interior joint aggregation extent, the cluster coefficient C
CiAverage value, the cluster degree C of each nodeiCalculation formula are as follows:
Wherein, kiIndicate the number for the node being connected with i-th of node, tiFor i-th of node and kiBetween a connected node
The quantity on side.
14. system according to claim 8, it is characterised in that: the optimization judging unit is for calculating average degree；Institute
State the degree that average degree passes through all nodes in the data model is by the inverse of the data volume of each node corresponding data table
Weight, which is averaging, to be obtained；The degree of the node is the quantity on the side of connection on this node.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910471052.XA CN110197305B (en) | 2019-05-31 | 2019-05-31 | Relay protection data model searching and optimizing method and system based on shortest path algorithm |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910471052.XA CN110197305B (en) | 2019-05-31 | 2019-05-31 | Relay protection data model searching and optimizing method and system based on shortest path algorithm |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110197305A true CN110197305A (en) | 2019-09-03 |
| CN110197305B CN110197305B (en) | 2023-11-17 |
Family
ID=67753618
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910471052.XA Active CN110197305B (en) | 2019-05-31 | 2019-05-31 | Relay protection data model searching and optimizing method and system based on shortest path algorithm |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110197305B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113268837A (en) * | 2021-04-12 | 2021-08-17 | 中国电建集团华东勘测设计研究院有限公司 | Cable path optimizing method adopting C4.5 decision tree algorithm |
Citations (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20100131251A1 (en) * | 2006-01-29 | 2010-05-27 | Fujitsu Limited | Shortest path search method and device |
| CN101777990A (en) * | 2010-01-15 | 2010-07-14 | 西安电子科技大学 | Method for selecting multi-objective immune optimization multicast router path |
| CN102169524A (en) * | 2010-02-26 | 2011-08-31 | 同济大学 | Staged multi-path model algorithm of urban rail transit network passenger flow distribution |
| JP2013169059A (en) * | 2012-02-15 | 2013-08-29 | Toshiba Corp | Protection relay device and protection relay system |
| CN105335816A (en) * | 2015-10-13 | 2016-02-17 | 国网安徽省电力公司铜陵供电公司 | Electric power communication operation trend and business risk analyzing method based on deep learning |
| CN105515044A (en) * | 2015-12-22 | 2016-04-20 | 国家电网公司 | Black-start assistant decision-making system based on DTS |
| CN106453085A (en) * | 2016-12-14 | 2017-02-22 | 国家电网公司 | Business importance-based risk-balancing routing assignment method and system |
| CN106789646A (en) * | 2016-12-09 | 2017-05-31 | 国网北京市电力公司 | Service transmission path determines method and device |
| CN107294775A (en) * | 2017-06-08 | 2017-10-24 | 国网江西省电力公司信息通信分公司 | Communication optimization method based on analytic hierarchy process (AHP) and genetic algorithm |
| US20170336219A1 (en) * | 2015-05-19 | 2017-11-23 | Fleetmatics Development Limited | System and method for accelerating route search |
| CN107402927A (en) * | 2016-05-19 | 2017-11-28 | 上海斯睿德信息技术有限公司 | A kind of enterprise's incidence relation topology method for building up and querying method based on graph model |
| CN109583026A (en) * | 2018-10-30 | 2019-04-05 | 中国电力科学研究院有限公司 | A kind of relay protection business modeling method and system based on Petri network occurrence sequence |
-
2019
- 2019-05-31 CN CN201910471052.XA patent/CN110197305B/en active Active
Patent Citations (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20100131251A1 (en) * | 2006-01-29 | 2010-05-27 | Fujitsu Limited | Shortest path search method and device |
| CN101777990A (en) * | 2010-01-15 | 2010-07-14 | 西安电子科技大学 | Method for selecting multi-objective immune optimization multicast router path |
| CN102169524A (en) * | 2010-02-26 | 2011-08-31 | 同济大学 | Staged multi-path model algorithm of urban rail transit network passenger flow distribution |
| JP2013169059A (en) * | 2012-02-15 | 2013-08-29 | Toshiba Corp | Protection relay device and protection relay system |
| US20170336219A1 (en) * | 2015-05-19 | 2017-11-23 | Fleetmatics Development Limited | System and method for accelerating route search |
| CN105335816A (en) * | 2015-10-13 | 2016-02-17 | 国网安徽省电力公司铜陵供电公司 | Electric power communication operation trend and business risk analyzing method based on deep learning |
| CN105515044A (en) * | 2015-12-22 | 2016-04-20 | 国家电网公司 | Black-start assistant decision-making system based on DTS |
| CN107402927A (en) * | 2016-05-19 | 2017-11-28 | 上海斯睿德信息技术有限公司 | A kind of enterprise's incidence relation topology method for building up and querying method based on graph model |
| CN106789646A (en) * | 2016-12-09 | 2017-05-31 | 国网北京市电力公司 | Service transmission path determines method and device |
| CN106453085A (en) * | 2016-12-14 | 2017-02-22 | 国家电网公司 | Business importance-based risk-balancing routing assignment method and system |
| CN107294775A (en) * | 2017-06-08 | 2017-10-24 | 国网江西省电力公司信息通信分公司 | Communication optimization method based on analytic hierarchy process (AHP) and genetic algorithm |
| CN109583026A (en) * | 2018-10-30 | 2019-04-05 | 中国电力科学研究院有限公司 | A kind of relay protection business modeling method and system based on Petri network occurrence sequence |
Non-Patent Citations (3)
| Title |
|---|
| 朱翰超;杜亚静;季节;: "Dijkstra算法在电力电缆敷设优化研究中的应用", 电气应用, no. 24 * |
| 桂超;汪波;: "基于遗传算法的最短路径路由优化算法", 微计算机信息, no. 25 * |
| 钱海;邱金辉;张道农;姜健琳;尹浙洪;沈亚东;: "继电保护信息语义智能识别算法的研究与应用", 电力系统保护与控制, no. 03 * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113268837A (en) * | 2021-04-12 | 2021-08-17 | 中国电建集团华东勘测设计研究院有限公司 | Cable path optimizing method adopting C4.5 decision tree algorithm |
| CN113268837B (en) * | 2021-04-12 | 2022-06-14 | 中国电建集团华东勘测设计研究院有限公司 | Cable path optimizing method adopting C4.5 decision tree algorithm |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110197305B (en) | 2023-11-17 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104995870B (en) | Multiple target server arrangement determines method and apparatus | |
| CN104516894B (en) | Method and apparatus for managing time series databases | |
| CN110134833A (en) | Diagram data modeling and method towards power network topology management | |
| CN106651624A (en) | Integrated service access network operation quality evaluation method and test platform thereof | |
| CN105893637A (en) | Link prediction method in large-scale microblog heterogeneous information network | |
| Guo et al. | Graph theory based topology design and energy routing control of the energy internet | |
| CN105574541A (en) | Compactness sorting based network community discovery method | |
| CN103559320B (en) | The method that object in heterogeneous network is ranked up | |
| CN109039886B (en) | Network dynamic route computing method, device and equipment | |
| CN104700190A (en) | Method and device for matching item and professionals | |
| Gang et al. | Automatic identification of transmission sections based on complex network theory | |
| WO2012144956A1 (en) | A method for the construction of a water distribution model | |
| CN108428063A (en) | A kind of Establishment of integrated evaluation index system of one stream distribution network construction level | |
| CN109060021A (en) | A kind of reactor health state evaluation method based on bayesian theory | |
| CN107729939A (en) | A kind of CIM extended method and device towards newly-increased power network resources | |
| CN105656036A (en) | Probability static safety analysis method considering flow-and-sensitivity consistency equivalence | |
| CN110197305A (en) | A kind of relay protection data model chess game optimization method and system based on shortest path first | |
| Navarrete‐Gutiérrez et al. | On the complexity of life cycle inventory networks: role of life cycle processes with network analysis | |
| CN106548284A (en) | A kind of adaptive mode massing power grid security Alarm Assessment method towards operation regulation and control | |
| Cao et al. | Mapping strategy for virtual networks in one stage | |
| CN108711860A (en) | A kind of power distribution network substation-lines join planing method based on parallel computation | |
| CN110213237B (en) | Control method for fully distributed subsystem collaborative safety control and Petri network model | |
| Cao et al. | Prediction of medical expenses for gastric cancer based on process mining | |
| Rashmi et al. | A review on overlapping community detection methodologies | |
| Kesherwani et al. | Synchrophasor measurement‐based approach for online available transfer capability evaluation |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |