Method and device for determining shortest routing path in power transmission network, equipment and storage medium

Abstract

The invention discloses a method, a device and equipment for determining a shortest route path in a power transmission network, and a storage medium. The method comprises the following steps: firstly, obtaining the current of each power transmission line in the power transmission network to be optimized; then constructing a Dijkstra algorithm by taking each transformer substation in the to-be-optimized power transmission network as a node, a main transformer substation as a starting node and each power transmission line as an edge, and taking the current as a path corresponding to the edge; and finally, solving the Dijkstra algorithm to obtain the shortest routing path from each transformer substation in the power transmission network to be optimized to the main transformer substation. According to the method, the current of each power transmission line serves as the path of each edge in the algorithm, each transformer substation serves as a node, the main transformer substation serves as a starting node, each power transmission line serves as the edge, then the algorithm is solved, the shortest routing path in the power transmission network to be optimized is obtained, and the communication transmission delay and the packet loss rate are reduced.

Description

Technical Field

[0001] The present invention relates to the technical field of routing path determination, and in particular to a method for determining the shortest routing path in a power transmission network. Background Art

[0002] In recent years, there has been an increasing amount of research on wireless broadband self-organizing network technology in China. There are two main technical forms for the implementation of the industry. One is the design based on the CSMA underlying layer of WIFI, and the other is the design based on a centralized method of 4G / 5G base stations.

[0003] However, in the monitoring scenario of ultra-long-distance high-voltage transmission lines, the end-to-end routing transmission performance in multi-hop ad hoc networks will deteriorate sharply as the number of transmission paths increases, causing communication delays and increasing packet loss rates. Summary of the invention

[0004] The present invention provides a method, device, equipment and storage medium for determining the shortest routing path in a power transmission network, which can obtain the shortest routing path and reduce communication transmission delay and packet loss rate.

[0005] An embodiment of the present invention provides a method for determining the shortest routing path in a transmission network, comprising:

[0006] Obtaining the current of each transmission line in the transmission network to be optimized;

[0007] Taking each substation in the above-mentioned transmission network to be optimized as a node, the main substation as a starting node, and each of the above-mentioned transmission lines as an edge, construct a Dijkstra algorithm, and use the above-mentioned current as a path corresponding to the above-mentioned edge;

[0008] The Dijkstra algorithm is solved to obtain the shortest routing path from each substation in the transmission network to be optimized to the main substation.

[0009] Furthermore, the above-mentioned Dijkstra algorithm is solved to obtain the shortest routing path from each substation in the above-mentioned transmission network to be optimized to the above-mentioned main substation, including:

[0010] Initialize the shortest path substation set; wherein the shortest path substation set is used to store the substations for which the shortest path has been found;

[0011] Initialize the shortest path value of the main substation to 0, and the shortest path value from the main substation to other substations to infinity;

[0012] Repeat the substation sorting operation until all substations are added to the shortest path substation set, and backtrack according to the first current shortest path value, the predecessor substation and the second current shortest path value corresponding to each substation to determine the shortest path from the main substation to other substations;

[0013] The shortest path from the main substation to other substations is used as the shortest routing path;

[0014] The above substation sequencing operation includes:

[0015] Obtain the substation at the current moment; wherein the substation at the initial moment is the above-mentioned main substation;

[0016] According to the above current, a first current path value from the main substation to the substation at the current moment is calculated;

[0017] Compare the first current path value with the current shortest path value; wherein the current shortest path value is: the shortest path value from the main substation to the substation at the current moment;

[0018] If the first current path value is less than the first current shortest path value, the first current path value is used as the updated first current shortest path value, and the substation at the current moment is saved in the shortest path substation set; if the first current path value is not less than the first current shortest path value, the first current shortest path value is not updated;

[0019] Obtain all adjacent substations adjacent to the substation at the current moment;

[0020] According to the above current, all second current path values ​​from the main substation through the current substation to all adjacent substations are calculated;

[0021] The second current path value corresponding to each adjacent substation is compared with the second current shortest path value respectively; wherein the second current shortest path value is: the shortest path value from the main substation to all adjacent substations;

[0022] Among all comparison results, the second current path value of the adjacent substation whose second current path value is less than the second current shortest path value is used as the corresponding updated second current shortest path value, and the substation at the current moment is used as the predecessor substation of the adjacent substation for updating the second current shortest path value;

[0023] It is determined whether the current shortest path substation set includes all substations. If not, a substation is selected from the substations not included as the substation at the next moment.

[0024] Furthermore, after obtaining the shortest routing path, the method further includes:

[0025] Obtaining the transmission resistance, transmission length and maximum transmission capacity of each transmission line on the shortest routing path;

[0026] According to the above transmission resistance, transmission length and maximum transmission capacity, the cost of each transmission line is calculated;

[0027] Calculate the sum of the costs of each transmission line to obtain the total cost corresponding to the above shortest routing path;

[0028] The above cost is calculated according to the following formula:

[0029] F=α·R+β·L+γ·P

[0030] In the formula, F represents the cost, α represents the first weight coefficient, R represents the transmission resistance, β represents the second weight coefficient, L represents the transmission length, γ represents the third weight coefficient, and P represents the maximum transmission capacity.

[0031] Furthermore, after obtaining the shortest routing path, the method further includes:

[0032] Obtain the average delay, average bandwidth, average packet loss rate and stability score of the shortest routing path;

[0033] The comprehensive score of the shortest routing path is calculated based on the average delay, average bandwidth, average packet loss rate and stability score of the shortest routing path.

[0034] The calculation of the above comprehensive score is as follows:

[0035] E=w1*(1 / D)+w2*B+w3*(1-P)+w4*S

[0036] Wherein, E represents the above comprehensive score, D represents the average delay, w1 represents the weight coefficient corresponding to the average delay, B represents the average bandwidth, w2 represents the weight coefficient corresponding to the average bandwidth, P represents the average packet loss rate, w3 represents the weight coefficient corresponding to the average packet loss rate, S represents the stability score, and w4 represents the weight coefficient corresponding to the stability score.

[0037] Based on the above method embodiment, the present invention provides a corresponding device embodiment;

[0038] The present invention provides a device for determining the shortest routing path in a power transmission network, comprising:

[0039] Data acquisition module, algorithm construction module and shortest routing path determination module;

[0040] The above-mentioned data acquisition module is used to obtain the current of each transmission line in the transmission network to be optimized;

[0041] The algorithm construction module is used to construct a Dijkstra algorithm with each substation in the transmission network to be optimized as a node, the main substation as a starting node, and each of the transmission lines as an edge, and use the current as a path corresponding to the edge;

[0042] The shortest routing path determination module is used to solve the Dijkstra algorithm to obtain the shortest routing path from each substation in the transmission network to be optimized to the main substation.

[0043] Furthermore, the shortest routing path determination module includes:

[0044] A collection initialization unit, a shortest path initialization unit, a sorting operation execution unit, and a shortest routing path calculation unit;

[0045] The above-mentioned set initialization unit is used to initialize the shortest path substation set; wherein the above-mentioned shortest path substation set is used to store the substations for which the shortest path has been found;

[0046] The shortest path initialization unit is used to initialize the shortest path value of the main substation to 0, and the shortest path value from the main substation to other substations to infinity;

[0047] The above-mentioned sorting operation execution unit is used to repeatedly perform the substation sorting operation until all substations are added to the shortest path substation set, and backtrack according to the first current shortest path value, the predecessor substation and the second current shortest path value corresponding to each substation to determine the shortest path from the main substation to other substations;

[0048] The above-mentioned shortest routing path calculation unit is used to use the shortest path from the above-mentioned main substation to each other substation as the above-mentioned shortest routing path; wherein the above-mentioned substation sorting operation includes: obtaining the substation at the current moment; wherein the substation at the initial moment is the above-mentioned main substation; according to the above-mentioned current, calculating the first current path value from the main substation to the substation at the current moment; comparing the first current path value with the current shortest path value; wherein the above-mentioned current shortest path value is: the shortest path value from the main substation to the substation at the current moment; if the first current path value is less than the above-mentioned first current shortest path value, then the above-mentioned first current path value is used as the updated first current shortest path value, and the substation at the current moment is saved in the above-mentioned shortest path substation set; if the first current path value is not less than the above-mentioned first current shortest path value, then the first current shortest path value is not updated. New; obtain all adjacent substations adjacent to the substation at the current moment; according to the above current, calculate all the second current path values ​​from the main substation through the current substation to all adjacent substations; respectively compare the second current path value corresponding to each adjacent substation with the second current shortest path value; wherein the above second current shortest path value is: the current shortest path value from the main substation to all adjacent substations; among all the comparison results, the second current path value of the adjacent substation whose second current path value is less than the above second current shortest path value is used as the corresponding updated second current shortest path value, and the substation at the current moment is used as the predecessor substation of the adjacent substation for updating the second current shortest path value; determine whether the current shortest path substation set contains all substations, if not, select a substation from the substations that are not included as the substation at the next moment.

[0049] Furthermore, after the above-mentioned shortest routing path determination module, it also includes: a cost calculation module;

[0050] The cost calculation module is used to obtain the transmission resistance, transmission length and maximum transmission capacity of each transmission line on the shortest routing path; calculate the cost of each transmission line according to the transmission resistance, transmission length and maximum transmission capacity; calculate the sum of the costs of each transmission line to obtain the total cost corresponding to the shortest routing path; wherein the cost is calculated according to the following formula:

[0051] F=α·R+β·L+γ·P

[0052] In the formula, F represents the cost, α represents the first weight coefficient, R represents the transmission resistance, β represents the second weight coefficient, L represents the transmission length, γ represents the third weight coefficient, and P represents the maximum transmission capacity.

[0053] Furthermore, after the shortest routing path determination module, it also includes: a comprehensive evaluation calculation module;

[0054] The above-mentioned comprehensive evaluation calculation module is used to obtain the average delay, average bandwidth, average packet loss rate and stability score of the above-mentioned shortest routing path; according to the average delay, average bandwidth, average packet loss rate and stability score of the above-mentioned shortest routing path, the comprehensive score of the above-mentioned shortest routing path is calculated; wherein, the calculation of the above-mentioned comprehensive score is shown in the following formula:

[0055] E=w1*(1 / D)+w2*B+w3*(1-P)+w4*S

[0056] Wherein, E represents the above comprehensive score, D represents the average delay, w1 represents the weight coefficient corresponding to the average delay, B represents the average bandwidth, w2 represents the weight coefficient corresponding to the average bandwidth, P represents the average packet loss rate, w3 represents the weight coefficient corresponding to the average packet loss rate, S represents the stability score, and w4 represents the weight coefficient corresponding to the stability score.

[0057] Based on the above method embodiment, the present invention provides a terminal device embodiment;

[0058] The present invention provides a terminal device, comprising a processor, a memory, and a computer program stored in the memory and configured to be executed by the processor. When the processor executes the computer program, it implements a method for determining the shortest routing path in a transmission network as described in any embodiment of the present invention.

[0059] Based on the above method embodiment, the present invention provides a storage medium embodiment;

[0060] The present invention provides a storage medium, comprising a processor, a memory, and a computer program stored in the memory and configured to be executed by the processor. When the processor executes the computer program, a method for determining the shortest routing path in a transmission network described in any embodiment of the present invention is implemented.

[0061] The embodiments of the present invention have the following beneficial effects:

[0062] The present invention provides a method for determining the shortest routing path in a transmission network, the method comprising: first obtaining the current of each transmission line in the transmission network to be optimized; constructing a Dijkstra algorithm with each substation in the transmission network to be optimized as a node, a main substation as a starting node, and each transmission line as an edge, and using the current as a path corresponding to the edge; solving the Dijkstra algorithm to obtain the shortest routing path from each substation in the transmission network to be optimized to the main substation. Therefore, the present invention uses each substation and each transmission line in the transmission network as a node and edge of the Dijkstra algorithm, and uses the current of each transmission line as a path of each edge in the Dijkstra algorithm, and then solves the Dijkstra algorithm to obtain the shortest routing path in the transmission network to be optimized, thereby reducing communication transmission delay and packet loss rate. BRIEF DESCRIPTION OF THE DRAWINGS

[0063] Figure 1 It is a flow chart of a method for determining the shortest routing path in a transmission network provided by an embodiment of the present invention.

[0064] Figure 2 It is a schematic diagram of the structure of a device for determining the shortest routing path in a transmission network provided by an embodiment of the present invention. DETAILED DESCRIPTION

[0065] The technical solution of the present invention will be described clearly and completely below in conjunction with the accompanying drawings of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.

[0066] like Figure 1 As shown, a method for determining the shortest routing path in a transmission network provided by an embodiment of the present invention includes:

[0067] Step S101: obtaining the current of each transmission line in the transmission network to be optimized;

[0068] Specifically, the current of each transmission line in the transmission network can be obtained through relevant detection devices.

[0069] Step S102: constructing a Dijkstra algorithm with each substation in the above-mentioned transmission network to be optimized as a node, the main substation as a starting node, and each of the above-mentioned transmission lines as an edge, and using the above-mentioned current as a path corresponding to the above-mentioned edge;

[0070] Specifically, according to the overall substation layout of the transmission network, a graph is created to represent the transmission network, in which the nodes represent transmission towers or substations, the edges represent transmission lines, and a weight is assigned to each edge, representing the current passing through the transmission line. In the scenario where the Dijkstra algorithm is used to calculate the shortest routing path, the current is the path value between the substations, and then the Dijkstra algorithm is constructed.

[0071] Step S103: Solve the Dijkstra algorithm to obtain the shortest routing path from each substation in the transmission network to be optimized to the main substation.

[0072] In a preferred embodiment, the above-mentioned Dijkstra algorithm is solved to obtain the shortest routing path from each substation in the above-mentioned transmission network to be optimized to the above-mentioned main substation, including:

[0073] Initialize the shortest path substation set; wherein the shortest path substation set is used to store the substations for which the shortest path has been found;

[0074] Initialize the shortest path value of the main substation to 0, and the shortest path value from the main substation to other substations to infinity;

[0075] Repeat the substation sorting operation until all substations are added to the shortest path substation set, and backtrack according to the first current shortest path value, the predecessor substation and the second current shortest path value corresponding to each substation to determine the shortest path from the main substation to other substations;

[0076] The shortest path from the main substation to other substations is used as the shortest routing path;

[0077] The above substation sequencing operation includes:

[0078] Obtain the substation at the current moment; wherein the substation at the initial moment is the above-mentioned main substation;

[0079] According to the above current, a first current path value from the main substation to the substation at the current moment is calculated;

[0080] Compare the first current path value with the current shortest path value; wherein the current shortest path value is: the shortest path value from the main substation to the substation at the current moment;

[0081] If the first current path value is less than the first current shortest path value, the first current path value is used as the updated first current shortest path value, and the substation at the current moment is saved in the shortest path substation set; if the first current path value is not less than the first current shortest path value, the first current shortest path value is not updated;

[0082] Obtain all adjacent substations adjacent to the substation at the current moment;

[0083] According to the above current, all second current path values ​​from the main substation through the current substation to all adjacent substations are calculated;

[0084] The second current path value corresponding to each adjacent substation is compared with the second current shortest path value respectively; wherein the second current shortest path value is: the shortest path value from the main substation to all adjacent substations;

[0085] Among all comparison results, the second current path value of the adjacent substation whose second current path value is less than the second current shortest path value is used as the corresponding updated second current shortest path value, and the substation at the current moment is used as the predecessor substation of the adjacent substation for updating the second current shortest path value;

[0086] It is determined whether the current shortest path substation set includes all substations. If not, a substation is selected from the substations not included as the substation at the next moment.

[0087] Preferably, the starting node may be a main substation or a power station.

[0088] Specifically, when calculating the path value between substations based on the current, it is only necessary to add the current values ​​of the transmission lines between the substations to obtain the path value.

[0089] Specifically, the solution process of the entire Dijkstra algorithm above aims to update the previous shortest path value if the path distance between two substations is found to be shorter than the currently recorded shortest path value. This process is repeated until all substations are processed, and finally the shortest path from the main substation to all other substations is obtained. Among them, if the path from the current substation to the adjacent substation is shorter than the currently recorded path, the adjacent shortest path estimate is updated, and the adjacent predecessor node is updated to the current substation.

[0090] Schematically, there are four substations A, B, C, and D. Substation A is the main substation. At the initial moment, the shortest path of A is 0, and the shortest paths of B, C, and D are ∞. In the process of solving the Dijkstra algorithm, when the current substation is C, it is found that the distance from A to C (i.e., the current value) is 2, which is smaller than ∞, so the shortest distance corresponding to C is updated to 2. If substation C has an adjacent substation D, and the current distance from the main substation A→C→D is 4, which is smaller than the original ∞, then the shortest path of D is updated to 4, and substation C is set as the predecessor substation of substation D. When all substations are treated as "current substations", the shortest distance and predecessor substation of each substation are obtained, and backtracking is performed to obtain the shortest routing path from the main substation A to other substations.

[0091] Schematically, the pseudo code of the entire Dijkstra algorithm above is:

[0092] function Dijkstra(Graph,source):

[0093] dist[source]←0 / / Initialization

[0094] for each vertex v in Graph:

[0095] if v≠source

[0096] dist[v]←INFINITY / / Unknown distance from source to v

[0097] prev[v]←UNDEFINED / / Predecessor of v

[0098] Q←the set of all nodes in Graph / / All nodes in the graph areunvisited

[0099] while Q is not empty: / / The main loop

[0100] u←vertex in Q with min dist[u] / / Node with the least distance

[0101] remove u from Q

[0102] for each neighbor v of u: / / where v has not yet been removed from Q.

[0103] alt←dist[u]+length(u,v)

[0104] if alt <dist[v]: / / A shorter path to v has been found

[0105] dist[v]←alt

[0106] prev[v]←u

[0107] return dist[],prev[]

[0108] In this preferred embodiment, the shortest routing path from each substation to the main substation is obtained by solving the Dijkstra algorithm.

[0109] In another preferred embodiment, after obtaining the shortest routing path, the method further includes:

[0110] Obtaining the transmission resistance, transmission length and maximum transmission capacity of each transmission line on the shortest routing path;

[0111] According to the above transmission resistance, transmission length and maximum transmission capacity, the cost of each transmission line is calculated;

[0112] Calculate the sum of the costs of each transmission line to obtain the total cost corresponding to the above shortest routing path;

[0113] The above cost is calculated according to the following formula:

[0114] F=α·R+β·L+γ·P

[0115] In the formula, F represents the cost, α represents the first weight coefficient, R represents the transmission resistance, β represents the second weight coefficient, L represents the transmission length, γ represents the third weight coefficient, and P represents the maximum transmission capacity.

[0116] Specifically, the resistance value of the transmission resistor can be calculated based on the material and cross-sectional area of ​​the transmission line.

[0117] Specifically, the main factors affecting the cost of transmitting electrical energy through a transmission line are resistance, distance, and capacity limitations.

[0118] Specifically, the weight coefficients of each item in the above formula can be adjusted according to actual conditions. According to the formula, it can be seen that the greater the transmission resistance, the higher the cost, the greater the transmission length, which means the longer the transmission distance, the higher the cost, and the greater the maximum transmission capacity, the higher the cost.

[0119] In this preferred embodiment, by calculating the products of the transmission resistance, transmission length and maximum transmission capacity and their corresponding weight coefficients respectively, and then adding the products, the cost of each transmission line in the shortest routing path is obtained, and then the total cost of the entire routing path is obtained.

[0120] In another preferred embodiment, after obtaining the shortest routing path, the method further includes:

[0121] Obtain the average delay, average bandwidth, average packet loss rate, and stability score of the shortest routing path;

[0122] The comprehensive score of the shortest routing path is calculated based on the average delay, average bandwidth, average packet loss rate and stability score of the shortest routing path.

[0123] The calculation of the above comprehensive score is as follows:

[0124] E=w1*(1 / D)+w2*B+w3*(1-P)+w4*S

[0125] Wherein, E represents the above comprehensive score, D represents the average delay, w1 represents the weight coefficient corresponding to the average delay, B represents the average bandwidth, w2 represents the weight coefficient corresponding to the average bandwidth, P represents the average packet loss rate, w3 represents the weight coefficient corresponding to the average packet loss rate, S represents the stability score, and w4 represents the weight coefficient corresponding to the stability score.

[0126] Specifically, the average delay is in milliseconds and the value range is a positive number. The lower the delay, the better the path. The average bandwidth is in Mbps and the value range is a positive number. The higher the bandwidth, the better the path. The average packet loss rate is a decimal between 0 and 1. The lower the packet loss rate, the better the path. The stability score is a decimal between 0 and 1. The higher the stability, the better the path. The sum of the weight coefficients corresponding to the average values ​​is 1, and each weight coefficient is a positive number between 0 and 1. The weight coefficient can be adjusted according to the needs of the actual application scenario. For example, if latency is very critical to the application, then w1 can be assigned a higher value. If bandwidth is the main bottleneck, then the value of w2 should be higher.

[0127] Preferably, the communication comprehensive score of the shortest routing path currently obtained can be calculated by a weighted sum comprehensive evaluation method; the quality of the path is judged according to the score; the higher the score, the better the comprehensive performance of the path, and the more suitable it is for the current application scenario.

[0128] In this preferred embodiment, the comprehensive performance of the shortest routing path is obtained by calculating the comprehensive communication score of the shortest routing path.

[0129] Based on the above method embodiment, the present invention provides a corresponding device embodiment.

[0130] like Figure 2 As shown, an embodiment of the present invention provides a device for determining the shortest routing path in a transmission network, comprising:

[0131] Data acquisition module, algorithm construction module and shortest routing path determination module;

[0132] The above-mentioned data acquisition module is used to obtain the current of each transmission line in the transmission network to be optimized;

[0133] The algorithm construction module is used to construct a Dijkstra algorithm with each substation in the transmission network to be optimized as a node, the main substation as a starting node, and each of the transmission lines as an edge, and use the current as a path corresponding to the edge;

[0134] The shortest routing path determination module is used to solve the Dijkstra algorithm to obtain the shortest routing path from each substation in the transmission network to be optimized to the main substation.

[0135] In a preferred embodiment, the shortest routing path determination module includes:

[0136] A collection initialization unit, a shortest path initialization unit, a sorting operation execution unit, and a shortest routing path calculation unit;

[0137] The above-mentioned set initialization unit is used to initialize the shortest path substation set; wherein the above-mentioned shortest path substation set is used to store the substations for which the shortest path has been found;

[0138] The shortest path initialization unit is used to initialize the shortest path value of the main substation to 0, and the shortest path value from the main substation to other substations to infinity;

[0139] The above-mentioned sorting operation execution unit is used to repeatedly perform the substation sorting operation until all substations are added to the shortest path substation set, and backtrack according to the first current shortest path value, the predecessor substation and the second current shortest path value corresponding to each substation to determine the shortest path from the main substation to other substations;

[0140] The above-mentioned shortest routing path calculation unit is used to use the shortest path from the above-mentioned main substation to each other substation as the above-mentioned shortest routing path; wherein the above-mentioned substation sorting operation includes: obtaining the substation at the current moment; wherein the substation at the initial moment is the above-mentioned main substation; according to the above-mentioned current, calculating the first current path value from the main substation to the substation at the current moment; comparing the first current path value with the current shortest path value; wherein the above-mentioned current shortest path value is: the shortest path value from the main substation to the substation at the current moment; if the first current path value is less than the above-mentioned first current shortest path value, then the above-mentioned first current path value is used as the updated first current shortest path value, and the substation at the current moment is saved in the above-mentioned shortest path substation set; if the first current path value is not less than the above-mentioned first current shortest path value, then the first current shortest path value is not updated. New; obtain all adjacent substations adjacent to the substation at the current moment; according to the above current, calculate all the second current path values ​​from the main substation through the current substation to all adjacent substations; respectively compare the second current path value corresponding to each adjacent substation with the second current shortest path value; wherein the above second current shortest path value is: the current shortest path value from the main substation to all adjacent substations; among all the comparison results, the second current path value of the adjacent substation whose second current path value is less than the above second current shortest path value is used as the corresponding updated second current shortest path value, and the substation at the current moment is used as the predecessor substation of the adjacent substation for updating the second current shortest path value; determine whether the current shortest path substation set contains all substations, if not, select a substation from the substations that are not included as the substation at the next moment.

[0141] In another preferred embodiment, after the shortest routing path determination module, it further includes: a cost calculation module;

[0142] The cost calculation module is used to obtain the transmission resistance, transmission length and maximum transmission capacity of each transmission line on the shortest routing path; calculate the cost of each transmission line according to the transmission resistance, transmission length and maximum transmission capacity; calculate the sum of the costs of each transmission line to obtain the total cost corresponding to the shortest routing path; wherein the cost is calculated according to the following formula:

[0143] F=α·R+β·L+γ·P

[0144] In the formula, F represents the cost, α represents the first weight coefficient, R represents the transmission resistance, β represents the second weight coefficient, L represents the transmission length, γ represents the third weight coefficient, and P represents the maximum transmission capacity.

[0145] In another preferred embodiment, after the shortest routing path determination module, it further includes: a comprehensive evaluation calculation module;

[0146] The above-mentioned comprehensive evaluation calculation module is used to obtain the average delay, average bandwidth, average packet loss rate and stability score of the above-mentioned shortest routing path; according to the average delay, average bandwidth, average packet loss rate and stability score of the above-mentioned shortest routing path, the comprehensive score of the above-mentioned shortest routing path is calculated; wherein, the calculation of the above-mentioned comprehensive score is shown in the following formula:

[0147] E=w1*(1 / D)+w2*B+w3*(1-P)+w4*S

[0148] Wherein, E represents the above comprehensive score, D represents the average delay, w1 represents the weight coefficient corresponding to the average delay, B represents the average bandwidth, w2 represents the weight coefficient corresponding to the average bandwidth, P represents the average packet loss rate, w3 represents the weight coefficient corresponding to the average packet loss rate, S represents the stability score, and w4 represents the weight coefficient corresponding to the stability score.

[0149] It should be noted that the device embodiments described above are merely schematic, wherein the modules described above as separate components may or may not be physically separated, and the components displayed as modules may or may not be physical modules, that is, they may be located in one place, or they may be distributed on multiple network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the scheme of this embodiment. In addition, in the accompanying drawings of the device embodiments provided by the present invention, the connection relationship between the modules indicates that there is a communication connection between them, which can be specifically implemented as one or more communication buses or signal lines. A person of ordinary skill in the art can understand and implement it without paying creative labor. The above schematic diagram is only an example of a device for determining the shortest routing path in a transmission network, and does not constitute a limitation on a device for determining the shortest routing path in a transmission network, and may include more or fewer components than shown in the figure, or a combination of certain components, or different components.

[0150] Based on the above method item embodiments, the present invention provides corresponding terminal device item embodiments.

[0151] Another embodiment of the present invention provides a terminal device, including a processor, a memory, and a computer program stored in the memory and configured to be executed by the processor, and when the processor executes the computer program, it implements the method for determining the shortest routing path in a transmission network described in any embodiment of the present invention.

[0152] Exemplarily, in this embodiment, the computer program may be divided into one or more modules, which are stored in the memory and executed by the processor to implement the present invention. The one or more module elements may be a series of computer program instruction segments capable of implementing specific functions, which are used to describe the execution process of the computer program in the device;

[0153] The terminal device may be a computing device such as a desktop computer, a notebook, a PDA, a cloud server, etc. The device may include, but is not limited to, a processor, a memory;

[0154] The processor referred to herein may be a central processing unit (CPU), other general-purpose processors, digital signal processors (DSP), application-specific integrated circuits (ASIC), field-programmable gate arrays (FPGA) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. The general-purpose processor may be a microprocessor or any conventional processor, etc. The above-mentioned processor is the control center of the above-mentioned device, and uses various interfaces and lines to connect various parts of the entire device;

[0155] The above-mentioned memory can be used to store the above-mentioned computer programs and / or modules. The above-mentioned processor realizes various functions of the above-mentioned device by running or executing the computer programs and / or modules stored in the above-mentioned memory, and calling the data stored in the memory. The above-mentioned memory can mainly include a program storage area and a data storage area, wherein the program storage area can store an operating system, at least one application required for a function, etc.; in addition, the memory can include a high-speed random access memory, and can also include a non-volatile memory, such as a hard disk, a memory, a plug-in hard disk, a smart memory card (Smart Media Card, SMC), a secure digital (Secure Digital, SD) card, a flash card (Flash Card), at least one disk storage device, a flash memory device, or other volatile solid-state storage devices.

[0156] Based on the above method item embodiments, the present invention provides a corresponding storage medium item embodiment.

[0157] Another embodiment of the present invention provides a storage medium, the storage medium includes a stored computer program, wherein when the computer program is running, the device where the storage medium is located is controlled to execute the method for determining the shortest routing path in a transmission network described in any embodiment of the present invention.

[0158] In this embodiment, the storage medium is a computer-readable storage medium, the computer program includes computer program code, and the computer program code may be in source code form, object code form, executable file or some intermediate form, etc. The computer-readable medium may include: any entity or device capable of carrying the computer program code, recording medium, USB flash drive, mobile hard disk, magnetic disk, optical disk, computer memory, read-only memory (ROM), random access memory (RAM), electric carrier signal, telecommunication signal and software distribution medium, etc.

[0159] Compared with the prior art, by implementing the above-mentioned embodiments of the present invention, the shortest routing path can be obtained, and the communication transmission delay and packet loss rate can be reduced.

[0160] The above is a preferred embodiment of the present invention. It should be pointed out that for ordinary technicians in this technical field, several improvements and modifications can be made without departing from the principle of the present invention. These improvements and modifications are also considered to be within the scope of protection of the present invention.

Claims

1. A method for determining the shortest routing path in a transmission network, characterized in that: include: Obtaining the current of each transmission line in the transmission network to be optimized; Taking each substation in the transmission network to be optimized as a node, the main substation as a starting node, and each transmission line as an edge, constructing a Dijkstra algorithm, and taking the current as a path corresponding to the edge; The Dijkstra algorithm is solved to obtain the shortest routing path from each substation in the transmission network to be optimized to the main substation.

2. The method for determining the shortest routing path in a power transmission network according to claim 1, characterized in that: Solving the Dijkstra algorithm to obtain the shortest routing path from each substation in the transmission network to be optimized to the main substation includes: Initializing a shortest path substation set; wherein the shortest path substation set is used to store substations for which the shortest path has been found; Initialize the shortest path value of the main substation to 0, and the shortest path value from the main substation to other substations to infinity; Repeat the substation sorting operation until all substations are added to the shortest path substation set, and backtrack according to the first current shortest path value, the predecessor substation and the second current shortest path value corresponding to each substation to determine the shortest path from the main substation to other substations; The shortest path from the main substation to other substations is used as the shortest routing path; The substation sequencing operation includes: Obtain the substation at the current moment; wherein the substation at the initial moment is the main substation; According to the current, a first current path value from the main substation to the substation at the current moment is calculated; Compare the first current path value with the current shortest path value; wherein the current shortest path value is: the shortest path value from the main substation to the substation at the current moment; If the first current path value is less than the first current shortest path value, the first current path value is used as the updated first current shortest path value, and the substation at the current moment is saved in the shortest path substation set; if the first current path value is not less than the first current shortest path value, the first current shortest path value is not updated; Obtain all adjacent substations adjacent to the substation at the current moment; According to the current, all second current path values ​​from the main substation through the current substation to all adjacent substations are calculated; The second current path value corresponding to each adjacent substation is compared with the second current shortest path value respectively; wherein the second current shortest path value is: the shortest path value from the main substation to all adjacent substations at present; Among all comparison results, the second current path value of the adjacent substation whose second current path value is less than the second current shortest path value is used as the corresponding updated second current shortest path value, and the substation at the current moment is used as the predecessor substation of the adjacent substation for updating the second current shortest path value; It is determined whether the current shortest path substation set includes all substations. If not, a substation is selected from the substations not included as the substation at the next moment.

3. The method for determining the shortest routing path in a transmission network according to claim 2, characterized in that: After obtaining the shortest routing path, the method further includes: Obtaining the transmission resistance, transmission length and maximum transmission capacity of each transmission line on the shortest routing path; Calculate the cost of each transmission line according to the transmission resistance, transmission length and maximum transmission capacity; Calculate the sum of the costs of each transmission line to obtain the total cost corresponding to the shortest routing path; The cost is calculated according to the following formula: F=α·R+β·L+γ·P In the formula, F represents the cost, α represents the first weight coefficient, R represents the transmission resistance, β represents the second weight coefficient, L represents the transmission length, γ represents the third weight coefficient, and P represents the maximum transmission capacity.

4. The method for determining the shortest routing path in a transmission network according to claim 3, characterized in that: After obtaining the shortest routing path, the method further includes: Obtaining the average delay, average bandwidth, average packet loss rate and stability score of the shortest routing path; Calculate the comprehensive score of the shortest routing path according to the average delay, average bandwidth, average packet loss rate and stability score of the shortest routing path; The calculation of the comprehensive score is as follows: E=w1*(1 / D)+w2*B+w3*(1-P)+w4*S In the formula, E represents the comprehensive score, D represents the average delay, w1 represents the weight coefficient corresponding to the average delay, B represents the average bandwidth, w2 represents the weight coefficient corresponding to the average bandwidth, P represents the average packet loss rate, w3 represents the weight coefficient corresponding to the average packet loss rate, S represents the stability score, and w4 represents the weight coefficient corresponding to the stability score.

5. A device for determining the shortest routing path in a transmission network, characterized in that: include: Data acquisition module, algorithm construction module and shortest routing path determination module; The data acquisition module is used to acquire the current of each transmission line in the transmission network to be optimized; The algorithm construction module is used to construct a Dijkstra algorithm with each substation in the transmission network to be optimized as a node, the main substation as a starting node, and each transmission line as an edge, and use the current as a path corresponding to the edge; The shortest routing path determination module is used to solve the Dijkstra algorithm to obtain the shortest routing path from each substation in the transmission network to be optimized to the main substation.

6. The device for determining the shortest routing path in a power transmission network according to claim 5, characterized in that: The shortest routing path determination module comprises: A collection initialization unit, a shortest path initialization unit, a sorting operation execution unit, and a shortest routing path calculation unit; The set initialization unit is used to initialize the shortest path substation set; wherein the shortest path substation set is used to store the substations for which the shortest path has been found; The shortest path initialization unit is used to initialize the shortest path value of the main substation to 0, and the shortest path value from the main substation to other substations to infinity; The sorting operation execution unit is used to repeatedly perform the substation sorting operation until all substations are added to the shortest path substation set, and to backtrack according to the first current shortest path value, the predecessor substation and the second current shortest path value corresponding to each substation to determine the shortest path from the main substation to each other substation; The shortest routing path calculation unit is used to use the shortest path from the main substation to other substations as the shortest routing path; wherein the substation sorting operation includes: obtaining the substation at the current moment; wherein the substation at the initial moment is the main substation; according to the current, calculating the first current path value from the main substation to the substation at the current moment; comparing the first current path value with the current shortest path value; wherein the current shortest path value is: the shortest path value from the main substation to the substation at the current moment; if the first current path value is less than the first current shortest path value, then the first current path value is used as the updated first current shortest path value, and the substation at the current moment is saved in the shortest path substation set; if the first current path value is not less than the first current shortest path value, then the first current shortest path value is not updated. New; obtain all adjacent substations adjacent to the substation at the current moment; according to the current, calculate all the second current path values ​​from the main substation through the current substation to all adjacent substations; respectively compare the second current path value corresponding to each adjacent substation with the second current shortest path value; wherein the second current shortest path value is: the current shortest path value from the main substation to all adjacent substations; among all the comparison results, the second current path value of the adjacent substation whose second current path value is less than the second current shortest path value is used as the corresponding updated second current shortest path value, and the substation at the current moment is used as the predecessor substation of the adjacent substation for updating the second current shortest path value; determine whether the current shortest path substation set contains all substations, if not, select a substation from the substations that are not included as the substation at the next moment.

7. The device for determining the shortest routing path in a power transmission network according to claim 6, characterized in that: After the shortest routing path determination module, it also includes: a cost calculation module; The cost calculation module is used to obtain the transmission resistance, transmission length and maximum transmission capacity of each transmission line on the shortest routing path; calculate the cost of each transmission line according to the transmission resistance, transmission length and maximum transmission capacity; calculate the sum of the costs of each transmission line to obtain the total cost corresponding to the shortest routing path; wherein the cost is calculated according to the following formula: F=α·R+β·L+γ·P In the formula, F represents the cost, α represents the first weight coefficient, R represents the transmission resistance, β represents the second weight coefficient, L represents the transmission length, γ represents the third weight coefficient, and P represents the maximum transmission capacity.

8. The device for determining the shortest routing path in a power transmission network according to claim 7, characterized in that: After the shortest routing path determination module, it also includes: a comprehensive evaluation calculation module; The comprehensive evaluation calculation module is used to obtain the average delay, average bandwidth, average packet loss rate and stability score of the shortest routing path; according to the average delay, average bandwidth, average packet loss rate and stability score of the shortest routing path, the comprehensive score of the shortest routing path is calculated; wherein the calculation of the comprehensive score is shown in the following formula: E=w1*(1 / D)+w2*B+w3*(1-P)+w4*S In the formula, E represents the comprehensive score, D represents the average delay, w1 represents the weight coefficient corresponding to the average delay, B represents the average bandwidth, w2 represents the weight coefficient corresponding to the average bandwidth, P represents the average packet loss rate, w3 represents the weight coefficient corresponding to the average packet loss rate, S represents the stability score, and w4 represents the weight coefficient corresponding to the stability score.

9. A terminal device, characterized in that: The method comprises a processor, a memory, and a computer program stored in the memory and configured to be executed by the processor, wherein when the processor executes the computer program, the method for determining the shortest routing path in a transmission network as claimed in any one of claims 1 to 4 is implemented.

10. A storage medium, characterized in that: The storage medium includes a stored computer program, wherein when the computer program is executed, the device where the storage medium is located is controlled to execute the method for determining the shortest routing path in a power transmission network as claimed in any one of claims 1 to 4.

Images