CN111783264B - Efficient layout method for power distribution network planning - Google Patents
Efficient layout method for power distribution network planning Download PDFInfo
- Publication number
- CN111783264B CN111783264B CN202010573429.5A CN202010573429A CN111783264B CN 111783264 B CN111783264 B CN 111783264B CN 202010573429 A CN202010573429 A CN 202010573429A CN 111783264 B CN111783264 B CN 111783264B
- Authority
- CN
- China
- Prior art keywords
- road
- line
- joints
- lines
- stations
- 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.)
- Active
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F30/00—Computer-aided design [CAD]
- G06F30/10—Geometric CAD
- G06F30/18—Network design, e.g. design based on topological or interconnect aspects of utility systems, piping, heating ventilation air conditioning [HVAC] or cabling
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/29—Geographical information databases
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/50—Information retrieval; Database structures therefor; File system structures therefor of still image data
- G06F16/56—Information retrieval; Database structures therefor; File system structures therefor of still image data having vectorial format
-
- 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
- G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
- G06Q50/06—Energy or water supply
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y04—INFORMATION OR COMMUNICATION TECHNOLOGIES HAVING AN IMPACT ON OTHER TECHNOLOGY AREAS
- Y04S—SYSTEMS INTEGRATING TECHNOLOGIES RELATED TO POWER NETWORK OPERATION, COMMUNICATION OR INFORMATION TECHNOLOGIES FOR IMPROVING THE ELECTRICAL POWER GENERATION, TRANSMISSION, DISTRIBUTION, MANAGEMENT OR USAGE, i.e. SMART GRIDS
- Y04S10/00—Systems supporting electrical power generation, transmission or distribution
- Y04S10/50—Systems or methods supporting the power network operation or management, involving a certain degree of interaction with the load-side end user applications
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Economics (AREA)
- Human Resources & Organizations (AREA)
- Strategic Management (AREA)
- Databases & Information Systems (AREA)
- General Engineering & Computer Science (AREA)
- Geometry (AREA)
- Health & Medical Sciences (AREA)
- Marketing (AREA)
- Tourism & Hospitality (AREA)
- General Business, Economics & Management (AREA)
- Data Mining & Analysis (AREA)
- Pure & Applied Mathematics (AREA)
- Quality & Reliability (AREA)
- Development Economics (AREA)
- Evolutionary Computation (AREA)
- Game Theory and Decision Science (AREA)
- Computer Hardware Design (AREA)
- Entrepreneurship & Innovation (AREA)
- Mathematical Optimization (AREA)
- Operations Research (AREA)
- Remote Sensing (AREA)
- Mathematical Analysis (AREA)
- Computational Mathematics (AREA)
- Computer Networks & Wireless Communication (AREA)
- Public Health (AREA)
- Water Supply & Treatment (AREA)
- General Health & Medical Sciences (AREA)
- Primary Health Care (AREA)
- Supply And Distribution Of Alternating Current (AREA)
Abstract
The invention discloses a high-efficiency layout method for power distribution network planning, which comprises the following steps: initializing preparation; establishing a road intermediate line and a road ramp model according to the vector map GIS information; calculating the number of T joints of the line to two sides of the road, and calculating the serial number of the line on the ramp of the road from high to low according to the number of the T joints on the two sides; according to the sequence of the stations, starting from the power supply point, threading the power supply points of each station along the road intermediate line by utilizing a shortest path algorithm of the path passing point, and paralleling the threading path with the road intermediate line; realizing regular threading; the connection lines spaced by the stations are orthogonally processed by the stations. The invention can reduce the cross overlapping of the lines on the road, automatically send out from the power supply point, sequentially pass through the station, lead the lines to be parallel along the central line of the road, carry out wiring in an equidistant mode with other lines in the road, and simultaneously keep the connecting lines spaced by the station to be orthogonal with the station, thereby efficiently carrying out planning layout of the power distribution network.
Description
Technical Field
The invention relates to the field of power systems, in particular to a high-efficiency layout method for power distribution network planning.
Background
The existing power distribution network planning method is characterized in that a grid network frame diagram is required to be drawn when the power distribution network is planned, namely, a road pipe gallery resource path is sent out from a power supply point, and lines adopted by stations on a land block are connected. Because the traditional manual drawing needs to keep the lines parallel to the middle line of the road, and the equidistant lines and the orthogonal lines are always arranged with stations, a great amount of manual adjustment operation is required, if the lines at the transformer station are newly added or adjusted, other lines are required, the overall efficiency is very low, and the progress of the overall construction is not facilitated.
Disclosure of Invention
The invention aims at overcoming the defects of the prior art, and provides a high-efficiency layout method for power distribution network planning.
In order to achieve the above purpose, the present invention adopts the following technical scheme:
A method for planning and efficiently laying out a power distribution network comprises the following steps:
S1, initializing preparation;
S2, establishing a road intermediate line and a road ramp model according to the vector map GIS information;
s3, calculating the number of T joints of the line to two sides of the road, and calculating the serial number of the line on the ramp of the road from high to low according to the number of the T joints on the two sides;
s4, threading the power supply points of each station along the road intermediate line by utilizing a shortest path algorithm of the path passing points from the power supply points according to the sequence of the stations, and paralleling the threading path with the road intermediate line; realizing regular threading;
the regular threading is realized by logically analyzing and orthogonally processing the established road intermediate line and the road ramp model data and synthesizing the GIS geographic road intermediate line, so that the threading path and the road intermediate line are parallel and are distributed in a regular way.
And S5, carrying out orthogonal processing on the connecting lines spaced by the stations and the stations.
The branch circuit is directly connected with the middle of one line, and the branch circuit is connected with the middle of one line in the existing power supply network to supply power for a user.
In step S1, the initialization preparation refers to preprocessing, judging and screening the data information before the road intermediate line and the road ramp model are established.
Further, in S3, the step of calculating the ramp number of the set line on the road includes:
s31, calculating preset ramp resources by combining road intermediate lines, overhead corridor, pipe hole data and station information analysis; the ramp resource is ramp resource of preset ramp, which is produced by taking road line as an intermediate line and generating parallel lines on two sides of the road line, wherein the lines are arranged at equal intervals.
S32, calculating the number of T joints of the line to two sides of the road, and calculating the number of T joints to generate the weight of the line threading the road;
S33, sequencing and numbering according to the weight, and arranging threading according to the sequence, so that the cross overlapping of the lines on the road is reduced.
Further, the data information includes middle line data of a road, middle line data of mountain and river, and middle line data of a road obtained from the vector map GIS information.
Further, in S5, the step of orthogonally processing the connection line spaced by the station and the station includes:
s51, acquiring space vector information data of connecting line nodes spaced by the station;
s52, substituting the space vector information data in the S51 into linear algebraic quadrature processing analysis;
s53, connecting the connecting lines spaced by the stations into the station stations at equal intervals, wherein the connecting lines are parallel to each other.
Further, in S5, the step of orthogonally processing the connection line spaced by the station and the station includes:
s51, acquiring space vector information data of connecting line nodes spaced by the station;
s52, substituting the space vector information data in the S51 into linear algebraic quadrature processing analysis;
s53, connecting the connecting lines spaced by the stations into the station stations at equal intervals, wherein the connecting lines are parallel to each other.
In step S32, the step of calculating the number of T junctions of the calculation line to the two sides of the road includes:
s321, acquiring line equipment node coordinate data, and constructing a record coordinate data structure;
S322, analyzing whether a section of line has T-connection branch lines according to line traversal, and recording the T-connection number of the section of line;
S33, the step of sequencing and numbering according to the weight comprises the following steps:
s331, judging and analyzing the left side and the right side of the threading sub-channel route of the circuit layout according to the coordinates;
S322, carrying out 1-time record on the T joints at the left side and the right side, subtracting the number of the T joints of the same line, associating the marked ramp information with the T joint count of the line, and carrying out sequencing distribution according to the fact that the more T joints are, the closer the line is to the road; if the T joints are the same, the T joints are arranged preferentially according to the first traversing line;
s333, repeating the steps until wiring is completed.
By adopting the technical scheme of the invention, the beneficial effects of the invention are as follows: the invention can reduce the cross overlapping of the lines on the road, can automatically send out from the power supply point, sequentially pass through the station, lead the lines to be parallel along the central line of the road, carry out wiring in an equidistant mode with other lines in the road, and simultaneously keep the connecting lines spaced by the station to be orthogonal with the station, thereby efficiently carrying out planning layout of the power distribution network.
Detailed Description
Specific embodiments of the present invention are further described.
A method for planning and efficiently laying out a power distribution network comprises the following steps:
S1, initializing preparation;
S2, establishing a road intermediate line and a road ramp model according to the vector map GIS information;
s3, calculating the number of T joints of the line to two sides of the road, and calculating the serial number of the line on the ramp of the road from high to low according to the number of the T joints on the two sides;
S4, threading the power supply points of each station along the road intermediate line by utilizing a shortest path algorithm of the path passing points from the power supply points according to the sequence of the stations, and paralleling the threading path with the road intermediate line; realizing regular threading; in the step S4, regular threading is realized by carrying out logic analysis and orthogonal processing on the established road intermediate line and the road ramp model data and synthesizing the GIS geographic road intermediate line, so that the threading path and the road intermediate line are parallel and are distributed in a regular manner.
And S5, carrying out orthogonal processing on the connecting lines spaced by the stations and the stations.
In the step S1, the initialization preparation refers to preprocessing, judging and screening the data information before the road intermediate line and the road ramp model are established.
In the step S3, the step of calculating the ramp number of the set line on the road includes:
S31, calculating preset ramp resources by combining road intermediate lines, overhead corridor, pipe hole data and station information analysis;
s32, calculating the number of T joints of the line to two sides of the road, and calculating the number of T joints to generate the weight of the line threading the road;
s321, acquiring line equipment node coordinate data, and constructing a record coordinate data structure;
S322, analyzing whether a section of line has T-connection branch lines according to line traversal, and recording the T-connection number of the section of line;
S33, sequencing and numbering according to the weight, and arranging threading according to the sequence, so that the cross overlapping of the lines on the road is reduced.
S331, judging and analyzing the left side and the right side of the threading sub-channel route of the circuit layout according to the coordinates;
S322, carrying out 1-time record on the T joints at the left side and the right side, subtracting the number of the T joints of the same line, associating the marked ramp information with the T joint count of the line, and carrying out sequencing distribution according to the fact that the more T joints are, the closer the line is to the road; if the T joints are the same, the T joints are arranged preferentially according to the first traversing line;
s333, repeating the steps until wiring is completed.
The data information comprises middle line data of a road, middle line data of mountain and river and middle line data of the road obtained from the vector map GIS information.
In S5, the step of orthogonally processing the connection line spaced by the station and the station includes:
s51, acquiring space vector information data of connecting line nodes spaced by the station;
s52, substituting the space vector information data in the S51 into linear algebraic quadrature processing analysis;
s53, connecting the connecting lines spaced by the stations into the station stations at equal intervals, wherein the connecting lines are parallel to each other.
Note that the above is only a preferred embodiment of the present invention and the technical principle applied. It will be understood by those skilled in the art that the present invention is not limited to the particular embodiments described herein, but is capable of various obvious changes, rearrangements and substitutions as will now become apparent to those skilled in the art without departing from the scope of the invention. Therefore, while the invention has been described in connection with the above embodiments, the invention is not limited to the embodiments, but may be embodied in many other equivalent forms without departing from the spirit or scope of the invention, which is set forth in the following claims.
Claims (4)
1. The efficient layout method for power distribution network planning is characterized by comprising the following steps of:
S1, initializing preparation;
S2, establishing a road intermediate line and a road ramp model according to the vector map GIS information;
s3, calculating the number of T joints of the line to two sides of the road, and calculating the serial number of the line on the ramp of the road from high to low according to the number of the T joints on the two sides;
in the step S3, the step of calculating the ramp number of the set line on the road includes:
S31, calculating preset ramp resources by combining road intermediate lines, overhead corridor, pipe hole data and station information analysis;
s32, calculating the number of T joints of the line to two sides of the road, and calculating the number of T joints to generate the weight of the line threading the road;
s33, sequencing and numbering according to the weight, and arranging threading according to the sequence, so that the cross overlapping of the lines on the road is reduced;
in step S32, the step of calculating the number of T junctions of the calculation line to the two sides of the road includes:
s321, acquiring line equipment node coordinate data, and constructing a record coordinate data structure;
S322, analyzing whether a section of line has T-connection branch lines according to line traversal, and recording the T-connection number of the section of line;
S33, the step of sequencing and numbering according to the weight comprises the following steps:
s331, judging and analyzing the left side and the right side of the threading sub-channel route of the circuit layout according to the coordinates;
S322, carrying out 1-time record on the T joints on the left side and the right side, subtracting the T joints from each other on the same line, correlating the marked ramp information with the T joint counts of the lines, and carrying out sequencing distribution according to the fact that the more the T joints are, the closer the lines are to the road; if the T joints are the same, the T joints are arranged preferentially according to the first traversing line;
s333, repeating the steps until wiring is completed;
s4, threading the power supply points of each station along the road intermediate line by utilizing a shortest path algorithm of the path passing points from the power supply points according to the sequence of the stations, and paralleling the threading path with the road intermediate line; realizing regular threading;
and S5, carrying out orthogonal processing on the connecting lines spaced by the stations and the stations.
2. The efficient layout method for power distribution network planning according to claim 1, wherein in S1, initialization preparation refers to preprocessing, judging and screening of data information before a road intermediate line and a road ramp model are established.
3. The efficient layout method for power distribution network planning according to claim 2, wherein the data information comprises middle line data of a road, middle line data of mountain and river, middle line data of a river and middle line data of a road obtained from vector map GIS information.
4. An efficient layout method for power distribution network planning as claimed in claim 1, wherein in S5, the step of orthogonally processing the connection lines between the stations and the stations comprises:
s51, acquiring space vector information data of connecting line nodes spaced by the station;
s52, substituting the space vector information data in the S51 into linear algebraic quadrature processing analysis;
s53, connecting the connecting lines spaced by the stations into the station stations at equal intervals, wherein the connecting lines are parallel to each other.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010573429.5A CN111783264B (en) | 2020-06-22 | 2020-06-22 | Efficient layout method for power distribution network planning |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010573429.5A CN111783264B (en) | 2020-06-22 | 2020-06-22 | Efficient layout method for power distribution network planning |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111783264A CN111783264A (en) | 2020-10-16 |
| CN111783264B true CN111783264B (en) | 2024-04-30 |
Family
ID=72756356
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010573429.5A Active CN111783264B (en) | 2020-06-22 | 2020-06-22 | Efficient layout method for power distribution network planning |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111783264B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114065554B (en) * | 2022-01-11 | 2022-04-08 | 国网北京市电力公司 | A method, device, equipment and medium for online planning of distribution network |
| CN116227888B (en) * | 2023-05-05 | 2023-07-28 | 山东大学 | Urban power distribution network planning method and system considering non-cross constraint of lines in road section |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPH10187827A (en) * | 1996-12-19 | 1998-07-21 | Toshiba Corp | Network display device |
| CN103020335A (en) * | 2012-11-23 | 2013-04-03 | 山东电力集团公司 | Method for automatically converting distribution network geographic wiring diagram into region orthogonal diagram |
| CN103984997A (en) * | 2014-05-29 | 2014-08-13 | 国家电网公司 | Transmission project site and line selecting method based on GIS space information |
| CN103996089A (en) * | 2014-06-12 | 2014-08-20 | 国家电网公司 | Electric transmission line optimal path generation method based on GIS |
| WO2017157048A1 (en) * | 2016-03-15 | 2017-09-21 | 厦门亿力吉奥信息科技有限公司 | Automated layout method and system for power grid system graph to overcome crossing, and storage medium |
| CN108694506A (en) * | 2018-05-14 | 2018-10-23 | 广州供电局有限公司 | Power distribution network cable tunnel construction demand amount determines method and device |
| CN110046213A (en) * | 2018-11-20 | 2019-07-23 | 国网陕西省电力公司 | A Power Line Selection Method Considering Path Distortion Correction and Crossover Correction |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2001024111A1 (en) * | 1999-09-30 | 2001-04-05 | Routech, Inc. | Automatic routing system for pc board design |
-
2020
- 2020-06-22 CN CN202010573429.5A patent/CN111783264B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPH10187827A (en) * | 1996-12-19 | 1998-07-21 | Toshiba Corp | Network display device |
| CN103020335A (en) * | 2012-11-23 | 2013-04-03 | 山东电力集团公司 | Method for automatically converting distribution network geographic wiring diagram into region orthogonal diagram |
| CN103984997A (en) * | 2014-05-29 | 2014-08-13 | 国家电网公司 | Transmission project site and line selecting method based on GIS space information |
| CN103996089A (en) * | 2014-06-12 | 2014-08-20 | 国家电网公司 | Electric transmission line optimal path generation method based on GIS |
| WO2017157048A1 (en) * | 2016-03-15 | 2017-09-21 | 厦门亿力吉奥信息科技有限公司 | Automated layout method and system for power grid system graph to overcome crossing, and storage medium |
| CN108694506A (en) * | 2018-05-14 | 2018-10-23 | 广州供电局有限公司 | Power distribution network cable tunnel construction demand amount determines method and device |
| CN110046213A (en) * | 2018-11-20 | 2019-07-23 | 国网陕西省电力公司 | A Power Line Selection Method Considering Path Distortion Correction and Crossover Correction |
Non-Patent Citations (2)
| Title |
|---|
| Detecting Stealthy False Data Injection Using Machine Learning in Smart Grid;Esmalifalak, M.; Lanchao Liu; Nam Nguyen; Rong Zheng; Zhu Han;《IEEE SYSTEMS JOURNAL》;20171206;第11卷(第3期);第1644-1652页 * |
| 停电电网恢复路径优化方法研究;宋坤隆;《中国博士学位论文全文数据库 工程科技Ⅱ辑 (月刊)》;20190715(第7期);C042-20 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111783264A (en) | 2020-10-16 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111783264B (en) | Efficient layout method for power distribution network planning | |
| CN105303021B (en) | The adaptive real-time dynamic Mathematical Modeling Methods of urban track traffic DC traction power-supply system | |
| CN112418532B (en) | Method, device, equipment and storage medium for planning inspection path of power transmission line | |
| CN104617985B (en) | Method and device for power communication network line optimization based on ant colony algorithm | |
| CN103020335A (en) | Method for automatically converting distribution network geographic wiring diagram into region orthogonal diagram | |
| CN103942345B (en) | Method for automatically generating IED network graph | |
| CN105046363A (en) | Gridding method for one-line diagram layout and optimization of zone electric distribution system | |
| KR20220030854A (en) | Collecting method for power line status using IoT and system thereof | |
| CN111309836B (en) | Automatic mapping method and system for single line diagram of 10kV distribution line | |
| CN103810350A (en) | Automatic pel creating method and creating device thereof | |
| CN106021632B (en) | The method of generating the whole network diagram based on the primary wiring diagram of the substation based on the topology relationship | |
| CN104156534A (en) | Objectification power grid topology analysis method for generating black-start scheme | |
| CN104331562A (en) | Geographical wiring diagram dispatching method and device in power grid information system | |
| CN110826862B (en) | Planning system and method for grid frame of urban power transmission grid | |
| CN110035468A (en) | Highly reliable high safety wireless network topology control system | |
| CN109460564B (en) | Power grid tidal current graph wiring method | |
| CN114067036A (en) | An automatic drawing method of distribution network diagram based on 3D visualization | |
| CN109951342A (en) | 3D Matrix Topological Representation of Spatial Information Network and Implementation Method of Routing Traversal Optimization | |
| CN106203708A (en) | A kind of fast method solving urban track traffic last bus connection problem | |
| CN115752493A (en) | A path planning method for power failure emergency repair | |
| CN107330169A (en) | A kind of regional cold supply system pipe network route planning method and system | |
| CN104134175A (en) | System and method for automatically generating distribution automation master station looped network graph | |
| CN108418211B (en) | A Power Supply Path Optimization Method Based on Dijlstra Algorithm and Genetic Algorithm | |
| CN112398224B (en) | Method and system for overall layout of ring network model in distribution ring network diagram | |
| CN103248041A (en) | Looped network detection method based on bus depth conflict calculation |
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 |