CN106934487B - Three-dimensional space laying path optimization method for multiple cables - Google Patents
Three-dimensional space laying path optimization method for multiple cables Download PDFInfo
- Publication number
- CN106934487B CN106934487B CN201710064123.5A CN201710064123A CN106934487B CN 106934487 B CN106934487 B CN 106934487B CN 201710064123 A CN201710064123 A CN 201710064123A CN 106934487 B CN106934487 B CN 106934487B
- Authority
- CN
- China
- Prior art keywords
- vertex
- cable
- axis
- cables
- vector
- 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
- 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
Landscapes
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Engineering & Computer Science (AREA)
- Strategic Management (AREA)
- Economics (AREA)
- Marketing (AREA)
- Game Theory and Decision Science (AREA)
- Entrepreneurship & Innovation (AREA)
- Development Economics (AREA)
- Operations Research (AREA)
- Quality & Reliability (AREA)
- Tourism & Hospitality (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Electric Cable Installation (AREA)
Abstract
The invention discloses a three-dimensional space laying path optimization method for a plurality of cables, which comprises the steps of preliminarily pre-arranging cables, and seeking a shortest path for each cable line; planning the cable arrangement direction; finishing all cable laying plans; the shortest path of the cable is solved by utilizing a Djkstra algorithm to perform preliminary pre-arrangement on the distribution of the cable, then the capacity, the sequence and the limitation of a support are combined, the minimum turning point and the minimum crossing point are taken as objective functions, the arrangement position judgment is performed by utilizing the next two vertexes of each cable, the position relation of the cable is further planned, the purpose of minimizing the number of the turning points and the number of the crossing points of the cable is finally achieved, and finally the construction requirements and the limitation conditions of cable laying are combined to ensure the minimum turning number and the minimum number of staggered layers of the cable, so that a better laying result is obtained, and the method has important guiding significance for a cable laying construction party.
Description
Technical Field
The invention relates to the technical field of cable laying, in particular to a three-dimensional space laying path optimization method for a plurality of cables.
Background
In the construction of substations, cable laying is a complex and cumbersome task. After the general design institute makes the overall design and provides the design result, the construction unit still needs to do a large amount of laying work. Due to the lack of effective design means, the design method is mainly a manual design method at present. The designer needs to manually find the starting and ending devices for cable connection on the plane of the bridge diagram and then find the best path from the starting device to the ending device so as to lay the cable. The mode has high labor intensity and low reliability. If the design is unreasonable, can appear the cable very easily and seriously alternately, phenomenon such as cable pile up, influence the cable laying effect in later stage, reduce work efficiency, can increase the cable simultaneously extravagant, increase cost.
For the problem of low laying efficiency, it is necessary to provide an optimal design algorithm for a cable laying path scheme. The method is characterized in that the prior cable laying optimization design technology is searched, most of the prior optimization algorithms adopt a shortest path method and an improved algorithm thereof, all cable paths are abstracted into a complex network, the sequence of laying a plurality of cables is neglected, the specific laying of a plurality of cables in each path is not considered, and a tree-shaped or mesh search algorithm is adopted to design the laying of the plurality of cables; most algorithms are based on the design of the laying algorithm of a single cable or a plurality of cables, and the design of the laying algorithm of a plurality of cables is seldom involved. And some ignore limitations of actual cabling, such as capacity limitations, cable type limitations, etc., during the cabling process.
Disclosure of Invention
The invention aims to provide a three-dimensional space laying path optimization method of a plurality of cables, which utilizes a Djkstra algorithm to solve the shortest path of the cables to preliminarily pre-arrange the distribution of the cables, then combines the limits of capacity, sequence and support, takes the minimum turning point and the minimum cross point as objective functions, utilizes the next two vertexes passed by each cable to judge the arrangement position, further plans the position relation of the cables and finally achieves the purpose of minimizing the turning point number and the cross point number of the cables.
In order to achieve the above object, the present invention provides a method for optimizing a three-dimensional laying path of a plurality of cables, the method comprising the steps of:
A. cables are preliminarily arranged, and the shortest path is searched for each cable line;
1) constructing a mathematical model for the cable trench: regarding turning or crossed nodes of the cable trenches as vertexes, regarding the cable trenches as edges, weighting each edge according to the actual length of each cable trench, and regarding an obtained transformer substation planning model as a graph;
wherein: collecting all vertexes in the graph into a vertex set V, and dividing the vertex set V into two groups, wherein the first group is a vertex set S with the shortest path solved, and the second group is a vertex set U with the rest undetermined shortest paths;
2) selecting a cable, initially considering the cable passing through the first vertex of the cable trench as a source vertex v0Setting the source vertex v0Has a distance of 0, and the vertex set S only contains the source vertex v0I.e. S ═ v0H, the vertex set U includes the source-divided vertex v0Other vertices than the one, i.e. U ═ UnN is an integer greater than or equal to 0;
the specific process of weighting each edge according to the actual length of each cable trench is as follows: if the source vertex v0And the vertex unWith an edge, then<un,v0>Representing the weighted value, i.e. the weighted value is the source vertex v0And the vertex unThe distance between them; if the vertex u isnNot the source vertex v0The edge-out adjacent point of (2) then<un,v0>The weight is ∞, i.e. it means that the source vertex v is unknown0Leading to vertex unA path of (a);
3) calculating the v from the source vertex in step 1) using the Djkstra algorithm0To the shortest path length between any one of the vertices in the set of vertices U, and by the shortest path lengthIncreasing the order of the vertices U in the set of vertices UnAdding into the vertex set S:
31) selecting a distance source vertex v from the vertex set U0Smallest vertex u0Let the vertex u0Adding the vertex set S and the vertex u0Removing from the vertex set U;
32) with the vertex u0As an intermediate revision point, for any other vertex U in the set of vertices U1～nNot including vertex u0If from the source vertex v0Through the vertex u0To the vertex u1～nFrom the source vertex v0Not passing through the vertex u0To the vertex u1～nIs small, i.e. the source vertex v0To the vertex u0Distance of (d) plus vertex u0To the vertex u1～nIs less than the source vertex v0To the vertex u1～nThen modify other vertices U in vertex set U1～nThe modified vertex set U, and other vertices U in the modified vertex set U1～nIs the source vertex v0To the vertex u0Plus the source vertex v0And the vertex u1～nThe weight on the edge;
4) repeating the steps 31) and 32), and selecting a current distance source vertex v from the vertex set U according to the step 31)0Smallest vertex u1Let the vertex u1Adding the vertex u to the vertex set S1Removing from the vertex set U; then, the vertex U in the vertex set U is updated again according to the rule in the step 32)2～nA distance value of (d); continuing to repeat the step 31) and the step 32) until all the vertexes in the vertex set U are moved into the vertex set S until all the vertexes are contained in the vertex set S;
B. planning the cable arrangement direction;
5) establishing a three-dimensional space coordinate system, and setting the positive and negative directions of all cable trenches along an X axis, a Y axis and a Z axis;
determining the space arrangement direction rule of each cable in each cable trench according to the established three-dimensional space coordinate system of the cable trench;
from the observation of the coordinate axes in the three-dimensional spatial coordinate system, the steering of each cable is defined as follows:
determining according to the shortest path of each cable in the step A): turning to the right in the positive direction of the X axis and turning to the positive direction of the Y axis, turning to the left in the positive direction of the X axis and turning to the left in the negative direction of the Y axis, turning to the left in the positive direction of the Y axis, turning to the right in the negative direction of the Y axis in the negative direction of the X axis, turning to the upstairs in the positive direction of the Z axis in the horizontal direction and turning to the downstairs in the negative direction of the Z axis in the horizontal direction, wherein the horizontal direction comprises the positive and negative directions of;
6) comparing the lengths of all the cables to be laid, and planning the trend of the cables in the cable trench according to the lengths of the cables from long to short in sequence according to the mode of preliminary cable pre-arrangement in the step A):
7) determining the direction of laying of each cable
71) When a certain cable is laid to a certain vertex p1, detecting and extracting the coordinates of the vertex p1 and the position coordinates to be laid to the next two vertices p2 and p3, and caching the cable information and the steering information as cable position processing objects;
72) determining the spatial arrangement direction rule of each cable in each cable trench and the turning definition of each cable according to the step 5), determining the direction in which the cable is to be laid according to the three-point coordinates of the vertex p1, the vertex p2 and the vertex p3 in the step 71), arranging the cable on the side, to be turned, of the bracket according to the turning information, and recording the cable in a cable position processing object;
C. finishing all cable laying plans;
8) primarily arranging cables according to the cable position information recorded in the cable position processing object in the step 7): firstly, sorting according to the layer relation in the cable position processing object, and then numbering the cables according to the left-right relation sequence; then finely arranging the cables, and arranging all the cables on the bracket in a layered manner; and finally, storing all cable laying planning results according to the output requirements.
Further, when the number of cables is 2 or more, repeating step 2), step 3), and step 4) in step a until the shortest path of all the cables is obtained.
Further, after the step C is completed, the inevitable intersection points are shown on the overall layout chart, the inevitable intersection points are indicated in different colors, and the intersected cables are listed.
Further, in the step 3) and the step 4), the source vertex v to be selected in the step 31) is selected0The vertex with the smallest distance always remains from the source vertex v during the addition to the set of vertices S0The length of the shortest path to each vertex in the vertex set S is not more than v from the source vertex0The shortest path length of the selected vertex is not contained in any other vertex in the vertex set U; the vertex distances in vertex set U in step 32) are from source vertex v0The length of the current shortest path to the vertex in the vertex set U only includes the vertex in the vertex set S as the middle vertex, that is, the distance of any vertex in the vertex set U refers to the length from the source vertex v0To any vertex in the vertex set U, only the shortest path length among the paths passing through the point in the vertex set S.
Further, in the step 5), determining a spatial arrangement direction rule of each cable in each cable trench according to the established three-dimensional spatial coordinate system of the cable trench as follows:
when a cable passes through a certain cable trench, the vertex a and the vertex b at two ends of the cable trench take the vertex a as a starting point and the vertex b as a termination point according to the laying condition of the cable, namely the vector ab is the spatial direction of the cable laid in the cable trench; let the vertex a coordinate be (x1, y1, z1) and the vertex b coordinate be (x2, y2, z2), since the cable trench is parallel to the coordinate axis, two pairs of the three pairs of data (x1, x2), (y1, y2), (z1, z2) must be equal; namely, it is
S1) when x1 equals x2 and y1 equals y 2: then vector ab is parallel to the Z-axis, if Z1< Z2, then vector ab is in the positive Z-axis direction, otherwise, vector ab is in the negative Z-axis direction;
s2) when x1 equals x2 and z1 equals z 2: then vector ab is parallel to the Y-axis, if Y1< Y2, then vector ab is in the positive Y-axis direction, otherwise, vector ab is in the negative Y-axis direction;
s3) when y1 equals y2 and z1 equals z 2: then vector ab is parallel to the X-axis, if X1< X2 then vector ab is in the positive X-axis direction, otherwise vector ab is in the negative X-axis direction;
when the cable is continuously laid in the next section of cable trench, two vertexes of the cable trench are a vertex b and a vertex c, the vertex b is a starting point and the vertex c is a termination point according to the laying condition of the cable, and namely a vector bc is the spatial direction of the cable laid in the cable trench; let the vertex b coordinate be (x2, y2, z2) and the vertex c coordinate be (x3, y3, z3), since the cable trench is parallel to the coordinate axis, two pairs of the three pairs of data (x2, x3), (y2, y3), (z2, z3) must be equal; namely, it is
S1) when x2 equals x3 and y2 equals y 3: then vector bc is parallel to the Z-axis, if Z2< Z3, then vector bc is in the positive Z-axis direction, otherwise, vector bc is in the negative Z-axis direction;
s2) when x2 equals x3 and z2 equals z 3: then vector bc is parallel to the Y-axis, if Y2< Y3, then vector bc is in the positive Y-axis direction, otherwise, vector bc is in the negative Y-axis direction;
s3) when y2 equals y3 and z2 equals z 3: then vector bc is parallel to the X-axis, if X2< X3, then vector bc is in the positive X-axis direction, otherwise, vector bc is in the negative X-axis direction.
Further, in the step 7), if it is determined from the three-point coordinates of the vertex p1, the vertex p2, and the vertex p3 that the cable is going to be laid in the positive Y-axis direction with respect to the two-dimensional plane, the cable is arranged on the right side of the rack; if the direction of the cable to be laid is the X-axis negative direction according to the three-point coordinates of the vertex p1, the vertex p2 and the vertex p3, arranging the cable in the middle of the support; if the direction in which the cable is to be laid is determined to be the Y-axis negative direction according to the three-point coordinates of the vertex p1, the vertex p2 and the vertex p3, arranging the cable on the left side of the support;
for the three-dimensional plane, if the three-point coordinates of the vertex p1, the vertex p2 and the vertex p3 judge that the cable has the direction to turn to the upper floor, the method comprises the following steps: the cable which is originally placed on the bracket at the uppermost layer at the first floor is laid on the bracket at the lowermost layer to avoid crossing after being laid on the second floor; the cable which is originally placed on the bracket at the lowest layer at the first floor is laid on the bracket at the uppermost layer to avoid crossing after being laid on the second floor; the cable which is originally placed on the middle support in the first floor is laid on the second floor and is placed on the middle support to avoid crossing; similarly, if the three-point coordinates of the vertex p1, the vertex p2 and the vertex p3 determine that the cable has the direction to turn towards the lower floor: the cable which is originally placed on the bracket at the uppermost layer on the second floor is laid on the bracket at the lowermost layer in order to avoid crossing after being laid on the first floor; the cable which is originally placed on the bracket at the lowest layer on the second floor is laid on the bracket at the uppermost layer to avoid crossing after being laid on the first floor; originally, the cable of placing in middle support in second floor lays the back to the first floor, for avoiding alternately, places on the support in middle.
Further, the layer relationships in the cable position processing object in the step 8) are ordered as follows:
the cable includes high-low voltage power cable, forceful electric power control cable, light current control cable, communication cable and optical cable, and high-low voltage power cable, forceful electric power control cable, light current control cable, communication cable and optical cable from top to bottom's layering configuration order is on the support: high and low voltage power cables-strong current control cables-weak current control cables-communication cables and optical cables;
the support comprises a common support and a bridge, wherein the high-low voltage power cable and the control cable are laminated on each unit layer support of the common support by no more than one layer, the high-low voltage power cable is laminated on each unit layer support of the bridge by no more than three layers, and the control cable is laminated on each unit layer support of the bridge by no more than two layers;
the hierarchical formulation order and the stacking rules are cached in the cable position processing object.
The invention has the beneficial effects that: the shortest path of the cable is solved by utilizing a Djkstra algorithm to perform preliminary pre-arrangement on the distribution of the cable, then the capacity, the sequence and the limitation of a support are combined, the minimum turning point and the minimum crossing point are taken as objective functions, the arrangement position judgment is performed by utilizing the next two vertexes of each cable, the position relation of the cable is further planned, the purpose of minimizing the number of the turning points and the number of the crossing points of the cable is finally achieved, and finally the construction requirements and the limitation conditions of cable laying are combined to ensure the minimum turning number and the minimum number of staggered layers of the cable, so that a better laying result is obtained, and the method has important guiding significance for a cable laying construction party.
Detailed Description
The present invention will be described in further detail with reference to specific examples.
The construction requirements and the limiting conditions of cable laying proposed by a certain existing transformer substation are as follows:
the cable includes high-low voltage power cable, forceful electric power control cable, light current control cable, communication cable and optical cable, and high-low voltage power cable, forceful electric power control cable, light current control cable, communication cable and optical cable from top to bottom's layering configuration order is on the support: high and low voltage power cables-strong current control cables-weak current control cables-communication cables and optical cables;
the support comprises a common support and a bridge, wherein the high-low voltage power cable and the control cable are laminated on each unit layer support of the common support by no more than one layer, the high-low voltage power cable is laminated on each unit layer support of the bridge by no more than three layers, and the control cable is laminated on each unit layer support of the bridge by no more than two layers;
and caching the hierarchical configuration sequence and the lamination rule in a cable position processing object, and storing the hierarchical configuration sequence and the lamination rule as a layer relation sequence.
A. Cables are preliminarily arranged, and the shortest path is searched for each cable line;
1) constructing a mathematical model for the cable trench: regarding turning or crossed nodes of the cable trenches as vertexes, regarding the cable trenches as edges, weighting each edge according to the actual length of each cable trench, and regarding an obtained transformer substation planning model as a graph;
wherein: collecting all vertexes in the graph into a vertex set V, and dividing the vertex set V into two groups, wherein the first group is a vertex set S with the shortest path solved, and the second group is a vertex set U with the rest undetermined shortest paths;
2) selecting a cable, initially considering the cable passing through the first vertex of the cable trench as a source vertex v0Setting the source vertex v0Has a distance of 0, and the vertex set S only contains the source vertex v0I.e. S ═ v0H, the vertex set U includes the source-divided vertex v0Other vertices than the one, i.e. U ═ UnN is an integer greater than or equal to 0;
the specific process of weighting each edge according to the actual length of each cable trench is as follows: if the source vertex v0And the vertex unWith an edge, then<un,v0>Representing the weighted value, i.e. the weighted value is the source vertex v0And the vertex unThe distance between them; if the vertex u isnNot the source vertex v0The edge-out adjacent point of (2) then<un,v0>The weight is ∞, i.e. it means that the source vertex v is unknown0Leading to vertex unA path of (a);
3) calculating the v from the source vertex in step 1) using the Djkstra (Dijkstra) algorithm0To the shortest path length between any vertex in the vertex set U, and the vertex U in the vertex set U is processed in the ascending order of the shortest path lengthnAdding into the vertex set S:
31) selecting a distance source vertex v from the vertex set U0Smallest vertex u0Let the vertex u0Added to the vertex set S, the selected distance is the source vertex v0To the vertex u0And the shortest path length of (c) and the vertex u0Removing from the vertex set U;
32) with the vertex u0As an intermediate revision point, for any other vertex U in the set of vertices U1～nNot including vertex u0If from the source vertex v0Through the vertex u0To the vertex u1～nFrom the source vertex v0Not passing through the vertex u0To the vertex u1～nIs small, i.e. the source vertex v0To the vertex u0Distance of (d) plus vertex u0To the vertex u1～nIs less than the source vertex v0To the vertex u1～nThen modify other vertices U in vertex set U1～nThe modified vertex set U, and other vertices U in the modified vertex set U1～nIs the source vertex v0To the vertex u0Plus the source vertex v0And the vertex u1～nThe weight on the edge;
4) repeating the steps 31) and 32), and selecting a current distance source vertex v from the vertex set U according to the step 31)0Smallest vertex u1Let the vertex u1Adding the vertex u to the vertex set S1Removing from the vertex set U; then, the vertex U in the vertex set U is updated again according to the rule in the step 32)2～nA distance value of (d); continuing to repeat the step 31) and the step 32) until all the vertexes in the vertex set U are moved into the vertex set S until all the vertexes are contained in the vertex set S;
wherein: the source vertex v to be selected in step 31)0The vertex with the smallest distance always remains from the source vertex v during the addition to the set of vertices S0The length of the shortest path to each vertex in the vertex set S is not more than v from the source vertex0The shortest path length of the selected vertex is not contained in any other vertex in the vertex set U; the vertex distances in vertex set U in step 32) are from source vertex v0The length of the current shortest path to the vertex in the vertex set U only includes the vertex in the vertex set S as the middle vertex, that is, the distance of any vertex in the vertex set U refers to the length from the source vertex v0To any vertex in the vertex set U, only passing through the shortest path length in the paths of the points in the vertex set S;
B. when the number of the cables is more than or equal to 2, repeating the step 2), the step 3) and the step 4) in the step A until the shortest path of all the cables is obtained;
C. planning the cable arrangement direction;
the model constructed in the step A is difficult to directly calculate a multi-target planning model of a result, so that a hierarchical sequence method is applied to model solution, the basic idea of the hierarchical sequence method is that a sequence is given to targets according to the importance of the targets, the targets are divided into the most important targets and the secondary targets, and the shortest-length line scheme is laid most economically in the cable laying process, so that the shortest total laying route is taken as a first target. Compared with the cable staggered layer, the problem of cable crossing is caused by excessive turning of the cable, the actual capacity of a cable groove is influenced, and more troubles are caused by excessive turning of the cable compared with the cable staggered layer, so that the turning number is the minimum in the solving process as a second target, and the staggered layer number is the minimum as a third target.
Because the mutual position relation of the cables directly relates to the crossing problem of the cables, after the cable path trend is preliminarily designed, all the cables passing through the nodes are taken out aiming at each section planning node, and are preferentially arranged on one side to be turned according to the turning cables, and meanwhile, the sections are designed and visually displayed in a graphic mode according to the rules of the turning radius requirements.
5) Establishing a three-dimensional space coordinate system: in the design of the transformer substation, each cable trench is designed according to a 90-degree corner, so that a three-dimensional space coordinate system is established according to the direction of the cable trench, namely positive and negative directions of all the cable trenches along an X axis, a Y axis and a Z axis are set in the three-dimensional space coordinate system; meanwhile, the laying path of the cable is along the direction of the cable trench, and is also along the positive and negative directions of an X axis, a Y axis and a Z axis;
determining the spatial arrangement direction rule of each cable in each cable trench according to the established three-dimensional space coordinate system of the cable trench:
when a cable passes through a certain cable trench, the vertex a and the vertex b at two ends of the cable trench take the vertex a as a starting point and the vertex b as a termination point according to the laying condition of the cable, namely the vector ab is the spatial direction of the cable laid in the cable trench; let the vertex a coordinate be (x1, y1, z1) and the vertex b coordinate be (x2, y2, z2), since the cable trench is parallel to the coordinate axis, two pairs of the three pairs of data (x1, x2), (y1, y2), (z1, z2) must be equal; namely, it is
S1) when x1 equals x2 and y1 equals y 2: then vector ab is parallel to the Z-axis, if Z1< Z2, then vector ab is in the positive Z-axis direction, otherwise, vector ab is in the negative Z-axis direction;
s2) when x1 equals x2 and z1 equals z 2: then vector ab is parallel to the Y-axis, if Y1< Y2, then vector ab is in the positive Y-axis direction, otherwise, vector ab is in the negative Y-axis direction;
s3) when y1 equals y2 and z1 equals z 2: then vector ab is parallel to the X-axis, if X1< X2 then vector ab is in the positive X-axis direction, otherwise vector ab is in the negative X-axis direction;
when the cable is continuously laid in the next section of cable trench, two vertexes of the cable trench are a vertex b and a vertex c, the vertex b is a starting point and the vertex c is a termination point according to the laying condition of the cable, and namely a vector bc is the spatial direction of the cable laid in the cable trench; let the vertex b coordinate be (x2, y2, z2) and the vertex c coordinate be (x3, y3, z3), since the cable trench is parallel to the coordinate axis, two pairs of the three pairs of data (x2, x3), (y2, y3), (z2, z3) must be equal; namely, it is
S1) when x2 equals x3 and y2 equals y 3: then vector bc is parallel to the Z-axis, if Z2< Z3, then vector bc is in the positive Z-axis direction, otherwise, vector bc is in the negative Z-axis direction;
s2) when x2 equals x3 and z2 equals z 3: then vector bc is parallel to the Y-axis, if Y2< Y3, then vector bc is in the positive Y-axis direction, otherwise, vector bc is in the negative Y-axis direction;
s3) when y2 equals y3 and z2 equals z 3: then vector bc is parallel to the X-axis, if X2< X3, then vector bc is in the positive X-axis direction, otherwise, vector bc is in the negative X-axis direction;
from the observation of the coordinate axes in the three-dimensional spatial coordinate system, the steering of each cable is defined as follows:
determining according to the shortest path of each cable in the step A): turning to the right in the positive direction of the X axis and turning to the positive direction of the Y axis, turning to the left in the positive direction of the X axis and turning to the left in the negative direction of the Y axis, turning to the left in the positive direction of the Y axis, turning to the right in the negative direction of the Y axis in the negative direction of the X axis, turning to the upstairs in the positive direction of the Z axis in the horizontal direction and turning to the downstairs in the negative direction of the Z axis in the horizontal direction, wherein the horizontal direction comprises the positive and negative directions of;
6) comparing the lengths of all the cables to be laid, and planning the trend of the cables in the cable trench according to the lengths of the cables from long to short in sequence according to the mode of preliminary cable pre-arrangement in the step A):
7) determining the direction of laying of each cable
71) When a certain cable is laid to a certain vertex p1, detecting and extracting the coordinates of the vertex p1 and the position coordinates to be laid to the next two vertices p2 and p3, and caching the cable information and the steering information as cable position processing objects;
72) determining the spatial arrangement direction rule of each cable in each cable trench and the turning definition of each cable according to the step 5), determining the direction in which the cable is to be laid according to the three-point coordinates of the vertex p1, the vertex p2 and the vertex p3 in the step 71), arranging the cable on the side, to be turned, of the bracket according to the turning information, and recording the cable in a cable position processing object;
for a two-dimensional plane, if the direction in which the cable is to be laid is determined to be the positive Y-axis direction according to the three-point coordinates of the vertex p1, the vertex p2 and the vertex p3, the cable is arranged on the right side of the support; if the direction of the cable to be laid is the X-axis negative direction according to the three-point coordinates of the vertex p1, the vertex p2 and the vertex p3, arranging the cable in the middle of the support; if the direction in which the cable is to be laid is determined to be the Y-axis negative direction according to the three-point coordinates of the vertex p1, the vertex p2 and the vertex p3, arranging the cable on the left side of the support;
for a three-dimensional plane, the three-point coordinates of the vertices p1, p2, and p3 still determine the direction in which the cable is to be laid. According to the type of the cable and the vertical turning condition of the cable, whether the cable is on the upper layer or the lower layer of the cable support is judged and recorded in a cable position processing object. If the three-point coordinates of the vertex p1, the vertex p2 and the vertex p3 judge that the cable has the direction to turn to the upper floor: the cable which is originally placed on the bracket at the uppermost layer at the first floor is laid on the bracket at the lowermost layer to avoid crossing after being laid on the second floor; the cable which is originally placed on the bracket at the lowest layer at the first floor is laid on the bracket at the uppermost layer to avoid crossing after being laid on the second floor; the cable which is originally placed on the middle support in the first floor is laid on the second floor and is placed on the middle support to avoid crossing; similarly, if the three-point coordinates of the vertex p1, the vertex p2 and the vertex p3 determine that the cable has the direction to turn towards the lower floor: the cable which is originally placed on the bracket at the uppermost layer on the second floor is laid on the bracket at the lowermost layer in order to avoid crossing after being laid on the first floor; the cable which is originally placed on the bracket at the lowest layer on the second floor is laid on the bracket at the uppermost layer to avoid crossing after being laid on the first floor; the cable which is originally placed on the middle support on the second floor is laid on the first floor and is placed on the middle support to avoid crossing;
d, finishing the laying planning of all cables;
8) primarily arranging cables according to the cable position information recorded in the cable position processing object in the step 7): firstly, sorting according to the layer relation in the cable position processing object, and then numbering the cables according to the left-right relation sequence; then finely arranging the cables, and arranging all the cables on the bracket in a layered manner; and finally, storing all cable laying planning results according to the output requirements.
E, prompting a cross point;
after step D is completed, the inevitable intersections are shown on the overall layout chart and are suggested in different colors and the intersecting cables are listed. For example, when a certain cable is clicked, the cable is highlighted, and related information of the cable is displayed for an operator to view and modify;
f, generating a construction plan;
after the step E is completed, the construction process may be ambiguous, which may cause errors in construction. The system can be planned according to the principle that laying firstly does not influence laying secondly, for example, laying the bottom layer firstly and then laying the upper layer; or according to the section plan, laying the inner side first and laying the outer side later; and finally, outputting in an Excel file mode. The types of data that can be output include:
(1) cable planning graphical output
The whole laying situation can be displayed in a plan view and a three-dimensional view mode, the cable section is displayed in a cross section mode and a 45-degree view angle mode, and all the figures can be printed. When a certain cable is clicked, the cable is highlighted, and related information of the cable is displayed.
(2) Statistics report output
And a multi-clock printing report can be output, such as cable length statistics, section analysis results and the like.
The cable length statistics can accurately estimate the construction consumption of the whole project, and is beneficial to purchasing of materials; the cross section analysis result can count the residual space amount of each bridge node.
(3) Mark printing
The information of the cable paper, the label paper and the number tube can be automatically generated according to the information of each cable; the generated mark can be directly printed, and can also be edited, modified in information or changed in size.
Claims (4)
1. A three-dimensional space laying path optimization method for a plurality of cables is characterized by comprising the following steps: the optimization method comprises the following steps:
A. cables are preliminarily arranged, and the shortest path is searched for each cable line;
1) constructing a mathematical model for the cable trench: regarding turning or crossed nodes of the cable trenches as vertexes, regarding the cable trenches as edges, weighting each edge according to the actual length of each cable trench, and regarding an obtained transformer substation planning model as a graph;
wherein: collecting all vertexes in the graph into a vertex set V, and dividing the vertex set V into two groups, wherein the first group is a vertex set S with the shortest path solved, and the second group is a vertex set U with the rest undetermined shortest paths;
2) selecting a cable, initially considering the cable passing through the first vertex of the cable trench as a source vertex v0Setting the source vertex v0Has a distance of 0, and the vertex set S only contains the source vertex v0I.e. S ═ v0H, the vertex set U includes the source-divided vertex v0Other vertices than the one, i.e. U ═ UnN is an integer greater than or equal to 0;
the specific process of weighting each edge according to the actual length of each cable trench is as follows: if the source vertex v0And the vertex unWith an edge, then<un,v0>Representing the weighted value, i.e. the weighted value is the source vertex v0And the vertex unThe distance between them; if the vertex u isnNot the source vertex v0The edge-out adjacent point of (2) then<un,v0>The weight is ∞, i.e. it means that the source vertex v is unknown0Leading to vertex unA path of (a);
3) calculating the v from the source vertex in step 1) using the Djkstra algorithm0To the shortest path length between any vertex in the vertex set U, and the vertex U in the vertex set U is processed in the ascending order of the shortest path lengthnAdding into the vertex set S:
31) selecting a distance source vertex v from the vertex set U0Smallest vertex u0Let the vertex u0Adding the vertex set S and the vertex u0Removing from the vertex set U;
32) with the vertex u0As an intermediate revision point, for any other vertex U in the set of vertices U1～nNot including vertex u0If from the source vertex v0Through the vertex u0To the vertex u1～nFrom the source vertex v0Not passing through the vertex u0To the vertex u1～nIs small, i.e. the source vertex v0To the vertex u0Distance of (d) plus vertex u0To the vertex u1～nIs less than the source vertex v0To the vertex u1～nThen modify other vertices U in vertex set U1～nThe modified vertex set U, and other vertices U in the modified vertex set U1～nIs the source vertex v0To the vertex u0Plus the source vertex v0And the vertex u1～nThe weight on the edge;
4) repeating the steps 31) and 32), and selecting a current distance source vertex v from the vertex set U according to the step 31)0Smallest vertex u1Let the vertex u1Adding the vertex u to the vertex set S1Removing from the vertex set U; then, the vertex U in the vertex set U is updated again according to the rule in the step 32)2～nA distance value of (d); continuing to repeat the step 31) and the step 32) until all the vertexes in the vertex set U are moved into the vertex set S until all the vertexes are contained in the vertex set S;
the source vertex v to be selected in step 31)0The vertex with the smallest distance always remains from the source vertex v during the addition to the set of vertices S0The length of the shortest path to each vertex in the vertex set S is not more than v from the source vertex0The shortest path length of the selected vertex is not contained in any other vertex in the vertex set U; the vertex distances in vertex set U in step 32) are from source vertex v0The length of the current shortest path to the vertex in the vertex set U only includes the vertex in the vertex set S as the middle vertex, that is, the distance of any vertex in the vertex set U refers to the length from the source vertex v0To any vertex in the vertex set U, only passing through the shortest path length in the paths of the points in the vertex set S;
B. planning the cable arrangement direction;
5) establishing a three-dimensional space coordinate system, and setting the positive and negative directions of all cable trenches along an X axis, a Y axis and a Z axis;
and determining the spatial arrangement direction rule of each cable in each cable trench according to the established three-dimensional space coordinate system of the cable trench as follows:
when a cable passes through a certain cable trench, the vertex a and the vertex b at two ends of the cable trench take the vertex a as a starting point and the vertex b as a termination point according to the laying condition of the cable, namely the vector ab is the spatial direction of the cable laid in the cable trench; let the vertex a coordinate be (x1, y1, z1) and the vertex b coordinate be (x2, y2, z2), since the cable trench is parallel to the coordinate axis, two pairs of the three pairs of data (x1, x2), (y1, y2), (z1, z2) must be equal; namely, it is
S1) when x1 equals x2 and y1 equals y 2: then vector ab is parallel to the Z-axis, if Z1< Z2, then vector ab is in the positive Z-axis direction, otherwise, vector ab is in the negative Z-axis direction;
s2) when x1 equals x2 and z1 equals z 2: then vector ab is parallel to the Y-axis, if Y1< Y2, then vector ab is in the positive Y-axis direction, otherwise, vector ab is in the negative Y-axis direction;
s3) when y1 equals y2 and z1 equals z 2: then vector ab is parallel to the X-axis, if X1< X2 then vector ab is in the positive X-axis direction, otherwise vector ab is in the negative X-axis direction;
when the cable is continuously laid in the next section of cable trench, two vertexes of the cable trench are a vertex b and a vertex c, the vertex b is a starting point and the vertex c is a termination point according to the laying condition of the cable, and namely a vector bc is the spatial direction of the cable laid in the cable trench; let the vertex b coordinate be (x2, y2, z2) and the vertex c coordinate be (x3, y3, z3), since the cable trench is parallel to the coordinate axis, two pairs of the three pairs of data (x2, x3), (y2, y3), (z2, z3) must be equal; namely, it is
S1) when x2 equals x3 and y2 equals y 3: then vector bc is parallel to the Z-axis, if Z2< Z3, then vector bc is in the positive Z-axis direction, otherwise, vector bc is in the negative Z-axis direction;
s2) when x2 equals x3 and z2 equals z 3: then vector bc is parallel to the Y-axis, if Y2< Y3, then vector bc is in the positive Y-axis direction, otherwise, vector bc is in the negative Y-axis direction;
s3) when y2 equals y3 and z2 equals z 3: then vector bc is parallel to the X-axis, if X2< X3, then vector bc is in the positive X-axis direction, otherwise, vector bc is in the negative X-axis direction;
from the observation of the coordinate axes in the three-dimensional spatial coordinate system, the steering of each cable is defined as follows:
determining according to the shortest path of each cable in the step A): turning to the right in the positive direction of the X axis and turning to the positive direction of the Y axis, turning to the left in the positive direction of the X axis and turning to the left in the negative direction of the Y axis, turning to the left in the positive direction of the Y axis, turning to the right in the negative direction of the Y axis in the negative direction of the X axis, turning to the upstairs in the positive direction of the Z axis in the horizontal direction and turning to the downstairs in the negative direction of the Z axis in the horizontal direction, wherein the horizontal direction comprises the positive and negative directions of;
6) comparing the lengths of all the cables to be laid, and planning the trend of the cables in the cable trench according to the lengths of the cables from long to short in sequence according to the mode of preliminary cable pre-arrangement in the step A):
7) determining the direction of laying of each cable
71) When a certain cable is laid to a certain vertex p1, detecting and extracting the coordinates of the vertex p1 and the position coordinates to be laid to the next two vertices p2 and p3, and caching the cable information and the steering information as cable position processing objects;
72) determining the spatial arrangement direction rule of each cable in each cable trench and the turning definition of each cable according to the step 5), determining the direction in which the cable is to be laid according to the three-point coordinates of the vertex p1, the vertex p2 and the vertex p3 in the step 71), arranging the cable on the side, to be turned, of the bracket according to the turning information, and recording the cable in a cable position processing object;
for a two-dimensional plane, if the direction in which the cable is to be laid is determined to be the positive Y-axis direction according to the three-point coordinates of the vertex p1, the vertex p2 and the vertex p3, the cable is arranged on the right side of the support; if the direction of the cable to be laid is the X-axis negative direction according to the three-point coordinates of the vertex p1, the vertex p2 and the vertex p3, arranging the cable in the middle of the support; if the direction in which the cable is to be laid is determined to be the Y-axis negative direction according to the three-point coordinates of the vertex p1, the vertex p2 and the vertex p3, arranging the cable on the left side of the support;
for the three-dimensional plane, if the three-point coordinates of the vertex p1, the vertex p2 and the vertex p3 judge that the cable has the direction to turn to the upper floor, the method comprises the following steps: the cable which is originally placed on the bracket at the uppermost layer at the first floor is laid on the bracket at the lowermost layer to avoid crossing after being laid on the second floor; the cable which is originally placed on the bracket at the lowest layer at the first floor is laid on the bracket at the uppermost layer to avoid crossing after being laid on the second floor; the cable which is originally placed on the middle support in the first floor is laid on the second floor and is placed on the middle support to avoid crossing; similarly, if the three-point coordinates of the vertex p1, the vertex p2 and the vertex p3 determine that the cable has the direction to turn towards the lower floor: the cable which is originally placed on the bracket at the uppermost layer on the second floor is laid on the bracket at the lowermost layer in order to avoid crossing after being laid on the first floor; the cable which is originally placed on the bracket at the lowest layer on the second floor is laid on the bracket at the uppermost layer to avoid crossing after being laid on the first floor; the cable which is originally placed on the middle support on the second floor is laid on the first floor and is placed on the middle support to avoid crossing;
C. finishing all cable laying plans;
8) primarily arranging cables according to the cable position information recorded in the cable position processing object in the step 7): firstly, sorting according to the layer relation in the cable position processing object, and then numbering the cables according to the left-right relation sequence; then finely arranging the cables, and arranging all the cables on the bracket in a layered manner; and finally, storing all cable laying planning results according to the output requirements.
2. The method for optimizing the three-dimensional laying path of a plurality of cables according to claim 1, wherein: and when the number of the cables is more than or equal to 2, repeating the step 2), the step 3) and the step 4) in the step A until the shortest path of all the cables is obtained.
3. The method for optimizing the three-dimensional laying path of a plurality of cables according to claim 1, wherein: and C, after the step C is completed, indicating the inevitable intersection points on the overall planning chart, prompting the inevitable intersection points in different colors, and listing the intersected cables.
4. A method for optimizing the three-dimensional spatial laying path of a plurality of cables according to claim 1, 2 or 3, characterized in that: the layer relationships in the cable position processing object in the step 8) are ordered as follows:
the cable includes high-low voltage power cable, forceful electric power control cable, light current control cable, communication cable and optical cable, and high-low voltage power cable, forceful electric power control cable, light current control cable, communication cable and optical cable from top to bottom's layering configuration order is on the support: high and low voltage power cables-strong current control cables-weak current control cables-communication cables and optical cables;
the support comprises a common support and a bridge, wherein the high-low voltage power cable and the control cable are laminated on each unit layer support of the common support by no more than one layer, the high-low voltage power cable is laminated on each unit layer support of the bridge by no more than three layers, and the control cable is laminated on each unit layer support of the bridge by no more than two layers;
the hierarchical formulation order and the stacking rules are cached in the cable position processing object.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710064123.5A CN106934487B (en) | 2017-02-04 | 2017-02-04 | Three-dimensional space laying path optimization method for multiple cables |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710064123.5A CN106934487B (en) | 2017-02-04 | 2017-02-04 | Three-dimensional space laying path optimization method for multiple cables |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106934487A CN106934487A (en) | 2017-07-07 |
| CN106934487B true CN106934487B (en) | 2020-09-11 |
Family
ID=59422961
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710064123.5A Active CN106934487B (en) | 2017-02-04 | 2017-02-04 | Three-dimensional space laying path optimization method for multiple cables |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106934487B (en) |
Families Citing this family (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108320058A (en) * | 2018-02-22 | 2018-07-24 | 中海石油(中国)有限公司 | A kind of production sequence optimization method that rig utilization rate can be improved |
| CN108694506B (en) * | 2018-05-14 | 2021-06-18 | 广东电网有限责任公司广州供电局 | Method and device for determining construction demand of power distribution network cable tunnel |
| CN109146120A (en) * | 2018-06-25 | 2019-01-04 | 国网经济技术研究院有限公司 | A kind of threedimensional model identification method of project of transmitting and converting electricity construction task progress status |
| CN110442996B (en) * | 2019-08-13 | 2020-07-14 | 四川电力设计咨询有限责任公司 | Intelligent entity cable laying method based on PDMS platform |
| CN112906168B (en) * | 2019-11-19 | 2023-09-19 | 北京博超时代软件有限公司 | Cable arrangement calculation method, device, equipment and storage medium |
| CN112748733B (en) * | 2020-12-16 | 2024-05-07 | 广东电网有限责任公司 | Cable barrow path planning method, device, equipment and storage medium |
| CN113010984B (en) * | 2021-03-04 | 2023-08-08 | 上海核工程研究设计院股份有限公司 | Space-optimized cable three-dimensional turning method |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103427371A (en) * | 2013-08-16 | 2013-12-04 | 中冶南方工程技术有限公司 | Intelligent cable path optimizing method |
| CN104579747A (en) * | 2014-12-10 | 2015-04-29 | 国网电力科学研究院武汉南瑞有限责任公司 | Rapid transmission method of model data in distributed simulation of power equipment |
| EP2876587A1 (en) * | 2013-10-24 | 2015-05-27 | Palantir Technologies, Inc. | Systems and methods for distance and congestion-aware resource deployment |
| CN105321002A (en) * | 2015-11-28 | 2016-02-10 | 国网河南省电力公司郑州供电公司 | Cable line path positioning analysis method |
| CN105631551A (en) * | 2016-01-04 | 2016-06-01 | 浪潮软件集团有限公司 | Optimal route recommendation method and device |
| CN106022531A (en) * | 2016-05-27 | 2016-10-12 | 西安电子科技大学 | Searching method of shortest path passing by necessary peak points |
-
2017
- 2017-02-04 CN CN201710064123.5A patent/CN106934487B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103427371A (en) * | 2013-08-16 | 2013-12-04 | 中冶南方工程技术有限公司 | Intelligent cable path optimizing method |
| EP2876587A1 (en) * | 2013-10-24 | 2015-05-27 | Palantir Technologies, Inc. | Systems and methods for distance and congestion-aware resource deployment |
| CN104579747A (en) * | 2014-12-10 | 2015-04-29 | 国网电力科学研究院武汉南瑞有限责任公司 | Rapid transmission method of model data in distributed simulation of power equipment |
| CN105321002A (en) * | 2015-11-28 | 2016-02-10 | 国网河南省电力公司郑州供电公司 | Cable line path positioning analysis method |
| CN105631551A (en) * | 2016-01-04 | 2016-06-01 | 浪潮软件集团有限公司 | Optimal route recommendation method and device |
| CN106022531A (en) * | 2016-05-27 | 2016-10-12 | 西安电子科技大学 | Searching method of shortest path passing by necessary peak points |
Non-Patent Citations (2)
| Title |
|---|
| Dijkstra算法在电力电缆敷设优化研究中的应用;朱翰超 等;《电气应用》;20141231;第33卷(第24期);第115-118页 * |
| 基于遗传算法的船舶电缆布置优化设计的研究;张鹏;《中国硕士学位论文全文数据库-工程科技II辑》;20150731;第15-30页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106934487A (en) | 2017-07-07 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106934487B (en) | Three-dimensional space laying path optimization method for multiple cables | |
| CN110442996B (en) | Intelligent entity cable laying method based on PDMS platform | |
| CN104850011B (en) | A kind of TSP avoidances optimum path planning method in obstacle environment | |
| CN107545085B (en) | Automatic generation method for process level network connection diagram of intelligent substation | |
| CN103017757B (en) | Engineering machinery entering path planning method and path planning apparatus | |
| CN102446236B (en) | Automatically optimized piping arrangement method based on improved genetic algorithm | |
| CN102254056B (en) | Method for designing cable path of nuclear power station | |
| CN105320811A (en) | Method for establishing topological connected model of urban underground electricity pipe network | |
| CN104462685B (en) | Transmission Line Design method based on grid GIS and Floyd algorithms | |
| CN106156888A (en) | A kind of polling path method and device for planning of crusing robot | |
| CN102156776A (en) | Method for establishing cable bridge network by using relational database | |
| Ando et al. | An automatic piping algorithm including elbows and bends | |
| CN108960504A (en) | A kind of visualization LK algorithm determines method | |
| CN107389079A (en) | High-precision paths planning method and system | |
| CN102222132B (en) | Drawing data conformity checking method based on diagram topology structure | |
| CN114756034B (en) | Robot real-time obstacle avoidance path planning method and device | |
| CN103400428A (en) | Multipoint combination polling method of three-dimensional transformer substation polling system | |
| CN102495930A (en) | Automatic generation method of cable bridge | |
| CN106202662A (en) | A kind of distribution network structure figure draws mapping method automatically | |
| CN109460564B (en) | Power grid tidal current graph wiring method | |
| CN110502803A (en) | Wiring method and device based on BIM technology | |
| CN112332306A (en) | Automatic cable laying method and storage medium | |
| CN110046405A (en) | A kind of electric power line pole tower three-dimensional collaborative planning design method and system | |
| CN113343426A (en) | Urban distribution network line gauge method and system considering real demand guidance | |
| Zhang et al. | Free-floating bike-sharing systems: New repositioning rules, optimization models and solution algorithms |
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 |