CN117010655A - Cable channel planning method, system, electronic equipment and storage medium - Google Patents
Cable channel planning method, system, electronic equipment and storage medium Download PDFInfo
- Publication number
- CN117010655A CN117010655A CN202311027528.3A CN202311027528A CN117010655A CN 117010655 A CN117010655 A CN 117010655A CN 202311027528 A CN202311027528 A CN 202311027528A CN 117010655 A CN117010655 A CN 117010655A
- Authority
- CN
- China
- Prior art keywords
- optimal
- matrix
- road
- substation
- path
- 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
- 238000000034 method Methods 0.000 title claims abstract description 33
- 230000009466 transformation Effects 0.000 claims abstract description 43
- 238000012937 correction Methods 0.000 claims abstract description 16
- 239000011159 matrix material Substances 0.000 claims description 127
- 238000010276 construction Methods 0.000 claims description 65
- 230000037361 pathway Effects 0.000 claims description 12
- 238000004364 calculation method Methods 0.000 claims description 11
- 238000004590 computer program Methods 0.000 claims description 11
- 238000007726 management method Methods 0.000 claims 1
- 238000010586 diagram Methods 0.000 description 6
- 238000004422 calculation algorithm Methods 0.000 description 3
- 230000005611 electricity Effects 0.000 description 3
- 230000009471 action Effects 0.000 description 2
- 230000004888 barrier function Effects 0.000 description 2
- 238000012512 characterization method Methods 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000003491 array Methods 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 230000017525 heat dissipation Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 238000005457 optimization Methods 0.000 description 1
- 230000008569 process Effects 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
- 239000007787 solid Substances 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/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
- G06Q10/06315—Needs-based resource requirements planning or analysis
-
- 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
- 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
- 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)
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Theoretical Computer Science (AREA)
- Economics (AREA)
- Strategic Management (AREA)
- General Physics & Mathematics (AREA)
- Physics & Mathematics (AREA)
- Tourism & Hospitality (AREA)
- Health & Medical Sciences (AREA)
- Databases & Information Systems (AREA)
- Marketing (AREA)
- General Business, Economics & Management (AREA)
- Entrepreneurship & Innovation (AREA)
- General Health & Medical Sciences (AREA)
- Educational Administration (AREA)
- Development Economics (AREA)
- Quality & Reliability (AREA)
- Public Health (AREA)
- Water Supply & Treatment (AREA)
- Game Theory and Decision Science (AREA)
- Primary Health Care (AREA)
- Operations Research (AREA)
- Remote Sensing (AREA)
- Data Mining & Analysis (AREA)
- General Engineering & Computer Science (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention discloses a planning method, a planning system, electronic equipment and a storage medium for a cable channel, wherein the planning method comprises the following steps: counting a transformer and distribution station, a land block load point, a road access point and a road intersection point in a target area; counting the correction route length between two points with direct route in any of the transformer substation, the land block load point, the road access point and the road intersection point; for each land block load point, determining a corresponding optimal power transformation and distribution station and an optimal path between the corresponding optimal power transformation and distribution station; determining the number of cables under each section of road on the optimal path according to the optimal path between each land block load point and the corresponding optimal power transformation and distribution station; and planning cable channels under each section of road on the optimal path according to the number of the cables. According to the invention, the optimal power transformation and distribution station is automatically selected for the land block load points, and the cable channels under each section of road are planned according to the optimal path between the land block load points and the optimal power transformation and distribution station, so that the mismatch between the built cable channels and actual use requirements is avoided.
Description
Technical Field
The invention relates to the technical field of cable channels, in particular to a planning method, a planning system, electronic equipment and a storage medium for a cable channel.
Background
Cable channels are an important urban infrastructure, usually placed under the road, for laying cables from the substation to the load points of the land. At present, the layout of a cable channel and the scale of the cable channel under each section of road are manually determined by planning designers according to the road grade, the distribution condition of a transformer substation and the distribution condition of a land block load point, so that whether the built cable channel is matched with the actual use requirement has larger uncertainty, if the scale of the cable channel under a certain section of road is insufficient, the cable channel under the road is difficult to lay, and the electricity demand of the area possibly cannot be met in the follow-up process; if the cable channel is oversized, excessive empty space can occur in the cable channel, resulting in wasted space and cost.
Disclosure of Invention
The invention aims to overcome the defect that whether the established cable channel is matched with the actual use requirement or not has larger uncertainty due to the fact that the layout of the cable channel and the scale of the cable channel under each section of road are manually determined in the prior art.
The invention solves the technical problems by the following technical scheme:
the invention provides a planning method of a cable channel, which comprises the following steps:
counting a transformer and distribution station, a land block load point, a road access point and a road intersection point in a target area;
counting the routing length between two points with direct routing in any of the substation, the land block load point, the road access point and the road intersection point and the corresponding cable channel construction difficulty coefficient; correcting the route length according to the corresponding cable channel construction difficulty coefficient to obtain a corresponding corrected route length;
determining the optimal power transformation and distribution station corresponding to each land block load point and the optimal path between the optimal power transformation and distribution station and the optimal power transformation and distribution station corresponding to each land block load point; the optimal power substation is a power substation with the minimum sum of the correction route lengths on the optimal path between the optimal power substation and the plot load point, and the optimal path represents the minimum sum of the correction route lengths on the path;
determining the number of cables under each section of road on an optimal path according to the optimal path between each land block load point and the corresponding optimal power transformation and distribution station;
And planning cable channels under each section of road on the optimal path according to the cable quantity.
Preferably, the step of correcting the routing length according to the corresponding cable channel construction difficulty coefficient to obtain a corresponding corrected routing length specifically includes:
and multiplying the routing length by a corresponding cable channel construction difficulty coefficient for each road access point, and taking the obtained product as the corrected routing length.
Preferably, the step of counting the transformer and distribution stations, the land parcel load points, the road access points and the road crossing points in the target area specifically includes:
constructing a basic geographic information data set V= { V 1 、v 2 、v 3 ...v n -a }; element v in the basic geographic information data set 1 ～v s Characterizing the substation, the element v in the basic geographical information data set s+1 ～v t Characterizing the land parcel load points, and the element v in the basic geographic information data set t+1 ～v n Characterizing the road access point and the road junction; s, t and n are positive integers, s is more than 1 and less than t is more than n.
Preferably, the step of counting the routing length between two points of the substation, the land parcel load point, the road access point and the road intersection point, where any direct routing exists, and the corresponding cable channel construction difficulty coefficient specifically includes:
Establishing a route length matrix D; the routing length matrix D is an n×n matrix, and the element D in the routing length matrix D ij Characterizing an element V in the basic geographical information data set V i And element v j A direct routing length therebetween;
establishing a cable channel construction difficulty systemA number matrix K; the cable channel construction difficulty coefficient matrix K is an n-n matrix, and the element K in the cable channel construction difficulty coefficient matrix K ij Characterizing an element V in the basic geographical information data set V i And element v j The construction difficulty coefficient of the cable channel between the two; i and j are positive integers, i is more than or equal to 1 and less than or equal to n, and j is more than or equal to 1 and less than or equal to n.
Preferably, for each road access point, the step of multiplying the routing length by a corresponding cable channel construction difficulty coefficient, and taking the obtained product as the corrected routing length specifically includes:
multiplying the routing length matrix D with the cable channel construction difficulty coefficient matrix K to obtain a corrected routing length matrix A; the modified route length matrix A is an n-n matrix, and the element a in the modified route length matrix A ij Characterizing an element V in the basic geographical information data set V i And element v j A modified routing length therebetween.
Preferably, the step of determining, for each of the plot load points, a corresponding optimal substation determination and an optimal path with the corresponding optimal substation specifically includes:
And for each land block load point, determining the sum of the corrected route lengths on the optimal path between each power transformation and distribution station according to the corrected route lengths, and determining the corresponding optimal power transformation and distribution station and the optimal path between the corresponding optimal power transformation and distribution station according to the sum of the corrected route lengths on the optimal path.
Preferably, the step of determining, for each of the land parcel load points, a sum of corrected route lengths on an optimal path with each of the power transformation and distribution stations according to the corrected route lengths on the optimal path, and determining the optimal power transformation and distribution station corresponding to the sum of corrected route lengths on the optimal path and the optimal path with the optimal power transformation and distribution station corresponding to the sum of corrected route lengths on the optimal path specifically includes:
establishing a path matrix P; the path matrix P is an n-by-n matrix, and the elements P in the path matrix P ij Characterizing an element V from said underlying geographical information data set V i To element v j The last intermediate element to pass;
performing n-time iterative updating on the corrected route length matrix A and the path matrix P to obtain a final corrected route length matrix A * And a final path matrix P * Traversing all elements in the corrected route length matrix A and the path matrix P every time of iterative updating, wherein the final corrected route length matrix A * Elements of (a)Characterizing an element V in the basic geographical information data set V i And element v j The sum of the corrected route lengths on the optimal paths between the two paths, the final path matrix P * Element->Characterizing an element V in the data set V according to the basic geographic information i And element v j An optimal path between from the element v i To the element v j The last intermediate element to pass through, the rule for updating the mth iteration is as follows:
if (a) im +a mj )<a ij
Then a ij ＝(a im +a mj )，p ij ＝a im
For each land block load point, according to the final corrected route length matrix A * Determining a sum of corrected routing lengths on an optimal path with each of the substation;
for each land block load point, taking a substation with the minimum sum of the corrected routing lengths on the optimal path as a corresponding optimal substation;
for each block load point, according to the final path matrix P * An optimal path is determined with the corresponding optimal substation.
The invention also provides a planning system of the cable channel, which comprises:
the first statistics module is used for counting the transformer and distribution stations, the land block load points, the road access points and the road crossing points in the target area;
The second statistical module is used for counting the route length between two points with direct route in any of the transformer substation, the land block load point, the road access point and the road intersection point and the corresponding cable channel construction difficulty coefficient; correcting the route length according to the corresponding cable channel construction difficulty coefficient to obtain a corresponding corrected route length;
the first calculation module is used for determining the corresponding optimal power transformation and distribution station and the optimal path between the corresponding optimal power transformation and distribution station for each land block load point; the optimal power substation is a power substation with the minimum sum of the correction route lengths on the optimal path between the optimal power substation and the plot load point, and the optimal path represents the minimum sum of the correction route lengths on the path;
the second calculation module is used for determining the number of cables under each section of road on the optimal path according to the optimal path between each land block load point and the corresponding optimal substation;
and the planning module is used for planning the cable channels under each section of road on the optimal path according to the number of the cables.
The invention also provides an electronic device, which comprises a memory, a processor and a computer program stored on the memory and capable of running on the processor, wherein the processor realizes the cable channel planning method when executing the computer program.
The invention also provides a computer readable storage medium, on which a computer program is stored, which when being executed by a processor, implements the cable channel planning method described above.
The invention has the positive progress effects that: the invention provides a planning method of a cable channel, which is based on the distribution situation of a transformer substation, a land parcel load point and a road access point, and takes the minimum sum of correction route lengths on an optimal path between the land parcel load point and the transformer substation as a condition, so as to automatically select the optimal transformer substation for the land parcel load point, thereby avoiding unreasonable layout of the cable channel caused by subjective judgment; according to the optimal path between the land block load point and the optimal power transformation and distribution station, the number of cables under each section of road on the optimal path is automatically counted, and then the cable channels under each section of road are planned according to the number of the cables under each section of road, so that the mismatch between the built cable channels and the actual use requirement is avoided.
Drawings
Fig. 1 is a flowchart of a cable channel planning method provided in embodiment 1 of the present invention.
Fig. 2 is a schematic diagram of direct routing in embodiment 1 of the present invention.
Fig. 3 is a schematic cross-sectional view of an electric power grid according to embodiment 1 of the present invention.
Fig. 4 is a schematic cross-sectional view of a cable trench according to embodiment 1 of the present invention.
FIG. 5 shows a green belt width factor k according to embodiment 1 of the present invention 4 Is a schematic diagram of the value curve of (a).
Fig. 6 is a schematic diagram of a planning area in the example provided in embodiment 1 of the present invention.
Fig. 7 is a schematic structural diagram of a cable passage planning system according to embodiment 2 of the present invention.
Fig. 8 is a schematic structural diagram of an electronic device according to embodiment 3 of the present invention.
Detailed Description
The invention is further illustrated by means of examples which follow, without thereby restricting the scope of the invention thereto.
Example 1
The present embodiment provides a cable channel planning method, as shown in fig. 1, including:
s101, counting transformer and distribution stations, land block load points, road access points and road crossing points in a target area.
The power transformation and distribution station is a transformer station or a power distribution station.
S102, counting the routing length between two points with direct routing in any of the substation, the land block load point, the road access point and the road intersection point, and corresponding cable channel construction difficulty coefficients.
Where routing may be summarized as the path from the start of a cable to each destination, i.e. the location of the cable's run. Direct routing means that there are no other points between the origin and destination of the cable. As shown in fig. 2, there is a direct route between two adjacent points on the road, between the road access point and the adjacent substation, and between the road access point and the adjacent block load point. Step S102 is actually to acquire, for each road access point, a routing length between the adjacent other road access point, the adjacent substation, the adjacent block load point, and the adjacent road intersection, and a corresponding cable channel construction difficulty coefficient.
S103, correcting the route length according to the corresponding cable channel construction difficulty coefficient to obtain the corresponding corrected route length.
And S104, determining the corresponding optimal power transformation and distribution station and the optimal path between the corresponding optimal power transformation and distribution station for each land block load point.
The optimal power substation is the power substation with the minimum sum of the correction route lengths on the optimal path between the optimal power substation and the block load point, and the optimal path represents the minimum sum of the correction route lengths on the path. Specifically, there may be many paths between a land load point and a substation, each path having a corresponding sum of corrected routing lengths, and the path having the smallest sum of corrected routing lengths is taken as the optimal path between a land load point and a substation. For each plot load point, determining the optimal path between the power substation and all the power substation, and taking the power substation with the minimum sum of the corrected route lengths of the optimal path between the power substation and the plot load point as the optimal power substation.
S105, determining the number of cables under each section of road on the optimal path according to the optimal path between each land block load point and the corresponding optimal substation.
S106, planning cable channels under each section of road on the optimal path according to the number of the cables.
Wherein planning the cable pathway under each section of road on the optimal path may include determining a scale of the cable pathway. Specifically, the number of cables under each section of road on the optimal path can be determined according to the optimal path between each land block load point and the corresponding optimal power transformation and distribution station and the power supply return number of each land block load point, and then the scale of the cable channel under each section of road on the optimal path is determined according to the number of cables and a certain channel capacity is reserved. Further, if the load of the block load point is a three-stage load, the single-circuit cable is used for supplying power, and if the load of the block load point is a two-stage load or a one-stage load, the double-circuit cable is used for supplying power. The cable channel is mainly scaled by two modes, namely an electric power calandria and a cable pit. As shown in fig. 3, the power grid is provided with a circle of cable effective holes in the periphery and other non-power cable holes in the middle for heat dissipation of the cables, so that when the power grid is adopted, the number of the cable effective holes is larger than that of the routing cables, and a certain margin is reserved. As shown in fig. 4, the cable supporting arms are adopted to lay cables in the cable trench, a space with the diameter which is 1 time of the cable diameter is reserved between the cables on the same supporting arm, typically 3-4 cables are laid by a single supporting arm, a vertical distance which is more than 2 times of the cable diameter is reserved between the supporting arms, the cable supporting arms can be arranged on one side or two sides, the cable trench size is determined according to the principle and according to the number of the cables and after a certain margin is reserved, and the channel width in the cable trench is determined according to the specification.
The embodiment provides a planning method of a cable channel, which is based on the distribution situation of a transformer substation, a land parcel load point and a road access point, and takes the minimum sum of correction route lengths on an optimal path between the land parcel load point and the transformer substation as a condition, so as to automatically select the optimal transformer substation for the land parcel load point, thereby avoiding unreasonable layout of the cable channel caused by subjective judgment; according to the optimal path between the land block load point and the optimal power transformation and distribution station, the number of cables under each section of road on the optimal path is automatically counted, and then the cable channels under each section of road are planned according to the number of the cables under each section of road, so that the mismatch between the built cable channels and the actual use requirement is avoided. Specifically, if the cable passage is not enough in scale, the cable laying under the road is difficult, and the subsequent electricity consumption requirement of the area can not be met; if the cable channel is oversized, excessive empty space can occur in the cable channel, resulting in wasted space and cost.
In an alternative embodiment, step S103 specifically includes:
s1031, multiplying the route length by the corresponding cable channel construction difficulty coefficient for each road access point, and taking the obtained product as the corrected route length.
In an alternative embodiment, step S101 specifically includes:
s1011, constructing a basic geographic information data set V= { V 1 、v 2 、v 3 ...v n }。
Wherein, the element v in the basic geographic information data set 1 ～v s Characterizing transformer substation, element v in a basic geographical information data set s+1 ～v t Characterizing the load point of a land block, and element v in basic geographic information data set t+1 ～v n Characterizing road access points and road intersections; s, t and n are positive integers, s is more than 1 and less than t is more than n.
In an alternative embodiment, step S102 specifically includes:
s1021, establishing a route length matrix D.
Wherein, the routing length matrix D is an n×n matrix, and the element D in the routing length matrix D ij Characterizing an element V in a basic geographical information data set V i And element v j A direct routing length therebetween; i and j are positive integers, i is more than or equal to 1 and less than or equal to n, and j is more than or equal to 1 and less than or equal to n.
Wherein if element v i And element v j Without a direct routing length in between, element d can be ij The value of (2) is set to positive infinity; in the case of i=j, element d ij The value of (2) may be set to 0.
S1022, establishing a cable channel construction difficulty coefficient matrix K.
Wherein the cable channel construction difficulty coefficient matrix K is an n matrix, and the element K in the cable channel construction difficulty coefficient matrix K ij Characterizing an element V in a basic geographical information data set V i And element v j And the difficulty coefficient of the construction of the cable channel.
Specifically, if element v i And element v j Without a direct routing length in between, element k can be ij The value of (2) is set to positive infinity; in the case of i=j, element k ij The value of (2) may be set to 0.
Specifically, the cable channel construction difficulty coefficient may be a result of the combined action of a plurality of factors, which may be determined according to practical situations, which is not limited in this embodiment.
In an alternative embodiment, the cable channel construction difficulty coefficient may be determined comprehensively from road properties, road grades, the number of crossing obstacles, and the greening belt width. Further, the cable channel construction difficulty coefficient can be obtained by the following formula:
k＝k 1 +k 2 +k 3 +k 4
wherein k is the difficulty coefficient of cable channel construction, k 1 Is a road property system, k 2 For road class coefficient, k 3 To cross the barrier number coefficient, k 4 And the band width coefficient is used for greening.
The cable channel construction difficulty coefficient has definite physical meaning, namely the cable channel construction difficulty coefficient k is higher than the difficulty percentage increased by directly excavating and constructing the cable channel under the conventional green belt ij The larger is indicated at v i And element v j The greater the difficulty in constructing the cable pathway therebetween. k (k) 1 ～k 3 The values are determined according to Table 1, k 4 The values in table 1 and fig. 5 are only examples, and specific values may be determined according to actual situations, which is not limited in this embodiment.
TABLE 1
| Road properties | k 1 | Road grade | k 2 | Number of crossing obstacles | k 3 |
| New construction | 1 | Trunk road | 1 | No obstacle | 1 |
| Reconstruction of | 1.3 | Secondary trunk road | 1.15 | Other municipal pipelines | 1.15 |
| Existing technology | 2 | Branch circuit | 1.3 | River crossing | 1.3 |
Specifically, the construction difficulty coefficient of the cable channel is comprehensively determined according to the road property, the road grade, the number of crossing obstacles, the width of the green belt and other factors, and the route length is corrected according to the construction difficulty coefficient of the cable channel, so that the finally obtained corrected route length is fused with various factors, and the method is more in line with engineering practice.
In an alternative manner, step S1031 specifically includes: multiplying the route length matrix D by the cable channel construction difficulty coefficient matrix K to obtain a corrected route length matrix A; correcting the routing length matrix A to be an n-by-n matrix, and correcting the element a in the routing length matrix A ij Characterizing an element V in a basic geographical information data set V i And element v j A modified routing length therebetween.
In an alternative manner, step S104 specifically includes:
S1041, for each land block load point, determining the sum of the corrected route lengths on the optimal path between each power transformation and distribution station according to the corrected route lengths, and determining the optimal power transformation and distribution station corresponding to the sum of the corrected route lengths on the optimal path and the optimal path between the power transformation and distribution station corresponding to the sum of the corrected route lengths.
In an alternative manner, for each plot load point, determining, based on the Floyd path optimization algorithm, a corresponding optimal substation and an optimal path between the corresponding optimal substation and the corresponding optimal substation, step S1041 specifically includes:
s10411, establishing a path matrix P.
Wherein the path matrix P is an n-n matrix, and the elements P in the path matrix P ij Characterizing an element V from a basic geographical information data set V i To element v j The last intermediate element to pass.
S10412, performing n times of iterative updating on the corrected route length matrix A and the path matrix P to obtain a final corrected route length matrix A * And a final path matrix P * 。
Wherein, each iteration updates all elements in the corrected route length matrix A and the path matrix P, and finally corrects the route length matrix A * Elements of (a)Characterizing an element V in a basic geographical information data set V i And element v j The sum of the corrected route lengths on the best paths between them, the final path matrix P * Element->Characterization of element V in data set V according to underlying geographic information i And element v j Optimal path between, from element v i To element v j The last intermediate element to pass through, the rule for updating the mth iteration is as follows:
if (a) im +a mj )<a ij
Then a ij ＝(a im +a mj )，p ij ＝a im
S10413, for each land block load point, correcting the route length matrix A according to the final * The sum of the corrected routing lengths on the optimal path with each substation is determined.
S10414, regarding each land block load point, taking the substation with the minimum sum of the corrected route lengths on the optimal path as the corresponding optimal substation.
S10415, for each plot load point, according to the final path matrix P * An optimal path is determined with the corresponding optimal substation.
Specifically, according to the final path matrix P * The best path searching method is as follows: if the element isAnd element v j Not at the same point, in the final path matrix P * Element->As the end point, element v i As starting point, continue searching element v i Element->The last intermediate point on the best path between, and so on, to obtain element v i And element(s)v j And finally determining the optimal path between the land block load point and the optimal substation.
The method for planning a cable channel in this embodiment is further described below with reference to a specific example:
fig. 6 shows a planning area in which substation power stations are represented by open circles, land load points are represented by triangles, road intersections, land load points are represented by solid circles, and a set V is constructed for the above area. The cable channel is planned in the planning area, comprising the following steps.
Step one: constructing a basic geographic information data set V= { V 1 、v 2 、v 3 ...v 17 }。
Wherein element v 1 ～v 2 Characterizing transformer substation, element v 3 ～v 8 Characterizing load points of a land block, and element v 9 ～v 17 The road access points and road intersections are characterized.
Step two: a route length matrix D is established.
Step three: and establishing a cable channel construction difficulty coefficient matrix K.
Wherein element v 12 And element v 16 Is a direct route of element v 15 And element v 16 There is a river on the direct route of (a), so element k 1216 And element k 1516 The larger the cable channel construction difficulty coefficient is, the larger the difficulty of constructing the cable channel under the straight line route between two points is.
Step four: multiplying the route length matrix D by the cable channel construction difficulty coefficient matrix K to obtain a corrected route length matrix A.
Step five: carrying out n times of iterative updating on the corrected route length matrix A and the route matrix P by adopting a Floyd path optimizing algorithm to obtain a final corrected route length matrix A * And a final path matrix P * 。
Step six: for each land block load point, according to the final corrected route length matrix A * Determining an optimal path with each substationThe sum of the corrected routing lengths.
Step seven: and for each land block load point, taking the substation with the minimum sum of the corrected routing lengths on the optimal path as the corresponding optimal substation.
Step eight: for each land block load point, according to the final path matrix P * An optimal path is determined with the corresponding optimal substation.
After the above steps, the optimal path between each plot load point and the optimal substation is obtained, and the results are shown in table 2. By the load point v of the land block 3 And the optimal power transformation and distribution station v 1 As an example of the optimal path therebetween, as can be seen from fig. 2, the intermediate point on the optimal path is v 9 Then the plot load point v 3 And the optimal power transformation and distribution station v 1 The optimal path between is v 3 -v 9 -v 1 . By the load point v of the land block 7 For example, although the plot load point v 7 Substation v 2 The best path between them passes through fewer intermediate points, but due to the road junction v 12 Crossing v with road 16 There is a river on the direct route between them, so the road intersection v 12 Crossing v with road 16 The construction difficulty coefficient of the cable channel of the direct route between the two is larger, resulting in road crossing point v 12 Crossing v with road 16 The length of the corrected route on the direct route is larger, and finally the load point v of the land block is caused 7 Substation v 2 The sum of the corrected route lengths on the optimal path between the two is larger than the land block load point v 7 Substation v 1 The sum of the corrected routing lengths on the optimal path between them, so that the substation v is finally selected 1 As the load point v of the land parcel 7 Is provided.
TABLE 2
Step nine: and determining the number of cables under each section of road on the optimal path according to the optimal path between each land block load point and the corresponding optimal substation.
In this example, the load at the load point of the land is a secondary load or a primary load, so the power is supplied by the double-return cable. The number of cables laid under each section of road on the optimal path obtained through statistics is shown in table 3.
TABLE 3 Table 3
| Sequence number | Starting point | Endpoint (endpoint) | Number of cables | Sequence number | Starting point | Endpoint (endpoint) | Number of cables |
| 1 | v 1 | v 9 | 6 | 8 | v 12 | v 13 | 2 |
| 2 | v 2 | v 17 | 6 | 9 | v 13 | v 7 | 2 |
| 3 | v 9 | v 3 | 2 | 10 | v 15 | v 5 | 2 |
| 4 | v 9 | v 10 | 4 | 11 | v 15 | v 6 | 2 |
| 5 | v 10 | v 11 | 4 | 12 | v 16 | v 15 | 4 |
| 6 | v 11 | v 4 | 2 | 13 | v 17 | v 8 | 2 |
| 7 | v 11 | v 12 | 2 | 14 | v 17 | v 16 | 4 |
Step ten: and planning cable channels under each section of road on the optimal path according to the number of the cables.
Example 2
The present embodiment provides a cable channel planning system, as shown in fig. 7, where the planning system 20 includes a first statistics module 21, a second statistics module 22, a first calculation module 23, a second calculation module 24, and a planning module 25.
The first statistics module is used for counting power transformation and distribution stations, land block load points, road access points and road crossing points in the target area.
The power transformation and distribution station is a transformer station or a power distribution station.
The second statistical module is used for counting the routing length between two points with direct routing in any of the substation, the land block load point, the road access point and the road intersection point and corresponding cable channel construction difficulty coefficients; and correcting the route length according to the corresponding cable channel construction difficulty coefficient to obtain the corresponding corrected route length.
Where routing may be summarized as the path from the start of a cable to each destination, i.e. the location of the cable's run. Direct routing means that there are no other points between the origin and destination of the cable. Direct routes exist between two adjacent points on the road, between the road access point and the adjacent substation, and between the road access point and the adjacent plot load point. The second statistical module obtains, for each road access point, the routing length between the adjacent other road access points, the adjacent substation, the adjacent plot load point and the adjacent road intersection, and the corresponding cable channel construction difficulty coefficient.
The first calculation module is used for determining the corresponding optimal power transformation and distribution station and the optimal path between the corresponding optimal power transformation and distribution station for each land block load point; the optimal substation is a substation with the minimum sum of the corrected route lengths on the optimal path between the optimal substation and the plot load point, and the optimal path represents the minimum sum of the corrected route lengths on the path.
And the second calculation module is used for determining the number of cables under each section of road on the optimal path according to the optimal path between each land block load point and the corresponding optimal substation.
The optimal power substation is the power substation with the minimum sum of the correction route lengths on the optimal path between the optimal power substation and the block load point, and the optimal path represents the minimum sum of the correction route lengths on the path. Specifically, there may be many paths between a land load point and a substation, each path having a corresponding sum of corrected routing lengths, and the path having the smallest sum of corrected routing lengths is taken as the optimal path between a land load point and a substation. For each plot load point, determining the optimal path between the power substation and all the power substation, and taking the power substation with the minimum sum of the corrected route lengths of the optimal path between the power substation and the plot load point as the optimal power substation.
The planning module is used for planning cable channels under each section of road on the optimal path according to the number of the cables.
Wherein planning the cable pathway under each section of road on the optimal path may include determining a scale of the cable pathway. Specifically, the number of cables under each section of road on the optimal path can be determined according to the optimal path between each land block load point and the corresponding optimal power transformation and distribution station and the power supply return number of each land block load point, and then the scale of the cable channel under each section of road on the optimal path is determined according to the number of cables and a certain channel capacity is reserved. Further, if the load of the block load point is a three-stage load, the single-circuit cable is used for supplying power, and if the load of the block load point is a two-stage load or a one-stage load, the double-circuit cable is used for supplying power. The cable channel is mainly scaled by two modes, namely an electric power calandria and a cable pit. The power grid is provided with a plurality of cable effective holes, and the periphery of the power grid is provided with a plurality of cable effective holes, and the middle part of the power grid is provided with other non-power cable holes. The cable groove is laid by adopting the cable support arms, a space with the diameter of 1 time of the cable is reserved between the cables on the same support arm, generally, 3-4 cables are laid by adopting a single support arm, a vertical distance with the diameter of more than 2 times of the cable is reserved between the support arms, the cable support arms can be arranged on one side or two sides according to the principle, the cable groove size is determined according to the number of the cables and after a certain margin is reserved, and the channel width in the cable groove is determined according to the specification.
The embodiment provides a planning system of a cable channel, which is based on the distribution situation of a transformer substation, a land parcel load point and a road access point, and automatically selects an optimal transformer substation for the land parcel load point on the condition that the sum of correction route lengths on an optimal path between the land parcel load point and the transformer substation is minimum, so that unreasonable layout of the cable channel caused by subjective judgment is avoided; according to the optimal path between the land block load point and the optimal power transformation and distribution station, the number of cables under each section of road on the optimal path is automatically counted, and then the cable channels under each section of road are planned according to the number of the cables under each section of road, so that the mismatch between the built cable channels and the actual use requirement is avoided. Specifically, if the cable passage is not enough in scale, the cable laying under the road is difficult, and the subsequent electricity consumption requirement of the area can not be met; if the cable channel is oversized, excessive empty space can occur in the cable channel, resulting in wasted space and cost.
In an alternative embodiment, the first calculation module is specifically configured to multiply, for each road access point, the routing length by the corresponding cable channel construction difficulty coefficient, and take the obtained product as the corrected routing length.
In an alternative embodiment, the first statistics module is specifically configured to construct the basic geographic information data set v= { V 1 、v 2 、v 3 ...v n }。
Wherein, the element v in the basic geographic information data set 1 ～v s Characterizing transformer substation, element v in a basic geographical information data set s+1 ～v t Characterizing the load point of a land block, and element v in basic geographic information data set t+1 ～v n Characterizing road access points and road intersections; s, t and n are positive integers, s is more than 1 and less than t is more than n.
In an alternative embodiment, the second statistical module is specifically configured to establish a routing length matrix D and a cable channel construction difficulty coefficient matrix K.
Wherein, the routing length matrix D is an n×n matrix, and the element D in the routing length matrix D ij Characterizing an element V in a basic geographical information data set V i And element v j A direct routing length therebetween; i and j are positive integers, i is more than or equal to 1 and less than or equal to n, and j is more than or equal to 1 and less than or equal to n; if element v i And element v j Without a direct routing length in between, element d can be ij The value of (2) is set to positive infinity; in the case of i=j, element d ij The value of (2) may be set to 0.
Wherein the cable channel construction difficulty coefficient matrix K is an n matrix, and the element K in the cable channel construction difficulty coefficient matrix K ij Characterizing an element V in a basic geographical information data set V i And element v j And the difficulty coefficient of the construction of the cable channel.
Specifically, if element v i And element v j Without a direct routing length in between, element k can be ij The value of (2) is set to positive infinity; in the case of i=jIn the case of element k ij The value of (2) may be set to 0.
Specifically, the cable channel construction difficulty coefficient may be a result of the combined action of a plurality of factors, which may be determined according to practical situations, which is not limited in this embodiment.
In an alternative embodiment, the cable channel construction difficulty coefficient may be determined comprehensively from road properties, road grades, the number of crossing obstacles, and the greening belt width. Further, the cable channel construction difficulty coefficient can be obtained by the following formula:
k＝k 1 +k 2 +k 3 +k 4
wherein k is the difficulty coefficient of cable channel construction, k 1 Is a road property system, k 2 For road class coefficient, k 3 To cross the barrier number coefficient, k 4 And the band width coefficient is used for greening.
The cable channel construction difficulty coefficient has definite physical meaning, namely the cable channel construction difficulty coefficient k is higher than the difficulty percentage increased by directly excavating and constructing the cable channel under the conventional green belt ij The larger is indicated at v i And element v j The greater the difficulty in constructing the cable pathway therebetween. Specifically, the construction difficulty coefficient of the cable channel is comprehensively determined according to the road property, the road grade, the number of crossing obstacles, the width of the green belt and other factors, and the route length is corrected according to the construction difficulty coefficient of the cable channel, so that the finally obtained corrected route length is fused with various factors, and the method is more in line with engineering practice.
In an optional manner, the second statistical module is specifically configured to multiply the routing length matrix D with the cable channel construction difficulty coefficient matrix K to obtain a modified routing length matrix a; correcting the routing length matrix A to be an n-by-n matrix, and correcting the element a in the routing length matrix A ij Characterizing an element V in a basic geographical information data set V i And element v j A modified routing length therebetween.
In an alternative manner, the first calculation module is specifically configured to determine, for each plot load point, a sum of corrected route lengths on an optimal path with each substation according to the corrected route lengths, and determine, according to the sum of corrected route lengths on the optimal path, a corresponding optimal substation and an optimal path with the corresponding optimal substation.
In an optional manner, for each plot load point, determining a corresponding optimal substation and an optimal path between the corresponding optimal substation and the corresponding optimal substation based on a Floyd path optimizing algorithm, wherein the first calculation module is specifically used for establishing a path matrix P; performing n times of iterative updating on the corrected route length matrix A and the path matrix P to obtain a final corrected route length matrix A * And a final path matrix P * The method comprises the steps of carrying out a first treatment on the surface of the For each land block load point, according to the final corrected route length matrix A * Determining a sum of corrected routing lengths on the optimal path with each substation; for each land block load point, taking a substation with the minimum sum of the corrected routing lengths on the optimal path as a corresponding optimal substation; for each land block load point, according to the final path matrix P * An optimal path is determined with the corresponding optimal substation.
Wherein the path matrix P is an n-n matrix, and the elements P in the path matrix P ij Characterizing an element V from a basic geographical information data set V i To element v j The last intermediate element to pass.
Wherein, each iteration updates all elements in the corrected route length matrix A and the path matrix P, and finally corrects the route length matrix A * Elements of (a)Characterizing an element V in a basic geographical information data set V i And element v j The sum of the corrected route lengths on the best paths between them, the final path matrix P * Element->Characterization of element V in data set V according to underlying geographic information i And element v j Optimal path between, from element v i To element v j The last intermediate element to pass through, the rule for updating the mth iteration is as follows:
If (a) im +a mj )<a ij
Then a ij ＝(a im +a mj )，p ij ＝a im
Specifically, according to the final path matrix P * The best path searching method is as follows: if the element isAnd element v j Not at the same point, in the final path matrix P * Element->As the end point, element v i As starting point, continue searching element v i Element->The last intermediate point on the best path between, and so on, to obtain element v i And element v j And finally determining the optimal path between the land block load point and the optimal substation.
Example 3
Fig. 8 is a schematic structural diagram of an electronic device according to embodiment 3 of the present invention. Comprising a memory, a processor and a computer program stored on the memory and executable on the processor, the processor implementing the cable channel planning method of the foregoing embodiment 1 when executing the computer program. The electronic device 30 shown in fig. 8 is merely an example, and should not be construed as limiting the functionality and scope of use of embodiments of the present invention.
The electronic device 30 may be in the form of a general purpose computing device, which may be a server device, for example. Components of electronic device 30 may include, but are not limited to: the at least one processor 31, the at least one memory 32, a bus 33 connecting the different system components, including the memory 32 and the processor 31.
The bus 33 includes a data bus, an address bus, and a control bus.
Memory 32 may include volatile memory such as Random Access Memory (RAM) 321 and/or cache memory 322, and may further include Read Only Memory (ROM) 323.
Memory 32 may also include a program/utility 325 having a set (at least one) of program modules 324, such program modules 324 including, but not limited to: an operating system, one or more application programs, other program modules, and program data, each or some combination of which may include an implementation of a network environment.
The processor 31 executes various functional applications and data processing, such as the cable pathway planning method of embodiment 1 of the present invention, by running a computer program stored in the memory 32.
The electronic device 30 may also communicate with one or more external devices 34 (e.g., keyboard, pointing device, etc.). Such communication may be through an input/output (I/O) interface 35. Also, model-generating device 30 may also communicate with one or more networks, such as a Local Area Network (LAN), a Wide Area Network (WAN), and/or a public network, such as the internet, via network adapter 36. As shown, network adapter 36 communicates with the other modules of model-generating device 30 via bus 33. It should be appreciated that although not shown in the figures, other hardware and/or software modules may be used in connection with the model-generating device 30, including, but not limited to: microcode, device drivers, redundant processors, external disk drive arrays, RAID (disk array) systems, tape drives, data backup storage systems, and the like.
It should be noted that although several units/modules or sub-units/modules of an electronic device are mentioned in the above detailed description, such a division is merely exemplary and not mandatory. Indeed, the features and functionality of two or more units/modules described above may be embodied in one unit/module in accordance with embodiments of the present invention. Conversely, the features and functions of one unit/module described above may be further divided into ones that are embodied by a plurality of units/modules.
Example 4
The present invention also provides a computer readable medium having stored thereon a computer program which, when executed by a processor, implements the cable pathway planning method of the foregoing embodiment 1.
More specifically, among others, readable storage media may be employed including, but not limited to: portable disk, hard disk, random access memory, read only memory, erasable programmable read only memory, optical storage device, magnetic storage device, or any suitable combination of the foregoing.
In a possible embodiment, the invention may also be implemented in the form of a program product comprising program code for causing a terminal device to carry out the planning method of cable channels implementing embodiment 1, when said program product is run on the terminal device.
Wherein the program code for carrying out the invention may be written in any combination of one or more programming languages, which program code may execute entirely on the user device, partly on the user device, as a stand-alone software package, partly on the user device and partly on the remote device or entirely on the remote device.
While specific embodiments of the invention have been described above, it will be appreciated by those skilled in the art that this is by way of example only, and the scope of the invention is defined by the appended claims. Various changes and modifications to these embodiments may be made by those skilled in the art without departing from the principles and spirit of the invention, but such changes and modifications fall within the scope of the invention.
Claims (10)
1. A method of planning a cable pathway, the method comprising:
counting a transformer and distribution station, a land block load point, a road access point and a road intersection point in a target area;
counting the routing length between two points with direct routing in any of the substation, the land block load point, the road access point and the road intersection point and the corresponding cable channel construction difficulty coefficient; correcting the route length according to the corresponding cable channel construction difficulty coefficient to obtain a corresponding corrected route length;
Determining the optimal power transformation and distribution station corresponding to each land block load point and the optimal path between the optimal power transformation and distribution station and the optimal power transformation and distribution station corresponding to each land block load point; the optimal power substation is a power substation with the minimum sum of the correction route lengths on the optimal path between the optimal power substation and the plot load point, and the optimal path represents the minimum sum of the correction route lengths on the path;
determining the number of cables under each section of road on an optimal path according to the optimal path between each land block load point and the corresponding optimal power transformation and distribution station;
and planning cable channels under each section of road on the optimal path according to the cable quantity.
2. The method for planning a cable channel according to claim 1, wherein the step of correcting the routing length according to the corresponding cable channel construction difficulty coefficient to obtain the corresponding corrected routing length specifically comprises:
and multiplying the routing length by a corresponding cable channel construction difficulty coefficient for each road access point, and taking the obtained product as the corrected routing length.
3. The method for planning a cable pathway of claim 2, wherein said step of counting power substation, land parcel load points, road access points and road intersections within the target area comprises:
Constructing a basic geographic information data set V= { V 1 、v 2 、v 3 ...v n -a }; element v in the basic geographic information data set 1 ～v s Characterizing the substation, the element v in the basic geographical information data set s+1 ～v t Characterizing the plot load points, the base plotElement v in a management information data set t+1 ～v n Characterizing the road access point and the road junction; s, t and n are positive integers, s is more than 1 and less than t is more than n.
4. A method for planning a cable channel according to claim 3, wherein said step of counting the routing length between two points of any direct route existing in said substation, said land parcel load point, said road access point and said road intersection point and the corresponding cable channel construction difficulty coefficient specifically comprises:
establishing a route length matrix D; the routing length matrix D is an n×n matrix, and the element D in the routing length matrix D ij Characterizing an element V in the basic geographical information data set V i And element v j A direct routing length therebetween;
establishing a cable channel construction difficulty coefficient matrix K; the cable channel construction difficulty coefficient matrix K is an n-n matrix, and the element K in the cable channel construction difficulty coefficient matrix K ij Characterizing an element V in the basic geographical information data set V i And element v j The construction difficulty coefficient of the cable channel between the two; i and j are positive integers, i is more than or equal to 1 and less than or equal to n, and j is more than or equal to 1 and less than or equal to n.
5. The cable tunnel planning method according to claim 4, wherein the step of multiplying the routing length by a corresponding cable tunnel construction difficulty coefficient for each of the road access points, and taking the obtained product as the corrected routing length specifically comprises:
multiplying the routing length matrix D with the cable channel construction difficulty coefficient matrix K to obtain a corrected routing length matrix A; the modified route length matrix A is an n-n matrix, and the element a in the modified route length matrix A ij Characterizing an element V in the basic geographical information data set V i And element v j A modified routing length therebetween.
6. The method of claim 5, wherein the step of determining, for each of the plot load points, a corresponding optimal substation determination and an optimal path with the corresponding optimal substation comprises:
and for each land block load point, determining the sum of the corrected route lengths on the optimal path between each power transformation and distribution station according to the corrected route lengths, and determining the corresponding optimal power transformation and distribution station and the optimal path between the corresponding optimal power transformation and distribution station according to the sum of the corrected route lengths on the optimal path.
7. The method of planning a cable pathway of claim 6, wherein said step of determining, for each of said plot load points, a sum of corrected route lengths on an optimal path with each of said substation, and determining, based on said sum of corrected route lengths on said optimal path, a corresponding optimal substation and an optimal path with a corresponding optimal substation, comprises:
establishing a path matrix P; the path matrix P is an n-by-n matrix, and the elements P in the path matrix P ij Characterizing an element V from said underlying geographical information data set V i To element v j The last intermediate element to pass;
performing n-time iterative updating on the corrected route length matrix A and the path matrix P to obtain a final corrected route length matrix A * And a final path matrix P * Traversing all elements in the corrected route length matrix A and the path matrix P every time of iterative updating, wherein the final corrected route length matrix A * Elements of (a)Characterizing an element V in the basic geographical information data set V i And element v j The sum of the corrected route lengths on the optimal paths between the two paths, the final path matrix P * Elements of (a)Characterizing an element V in the data set V according to the basic geographic information i And element v j An optimal path between from the element v i To the element v j The last intermediate element to pass through, the rule for updating the mth iteration is as follows:
if (a) im +a mj )<a ij
Then a ij ＝(a im +a mj )，p ij ＝a im
For each land block load point, according to the final corrected route length matrix A * Determining a sum of corrected routing lengths on an optimal path with each of the substation;
for each land block load point, taking a substation with the minimum sum of the corrected routing lengths on the optimal path as a corresponding optimal substation;
for each block load point, according to the final path matrix P * An optimal path is determined with the corresponding optimal substation.
8. A cable pathway planning system, the planning system comprising:
the first statistics module is used for counting the transformer and distribution stations, the land block load points, the road access points and the road crossing points in the target area;
the second statistical module is used for counting the route length between two points with direct route in any of the transformer substation, the land block load point, the road access point and the road intersection point and the corresponding cable channel construction difficulty coefficient; correcting the route length according to the corresponding cable channel construction difficulty coefficient to obtain a corresponding corrected route length;
The first calculation module is used for determining the corresponding optimal power transformation and distribution station and the optimal path between the corresponding optimal power transformation and distribution station for each land block load point; the optimal power substation is a power substation with the minimum sum of the correction route lengths on the optimal path between the optimal power substation and the plot load point, and the optimal path represents the minimum sum of the correction route lengths on the path;
the second calculation module is used for determining the number of cables under each section of road on the optimal path according to the optimal path between each land block load point and the corresponding optimal substation;
and the planning module is used for planning the cable channels under each section of road on the optimal path according to the number of the cables.
9. An electronic device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, characterized in that the processor implements the cable channel planning method according to any one of claims 1 to 7 when executing the computer program.
10. A computer readable storage medium, on which a computer program is stored, characterized in that the computer program, when being executed by a processor, implements the cable channel planning method according to any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311027528.3A CN117010655A (en) | 2023-08-15 | 2023-08-15 | Cable channel planning method, system, electronic equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311027528.3A CN117010655A (en) | 2023-08-15 | 2023-08-15 | Cable channel planning method, system, electronic equipment and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN117010655A true CN117010655A (en) | 2023-11-07 |
Family
ID=88576086
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202311027528.3A Pending CN117010655A (en) | 2023-08-15 | 2023-08-15 | Cable channel planning method, system, electronic equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN117010655A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN118521017A (en) * | 2024-07-23 | 2024-08-20 | 浙江威星智能仪表股份有限公司 | Pipeline construction path planning method and system and electronic equipment |
-
2023
- 2023-08-15 CN CN202311027528.3A patent/CN117010655A/en active Pending
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN118521017A (en) * | 2024-07-23 | 2024-08-20 | 浙江威星智能仪表股份有限公司 | Pipeline construction path planning method and system and electronic equipment |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Lumbreras et al. | The new challenges to transmission expansion planning. Survey of recent practice and literature review | |
| CN117010655A (en) | Cable channel planning method, system, electronic equipment and storage medium | |
| CN112990538B (en) | Method, device and equipment for determining collecting line of mountain photovoltaic power station | |
| Hou et al. | Overall optimization for offshore wind farm electrical system | |
| CN112734124B (en) | Public parking lot point arrangement planning method based on supply-demand balance and optimal accessibility | |
| CN112487626B (en) | Photovoltaic power station wiring method and device | |
| CN112650888B (en) | Regional comprehensive energy system site selection planning method and system based on graph theory | |
| CN106941256A (en) | The power distribution network main transformer contact structure optimization planing method of meter and net capability and minimum contact construction cost | |
| JP3194369B2 (en) | Access communication network design tool, design method and recording medium | |
| CN115544699B (en) | Submarine cable layout optimization method, submarine cable layout optimization device, submarine cable layout optimization equipment and submarine cable layout optimization medium based on genetic algorithm | |
| CN111784141A (en) | Power supply reliability evaluation method, device, equipment and storage medium | |
| CN103729802A (en) | Rapid positioning method and device based on power grid equipment geographic information hierarchical index | |
| CN114065634A (en) | Data-driven power quality monitoring and stationing optimization method and device | |
| CN112464545A (en) | Layout method, system, equipment and medium for cables and transformer substation of offshore wind farm | |
| CN112258233B (en) | Method and device for determining site selection and capacity of regional comprehensive energy station | |
| CN112541614B (en) | Distributed active power grid power supply path optimization method and system for realizing same | |
| CN116910951B (en) | Regional heating pipe network optimization design method and device | |
| CN113868812A (en) | Medium voltage distribution network cable path planning method based on intelligent ant colony algorithm | |
| CN116739195A (en) | Automatic planning method, system and storage medium for maintenance path of converter station | |
| CN112052980A (en) | Fault analysis and prediction method for distribution network line of transformer substation | |
| CN108694506B (en) | Method and device for determining construction demand of power distribution network cable tunnel | |
| JP2020194239A (en) | Energy facility planning device and energy facility planning method | |
| CN111079982A (en) | Planning method, system, medium and electronic device for cable path of wind power plant | |
| Çakmak et al. | An optimization-based approach for automated generation of residential low-voltage grid models using open data and open source software | |
| CN112258149A (en) | Method, device, equipment and storage medium for determining circuit switchable power supply rate |
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 |