CN107145963A - A kind of power distribution network method for searching path based on depth-first - Google Patents
A kind of power distribution network method for searching path based on depth-first Download PDFInfo
- Publication number
- CN107145963A CN107145963A CN201710220486.3A CN201710220486A CN107145963A CN 107145963 A CN107145963 A CN 107145963A CN 201710220486 A CN201710220486 A CN 201710220486A CN 107145963 A CN107145963 A CN 107145963A
- Authority
- CN
- China
- Prior art keywords
- node
- path
- paths
- distribution network
- power supply
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
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
-
- 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 invention discloses a kind of power distribution network method for searching path based on depth-first.Thought of this method based on depth-first, is traveled through to the topological diagram of power distribution network, and by specific conditional filtering, obtains supply paths all in power distribution network.By classifying to the path that search is obtained, three kinds of supply paths are finally given：All supply paths classified by power supply；All paths of the load classification of terminal by path；All paths that the branch road of middle process is classified by path.Three kinds of paths that this method search is obtained have very strong regularity, sufficient description can be provided to the method for operation of power distribution network, it can be used in the great number of issues of distribution system analysis, such as analysis of power distribution network reconfiguration, feeder line power supply capacity, power distribution network N 1 are analyzed, load transfer path optimization, and the time complexity and space complexity performance of method are very superior, with extensive actual application value.
Description
Technical field
The present invention relates to a kind of power distribution network method for searching path based on depth-first, belong to the analysis field of power distribution network.
Background technology
At present, there is the problem of largely needing analysis in the planning and operation of power distribution network, such as power distribution network reconfiguration, feeder line is powered
Capability analysis, power distribution network N-1 analyses, power distribution network N-1 analyses, load transfer path optimization etc..Asked at these in the path of power distribution network
Played an important role in the analysis of topic.Obtained path is searched in existing power distribution network method for searching path not comprehensive enough, it is difficult
To carry out classified use to path, Use Limitation rate is relatively low.And can not be directly by obtaining operating structure of the path to power distribution network
Sufficiently complete description is carried out with the method for operation, in distribution system analysis, a large amount of undesirable operating structures can be produced, needed
The methods such as search spanning tree are taken in addition, to ensure the correct operating structure of power distribution network, reduce efficiency.
The content of the invention
In order to overcome the shortcomings of above-mentioned existing method, searched the invention provides a kind of power distribution network path based on depth-first
Suo Fangfa.Thought of this method based on depth-first, is traveled through to the topological diagram of power distribution network, and by specific conditional filtering,
Obtain supply paths all in power distribution network.By classifying to the path that search is obtained, three kinds of supply paths are finally given：
All supply paths classified by power supply；All paths of the load classification of terminal by path；The branch road of middle process divides by path
All paths of class.Three kinds of paths that this method search is obtained have very strong regularity, and the operation of power distribution network can be provided
Sufficiently description, can be used in power distribution network reconfiguration, the analysis of feeder line power supply capacity, power distribution network N-1 analyses, load transfer path optimization etc.
In great number of issues, and the complexity performance of method is very superior, with good actual application value.
The present invention is achieved through the following technical solutions：A kind of electric power distribution network path search side based on depth-first
Method, the method includes the steps of：
Step 1：Supply paths all in power distribution network are searched for, are classified by power supply.To the electricity of each in distribution network topology
Source node, searches out all paths by starting point of the power supply.
Step 2：Two class.paths that search is classified by terminal load bus and classified by branch road.Both paths all pass through
What search had been obtained is obtained by all paths that power supply is classified.All roads by terminal of some load bus are found out first
Footpath and all paths by a certain bar branch road, then the result of all loads and branch road is collected, obtain required two kinds
Path.
Further, to realizing the recurrence of traversal using a stack architecture in the search of power distribution network in the step 1
Process, retains the node that search procedure is passed through, storing path information in storehouse.Search a node every time, then it is corresponding
Also have a supply path p from power supply to the node, node that will be currently in stack is sequentially connected, then by stack top node with it is new
The connected obtained new path of node searched.
The node arrived for new search, judges whether to meet three below condition：The node is not present in stack；Work as previous existence
Into the supply path p of the node can not be identical with the path searched；The node is not power supply node.If new search is arrived
Node be unsatisfactory for any of the above-described condition, then continue to scan for next abutment points of stack top element；If all meeting,
The node stacking is made, and records the path p newly obtained.So ensure to omit and also do not repeat to record any power supply road
Footpath.
Passage path searches for the result finally given：Using first power supply as all paths of starting point, with second electricity
Source is all paths ... of starting point, all paths by starting point of n-th of power supply.A series of this path classified by power supply, is deposited
Storage is in array pathes.Original position of the inhomogeneous path in pathes is recorded with an array supplyStart.
The method detailed process for all supply paths that search is classified by power supply is as follows, and flow chart is as shown in Figure 1：
1) an ArrayList tabular array variable pathes is set up, for depositing the path that search is obtained.Set up one
Stack.If the power supply node in figure has n, respectively S1,S2,…,Sn, SiRepresent i-th of power supply node.I=1 is made, i.e., from
1 power supply node start to process.An array supplyStart is set up, record exists from the path of each power supply
Original position in pathes.
2) currently processed power supply node is Si, by SiIt is pressed into stack.SupplyStart [i] is entered as in pathes
Stored number of passes.
3) current stack top element is node T, if being a with all nodes that T is abutted1,a2,…,am, ajRepresent j-th of neighbour
Connect node.The token variable flag1 of one Boolean type is set, flag1=true is made.J=1 is made, i.e., since the 1st abutment points
Processing.The token variable flag2 of one Boolean type is set.
4) currently processed T adjacent node is aj.Make flag2=true.
5) a is judgedjWhether in stack.If in stack, making flag2=false.
6) a is judgedjWhether it is power supply node.If power supply node, then flag2=false is made.
7) with the node in current stack, node a is addedj, generate a corresponding path p.Path p generating process is：
From stack coxopodite point to stack top node, the node in stack is sequentially connected, resulting branch road is sequentially added in p, finally again by stack
Top node and node ajBranch road obtained by connection is added in p.The path obtained in traversal pathes, judges whether
There is newly-generated path p.If in the presence of making flag2=false.
8) whether judge flag2 values is true：
If 1. flag2 value is true, it is transferred to 9).
If 2. flag2 value is false, it is transferred to 10).
9) a is madejStacking, makes flag1=false.Newly-generated path p recorded in pathes.Now, stack top element
T is updated to the node a of new stackingj, it is transferred to 11).
10) j=j+1 is made.If j≤m, it is transferred to 4), next abutment points to T are scanned for；If j>M, is represented with working as
All nodes of preceding stack top element T adjoinings have all been handled, and are transferred to 11), and m is the number of T adjacent node.
11) whether the value for judging flag1 is true
If 1. flag1 value is false, it is transferred to 3).
If 2. flag1 value is true, stack top node T pops.Whether judge stack is empty：
If i stacks are not sky, it is transferred to 3).
If ii stacks are sky, i=i+1 is made.If i≤n, it is transferred to 2), next power supply node is handled.If i>N, is searched
Rope is completed, and is terminated, and n is the number of all power supply nodes.
Further, all paths by terminal of some load are searched in the step 2, process is：Traversal presses power supply
All paths of classification, to each paths, whether the node for judging its destination county is the load bus specified, if so, then will
The path is recorded.
All paths of a certain bar branch road are passed through in search, and process is：Traversal is from all paths of power supply, to each
Branch road included in path is scanned for, if containing the branch road specified, the path is recorded.
And then to each load bus in figure, searched for accordingly, the load point of terminal by path can be obtained
In all paths of class, deposit array cnPathes.The path that non-same terminal load bus is recorded with array cnStart exists
Original position in cnPathes.Each branch road in figure is all accordingly searched for, middle process by path can be obtained
In all paths of branch road classification, deposit array edgePathes.The non-road by same branch road is recorded with array edgeStart
Original position of the footpath in edgePathes.
Power distribution network method for searching path based on depth-first in the present invention, the time complexity of this method is O (n3), it is empty
Between complexity be O (m2), wherein, n is the node number in power distribution network, and m is branch travel permit number in power distribution network.This method has excellent
Time complexity and space complexity performance, in distribution system analysis have extensive actual application value.
Compared with the existing methods, the beneficial effects of the invention are as follows：Three kinds of paths that this method search is obtained have very strong
Regularity, sufficient description can be provided to the operation of power distribution network, can be used in power distribution network reconfiguration, feeder line power supply capacity analysis,
In the great number of issues such as power distribution network N-1 analyses, load transfer path optimization.And method maintains superior time complexity and space is multiple
Miscellaneous degree performance, can accurately and quickly search out the supply path in power distribution network.
Brief description of the drawings
Fig. 1 searches for the schematic flow sheet of the method for all supply paths in power distribution network for the present invention；
Fig. 2 is the distribution network topology comprising 3 power supplys, 5 load buses；
Fig. 3 is to search for obtain by power supply S1 all paths from Fig. 2 using the inventive method.
Embodiment
The present invention is further described below in conjunction with the accompanying drawings.
The method of the present invention is first to obtain all paths by starting point of each power supply, it is specific using a stack architecture come
The recursive procedure of traversal is realized, the node that search procedure is passed through, storing path information are retained in storehouse.Search one every time
Node, then corresponding also to have a supply path p from power supply to the node, node that will be currently in stack is sequentially connected, then
By stack top node and new search to node be connected an obtained new path.
The node arrived for new search, judges whether to meet three below condition：The node is not present in stack；Work as previous existence
Into the supply path p of the node can not be identical with the path searched；The node is not power supply node.If new search is arrived
Node be unsatisfactory for any of the above-described condition, then continue to scan for next abutment points of stack top element；If all meeting,
The node stacking is made, and records the path p newly obtained.So ensure to omit and also do not repeat to record any power supply road
Footpath.
All paths classified by power supply are traveled through again, and to each paths, whether the node for judging its destination county is specified
Load bus, if so, then the path is recorded；Traversal is from all paths of power supply, included in each paths
Branch road scan for, if containing the branch road specified, the path is recorded.
Thought of this method based on depth-first, is traveled through to the topological diagram of power distribution network, and by specific conditional filtering,
Obtain supply paths all in power distribution network.By classifying to the path that search is obtained, three kinds of supply paths are finally given：
All supply paths classified by power supply；All paths of the load classification of terminal by path；The branch road of middle process divides by path
All paths of class.The obtained three kinds of paths of this method search have very strong regularity, can be to the method for operation of power distribution network
Sufficient description is provided, can be used in the great number of issues of distribution system analysis, such as power distribution network reconfiguration, feeder line power supply capacity are analyzed, matched somebody with somebody
Power network N-1 analyses, load transfer path optimization etc., and the time complexity and space complexity performance of method are very superior, tool
There is extensive actual application value.
Illustrate the main thought of the present invention by taking distribution network topology as shown in Figure 2 as an example below, wherein power supply node is
S1, S2 and S3.Obtained path is searched for be represented with C1-C2 ...-Cn form, wherein C1, C2 ..., Cn represents to include in path
Nodename.Illustrate the process that path is formed by taking S1 as an example.
S1 stackings first, as stack top node, adjacent node only has L2, judges whether L2 meets the 3 of stacking described above
Individual condition：L2 is not present in stack；S1-L2 is not present in the path found；L2 is not power supply node.3 conditions are all met,
L2 stackings, obtain path S1-L2.
Continue to scan for L2 adjacent node：If searching S1, S1 is in stack, it is impossible to stacking；If search
To L3 or L5, then meet three conditions of stacking.Assuming that first searching L3, then L3 stackings obtain path S1-L2-L3.
Continue to search for since L3, search L1, then L1 stackings, obtain path S1-L2-L3-L1.
L1 adjacent node is searched for, wherein S3 is power supply node, and L3 is in stack, so L1 adjacent node is all discontented with
The condition of sufficient stacking, then L1 pop.
Now stack top element is L3, continues to scan for L3 adjacent node.If searching again for L1, the road generated
Footpath is S1-L2-L3-L1.The path is included in obtained path, therefore L1 no longer meets the condition of stacking.
Next node for meeting stacking condition is searched for L4.
So far, each ungratified situation of condition runs into respectively in three conditions of node stacking, node stacking
Also had been directed to the operation popped, the situation encountered in follow-up search will be like before.Obtained after the completion of search
All paths from power supply S1 it is as shown in Figure 3.Search is obtained behind the corresponding all paths of all power supplys, then is traveled through by electricity
All paths of source classification, to each paths, whether the node for judging its destination county is the load bus specified, if so, then
The path is recorded；Traversal is scanned for, if containing from all paths of power supply to the branch road included in each paths
There is the branch road specified, then record the path.
The advantage of power distribution network method for searching path based on depth-first is：By specific screening conditions, based on depth
The preferential thought of degree, is traveled through to the topological diagram of power distribution network, can not repeat to obtain all in power distribution network with also not omitting
Supply path.By classifying to the path that search is obtained, three kinds of supply paths are comprehensively obtained：By owning that power supply is classified
Supply path；All paths of the load classification of terminal by path；All paths that the branch road of middle process is classified by path.The party
The meaning of method most worthy, which is to search for three kinds of obtained paths, has very strong regularity, can be to the method for operation of power distribution network
Sufficient description is provided, can be analyzed with power distribution network reconfiguration, feeder line power supply capacity, power distribution network N-1 is analyzed, load transfer path optimization
The problems such as in, and the time complexity and space complexity performance of method are very superior.
Claims (4)
1. a kind of power distribution network method for searching path based on depth-first, it is characterised in that：This method comprises the following steps：
Step 1：Search supply paths all in power distribution network classifiably by power supply；Specially：To each in distribution network topology
Power supply node, searches out all paths by starting point of the power supply；
Step 2：From step 1) classify by terminal load bus and search classifiably out by branch road respectively in all paths for obtaining
Two class.paths；Specially：To each load bus, in step 1) obtain all paths in find out using the load bus for end
All paths of point, obtain all paths classified by terminal load bus；To each branch road, in step 1) obtain it is all
All paths by this branch road are found out in path, all paths pressed and classified by branch road are obtained.
2. plain method is searched in a kind of power distribution network path based on depth-first according to claim 1, it is characterised in that：It is described
Step 1) use method for：To realizing the recursive procedure of traversal using a stack architecture in the search of power distribution network, in heap
Retain the node that search procedure is passed through, storing path information in stack；
The node arrived for new search, judges whether to meet three below condition：The node is not present in stack；It is currently generated
The supply path p of the node can not be identical with the path searched；The node is not power supply node；
When new search to node be unsatisfactory for any of the above-described condition, then continue to search next abutment points of stack top element
Rope；If all meeting, the node stacking is made, and record the path p newly obtained.
3. plain method is searched in a kind of power distribution network path based on depth-first according to claim 2, it is characterised in that：Search
The method idiographic flow for all supply paths classified by power supply is as follows：
1) an ArrayList tabular array variable pathes is set up, for depositing the path that search is obtained, a stack is set up,
Power supply node in establishing power grid topological graph has n, respectively S1,S2,…,Sn, SiI-th of power supply node is represented, i=is made
1, i.e., from the 1st power supply node start to process, an array supplyStart is set up, is recorded from the road of each power supply
Original position of the footpath in pathes；
2) currently processed power supply node is Si, by SiIt is pressed into stack, supplyStart [] is entered as to have deposited in pathes
The number of passes of storage；
3) current stack top element is node T, if being a with all nodes that T is abutted1,a2,…,am, ajRepresent j-th of adjoining section
Point, sets the token variable flag1 of a Boolean type, makes flag1=true, make j=1, i.e., from the 1st abutment points beginning
Reason, sets the token variable flag2 of a Boolean type；
4) currently processed T adjacent node is aj, make flag2=true；
5) a is judgedjWhether in stack, if in stack, making flag2=false；
6) a is judgedjWhether it is power supply node, if power supply node, then makes flag2=false；
7) with the node in current stack, node a is addedj, a corresponding path p is generated, path p generating process is：From stack bottom
Node in stack is sequentially connected by node to stack top node, and resulting branch road is sequentially added in p, finally again by stack top node
With node ajBranch road obtained by connection is added in p, the path obtained in traversal pathes, is judged whether in the presence of new
The path p of generation, if in the presence of making flag2=false；
8) whether judge flag2 values is true：
If 1. flag2 value is true, it is transferred to 9).
If 2. flag2 value is false, it is transferred to 10).
9) a is madejStacking, makes flag1=false, and newly-generated path p recorded in pathes, now, and stack top element T updates
For the node a of new stackingj, it is transferred to 11)；
10) j=j+1 is made, if j≤m, is transferred to 4), next abutment points to T are scanned for；If j>, represent and current stack
All nodes of top element T adjoining have all been handled, and are transferred to 11), and wherein m is the number of T all of its neighbor node；
11) whether the value for judging flag1 is true
If 1. flag1 value is false, it is transferred to 3)；
If 2. flag1 value is true, stack top node T pops, and whether judge stack is empty：
If i stacks are not sky, it is transferred to 3)；
If ii stacks are sky, i=i+1 is made, if i≤n, is transferred to 2), next power supply node is handled, if i>N, has been searched for
Into end, wherein n is the number of all power supply nodes.
4. plain method is searched in a kind of power distribution network path based on depth-first according to claim 3, it is characterised in that：Right
Each load bus in distribution network topology, is scanned for obtaining behind all paths of the load classification of terminal by path,
It is stored in array cnPathes, the path of non-same terminal load bus rising in cnPathes is recorded with array cnStart
Beginning position；Each branch road in distribution network topology is all accordingly searched for, the branch road of middle process by path can be obtained
In all paths of classification, deposit array edgePathes, the path of non-process same branch road is recorded with array edgeStart
Original position in edgePathes.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710220486.3A CN107145963A (en) | 2017-04-06 | 2017-04-06 | A kind of power distribution network method for searching path based on depth-first |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710220486.3A CN107145963A (en) | 2017-04-06 | 2017-04-06 | A kind of power distribution network method for searching path based on depth-first |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN107145963A true CN107145963A (en) | 2017-09-08 |
Family
ID=59775144
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710220486.3A Pending CN107145963A (en) | 2017-04-06 | 2017-04-06 | A kind of power distribution network method for searching path based on depth-first |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107145963A (en) |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107947159A (en) * | 2017-11-28 | 2018-04-20 | 国网四川省电力公司成都供电公司 | Regional power network operation regulation and control method based on 01 nonlinear integer programmings |
| CN110647668A (en) * | 2019-09-26 | 2020-01-03 | 华南理工大学 | Power supply loop searching method based on virtual power supply branch |
| CN111695880A (en) * | 2020-06-17 | 2020-09-22 | 常熟市汉泰化纤织造有限公司 | Production process monitoring method and system |
| CN113537605A (en) * | 2021-07-22 | 2021-10-22 | 广联达科技股份有限公司 | Method, system and device for determining drainage line |
| CN113836677A (en) * | 2021-09-30 | 2021-12-24 | 广联达科技股份有限公司 | Method, system and device for determining pipeline flow in radiator heating system |
| CN114422525A (en) * | 2021-12-30 | 2022-04-29 | 合肥指南针电子科技有限责任公司 | Patrol method and system based on medical information vehicle used for prison |
Citations (4)
| 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 |
| CN103426033A (en) * | 2013-07-31 | 2013-12-04 | 国电南瑞科技股份有限公司 | Power distribution network fault recovery optimization rebuilding algorithm based on critical path method |
| CN104063507A (en) * | 2014-07-09 | 2014-09-24 | 时趣互动（北京）科技有限公司 | Graph computation method and engine |
| CN105847145A (en) * | 2016-03-12 | 2016-08-10 | 大连理工大学 | Important node searching method based on network diameters |
-
2017
- 2017-04-06 CN CN201710220486.3A patent/CN107145963A/en active Pending
Patent Citations (4)
| 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 |
| CN103426033A (en) * | 2013-07-31 | 2013-12-04 | 国电南瑞科技股份有限公司 | Power distribution network fault recovery optimization rebuilding algorithm based on critical path method |
| CN104063507A (en) * | 2014-07-09 | 2014-09-24 | 时趣互动（北京）科技有限公司 | Graph computation method and engine |
| CN105847145A (en) * | 2016-03-12 | 2016-08-10 | 大连理工大学 | Important node searching method based on network diameters |
Non-Patent Citations (3)
| Title |
|---|
| ROMERO R E ET AL.: "Path-based distribution network modeling: application to reconfiguration for loss reduction", 《IEEE TRANS ON POWER SYSTEM》 * |
| 库波 等主编: "《数据结构：java语言描述》", 30 August 2012 * |
| 王路路: "应用于供电路径搜索的数据优化存储方法", 《中国优秀硕士学位论文全文数据库•工程科技II辑》 * |
Cited By (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107947159A (en) * | 2017-11-28 | 2018-04-20 | 国网四川省电力公司成都供电公司 | Regional power network operation regulation and control method based on 01 nonlinear integer programmings |
| CN107947159B (en) * | 2017-11-28 | 2020-12-22 | 国网四川省电力公司成都供电公司 | Regional power grid operation regulation and control method based on 0-1 nonlinear integer programming |
| CN110647668A (en) * | 2019-09-26 | 2020-01-03 | 华南理工大学 | Power supply loop searching method based on virtual power supply branch |
| CN111695880A (en) * | 2020-06-17 | 2020-09-22 | 常熟市汉泰化纤织造有限公司 | Production process monitoring method and system |
| CN111695880B (en) * | 2020-06-17 | 2024-01-12 | 苏州知云创宇信息科技有限公司 | Production flow monitoring method and system |
| CN113537605A (en) * | 2021-07-22 | 2021-10-22 | 广联达科技股份有限公司 | Method, system and device for determining drainage line |
| CN113537605B (en) * | 2021-07-22 | 2024-04-30 | 广联达科技股份有限公司 | Method, system and device for determining drainage line |
| CN113836677A (en) * | 2021-09-30 | 2021-12-24 | 广联达科技股份有限公司 | Method, system and device for determining pipeline flow in radiator heating system |
| CN113836677B (en) * | 2021-09-30 | 2024-02-20 | 广联达科技股份有限公司 | Method, system and device for determining pipeline flow in radiator heating system |
| CN114422525A (en) * | 2021-12-30 | 2022-04-29 | 合肥指南针电子科技有限责任公司 | Patrol method and system based on medical information vehicle used for prison |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107145963A (en) | A kind of power distribution network method for searching path based on depth-first | |
| CN110134833A (en) | Diagram data modeling and method towards power network topology management | |
| CN102281196A (en) | Decision tree generating method and equipment, decision-tree-based message classification method and equipment | |
| CN104462260A (en) | Community search algorithm based on k-kernel | |
| CN105976048A (en) | Power transmission network extension planning method based on improved artificial bee colony algorithm | |
| CN111536987B (en) | Vehicle path planning method for cleaning large-area garbage | |
| CN104020756B (en) | Logic network topology sorting and storing method for fault diagnosing system | |
| CN108090179A (en) | A kind of method of the concurrent subgraph inquiries of Spark | |
| CN103218692A (en) | Workflow excavating method based on inter-movement dependency relation analysis | |
| CN105515997B (en) | The higher efficiency range matching process of zero scope expansion is realized based on BF_TCAM | |
| EP3427163B1 (en) | Node-centric analysis of dynamic networks | |
| Geyer et al. | Optimal complexity reduction of piecewise affine models based on hyperplane arrangements | |
| CN101888369B (en) | Method and device for matching network message rules | |
| CN107590225A (en) | A kind of Visualized management system based on distributed data digging algorithm | |
| CN104125146B (en) | A kind of method for processing business and device | |
| Khani et al. | Transfer optimization in transit networks: Headway and departure time coordination | |
| CN115631057A (en) | Social user classification method and system based on graph neural network | |
| CN110008239A (en) | Logic based on precomputation optimization executes optimization method and system | |
| CN106383863A (en) | Isomorphic sub-graph query optimization method | |
| CN108259353A (en) | A kind of multilevel flow table design method based on matching field occurrence repetitive rate | |
| CN108197172B (en) | Frequent pattern mining method based on big data platform | |
| Chen et al. | A Structure Analysis Method of Radar Emitter Relation Network | |
| CN117575542B (en) | Building engineering data control system and method based on modularized assembly | |
| CN102469000A (en) | Large-scale network oriented topology sampling method | |
| Deineko et al. | Robotic-cell scheduling: special polynomially solvable cases of the traveling salesman problem on permuted Monge matrices |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20170908 |