CN112115567B - Optical fiber minimum consumption path planning method - Google Patents
Optical fiber minimum consumption path planning method Download PDFInfo
- Publication number
- CN112115567B CN112115567B CN202010762760.1A CN202010762760A CN112115567B CN 112115567 B CN112115567 B CN 112115567B CN 202010762760 A CN202010762760 A CN 202010762760A CN 112115567 B CN112115567 B CN 112115567B
- Authority
- CN
- China
- Prior art keywords
- point
- loss
- path
- calculation
- effective
- 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
- 239000013307 optical fiber Substances 0.000 title claims abstract description 35
- 238000000034 method Methods 0.000 title claims abstract description 32
- 238000004364 calculation method Methods 0.000 claims abstract description 57
- 239000000835 fiber Substances 0.000 claims description 13
- 230000004927 fusion Effects 0.000 claims description 12
- 238000003466 welding Methods 0.000 claims description 6
- 238000012163 sequencing technique Methods 0.000 claims description 3
- 235000021197 fiber intake Nutrition 0.000 abstract description 3
- 238000010586 diagram Methods 0.000 description 4
- 230000003287 optical effect Effects 0.000 description 4
- 238000004891 communication Methods 0.000 description 2
- RYGMFSIKBFXOCR-UHFFFAOYSA-N Copper Chemical compound [Cu] RYGMFSIKBFXOCR-UHFFFAOYSA-N 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 229910052802 copper Inorganic materials 0.000 description 1
- 239000010949 copper Substances 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000002349 favourable effect Effects 0.000 description 1
- 230000000149 penetrating effect Effects 0.000 description 1
- 238000012216 screening Methods 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F30/00—Computer-aided design [CAD]
- G06F30/10—Geometric CAD
- G06F30/18—Network design, e.g. design based on topological or interconnect aspects of utility systems, piping, heating ventilation air conditioning [HVAC] or cabling
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- 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
- Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- Business, Economics & Management (AREA)
- Theoretical Computer Science (AREA)
- Human Resources & Organizations (AREA)
- General Physics & Mathematics (AREA)
- Strategic Management (AREA)
- Geometry (AREA)
- Economics (AREA)
- Development Economics (AREA)
- Computer Networks & Wireless Communication (AREA)
- General Engineering & Computer Science (AREA)
- Mathematical Analysis (AREA)
- Computer Hardware Design (AREA)
- Computational Mathematics (AREA)
- Mathematical Optimization (AREA)
- Pure & Applied Mathematics (AREA)
- Game Theory and Decision Science (AREA)
- Evolutionary Computation (AREA)
- Entrepreneurship & Innovation (AREA)
- Marketing (AREA)
- Operations Research (AREA)
- Quality & Reliability (AREA)
- Tourism & Hospitality (AREA)
- General Business, Economics & Management (AREA)
- Mechanical Coupling Of Light Guides (AREA)
Abstract
The invention relates to a method for planning an optical fiber minimum consumption path, which can save steps of manual on-site checking or document turning through setting a proper area range to find effective equipment points, achieves the purpose of intelligently and quickly positioning equipment points suitable for participation in calculation, and can quickly and reasonably calculate the optical fiber path with minimum optical fiber consumption by combining a path index set and loss values in the points.
Description
Technical Field
The invention relates to the technical field of optical fiber implementation laying path design, in particular to an optical fiber minimum consumption path planning method.
Background
The optical fiber can bear very high bandwidth, and the optical fiber cost is obviously lower than that of a copper cable, so that the optical fiber is a necessary direction of broadband network development. In recent years, the popularization of optical fiber communication and the diversification and structure complicacy of communication modes, the types and the number of fiber cores of optical cables are greatly changed, the distribution and the use condition of internal light rays form complex grid distribution, and the number of alternative path schemes among optical cable facilities is very large when the optical fiber path is planned.
In the past, the optical fiber path planning usually adopts a method of manually consulting optical cable data, field survey optical fiber service condition and network topology to plan, which is time-consuming and labor-consuming, and is easy to miss the optimal path, and in actual work, the fiber cores of the optical fibers can generate loss when welding and jumper connection are completed, and the transmission speed of the optical cable is affected by the excessively high loss value. Therefore, there is a need for a method that can quickly and efficiently plan a path between two nodes.
Disclosure of Invention
In order to solve the defects in the prior art, the invention provides a method for planning the minimum-consumption optical fiber path, which can quickly and reasonably calculate the minimum-consumption optical fiber path through combining the path index set with the loss value in the point positions.
In order to achieve the above object, the present invention adopts the technical scheme that:
a method for planning a path of least consumption of an optical fiber, comprising:
respectively acquiring a starting point device point location distance set of all effective device points in a starting point region and an ending point device point location distance set of all effective device points in an ending point region according to a set starting point and ending point of the optical fiber path; the effective equipment point positions are equipment point positions with the number of fiber cores in the equipment being more than 1;
acquiring the length of a linear connecting line between a set starting point and an end point of an optical fiber path as a calculation distance, setting a circular calculation area passing through the starting point and the end point by taking the calculation distance as a diameter, and acquiring an area equipment point position distance set of all effective equipment points in the calculation area;
the point location distance set of the starting point device and the point location distance set of the ending point device are integrated with the point location distance set of the regional device in a de-duplication mode, and an effective device point location distance set is obtained;
acquiring a fusion connection relation set corresponding to all the connected equipment points in the effective equipment point distance set;
and calculating according to the effective equipment point location distance set and the welding relation set to obtain a minimum loss path between the starting point and the ending point.
Further, the starting point region comprises a selected radius circular region taking the set starting point as a circle center; the end point region comprises a selected radius circular region centered on the set end point.
Further, the selected radius is the sum of the radius base and the product of the search times and the increment base; the radius base, the search times and the increment base are nonnegative values which are set arbitrarily according to the requirement.
Further, the calculating the minimum loss path between the starting point and the ending point according to the effective equipment point location distance set and the welding relation set further includes:
integrating the effective equipment point location distance set and the welding relation set to form a loss calculation set;
allocating unique index numbers to all effective equipment points in the loss calculation set;
establishing a linked list set according to the effective connection relation among all the effective equipment points in the loss calculation set and the corresponding index sequence numbers;
forming an reachable path set from all reachable paths from the starting point to the ending point in the linked list set;
and calculating the total loss of each of all the reachable paths in the reachable path set, and sequencing to obtain the reachable path with the minimum total loss, namely the required minimum loss path.
Further, the establishing the linked list set includes:
taking any one effective equipment point in the loss calculation set as an origin, and acquiring all effective point positions directly connected with the origin to form a linked list aiming at the origin;
and sequentially setting all effective equipment points in the loss calculation set as origins, repeatedly obtaining the corresponding linked lists respectively, and combining the obtained linked lists to form a linked list set.
Further, the total loss includes intrinsic and extrinsic losses of the fiber optic connection.
Further, the calculating the total loss of each of all reachable paths in the set of reachable paths includes:
respectively calculating connection loss between the effective equipment points directly connected in the reachable path; the connection loss comprises an addition value of the intrinsic loss obtained by calculation of the connection length, a fusion connection relation and the extrinsic loss obtained by calculation of the fiber core number;
summing the connection losses of the segments results in a total loss of the reachable path.
Further, the method further comprises:
removing effective equipment points included in the calculated minimum loss path to form a new loss calculation set, and recalculating the secondary minimum loss path by using the new loss calculation set;
and repeating the step of eliminating the effective equipment point positions to form a new loss calculation set, and calculating a plurality of secondary selection minimum loss paths until the residual effective equipment point positions cannot meet the connection requirements from the starting point to the ending point.
Further, the method further comprises:
the required path is selected from the minimum loss path and all the sub-selected minimum loss paths.
The beneficial effects of the invention are as follows:
by adopting the optical fiber minimum consumption path planning method, the steps of manually checking on site or turning over documents and the like can be omitted by setting a proper area range to find effective equipment points, so that the purpose of intelligently and quickly positioning the equipment points suitable for participating in calculation is achieved; the relation among the point positions of the equipment is expressed in a linked list form, all the reachable paths can be more conveniently exhausted, the total loss of different paths is obtained through faster calculation through an optimized path index set, and the pressure of calculating the loss is reduced.
Drawings
FIG. 1 is a flow chart of a method for planning a path of minimum fiber consumption according to the present invention.
Fig. 2 is a schematic diagram of an effective device point location relationship in an embodiment of the present invention.
FIG. 3 is a schematic diagram of an effective device point location relationship linked list in an embodiment of the present invention.
FIG. 4 is a schematic diagram showing the steps of a preferred embodiment of the present invention.
Detailed Description
For a clearer understanding of the present invention, reference will be made to the following detailed description taken in conjunction with the accompanying drawings and examples.
Fig. 1 is a schematic flow chart of a method for planning a path of minimum fiber consumption according to the present invention, which comprises the following steps:
according to the set starting point and ending point of the optical fiber path, a starting point device point position distance set of all effective device points in the starting point area and an ending point device point position distance set of all effective device points in the ending point area are respectively obtained, a selected radius round area taking the starting point and the ending point as circle centers is preferably adopted as the starting point area and the ending point area, wherein the selected radius is the sum of products of radius base, search times and increment base, the radius base, search times and increment base can be adjusted to any proper non-negative value according to the calculation accuracy and calculation amount, for example, the radius base can be 500, the search times is 2 and the increment base is 10, and the selected radius 520 can be calculated. The effective equipment point position is an equipment point position with the number of fiber cores in the equipment being more than 1. Through the method, the equipment point positions which can be connected around the starting point and the ending point can be effectively screened, and the labor consumption, time consumption and omission caused by manual screening are avoided.
The method comprises the steps of obtaining the length of a straight line connecting line between a starting point and an ending point of a set optical fiber path as a calculation distance, setting a circular calculation area penetrating through the starting point and the ending point by taking the calculation distance as a diameter, and obtaining an area equipment point position distance set of all effective equipment points in the calculation area. The starting point and the ending point are used as a device point position set needing to participate in calculation between the point setting starting point and the ending point of the common tangent point drawing circle, and by applying the step, the device point positions with better starting point and ending point can be effectively screened, especially the device point positions with different directions of the path between the two points can be removed, and the calculation amount is reduced.
And de-overlapping and integrating the point location distance set of the starting point device and the point location distance set of the ending point device with the point location distance set of the regional device to obtain an effective point location distance set of the device. By integrating the above sets and eliminating the mutually repeated device points, an effective device point location distance set which is favorable for subsequent calculation can be obtained, wherein the set comprises all device points possibly passed by any path between a starting point and an ending point and optical fiber connection relations among all device points, such as optical fiber connection lengths (weight values and weight side values) between the point locations A and B.
And acquiring a fusion connection relation set corresponding to all the connected equipment points in the effective equipment point position distance set, for example, an optical fiber connection fusion connection relation between the point positions A and B.
And calculating according to the effective equipment point location distance set and the welding relation set to obtain a minimum loss path between the starting point and the ending point. The basic calculation concept is to obtain the preferred path with the minimum loss by exhausting all the reachable paths from the starting point to the ending point within the given set range and calculating the intrinsic loss (determined by the optical fiber connection length) and the extrinsic loss (determined by the optical fiber connection fusion connection relation) of each path respectively. The specific steps may preferably include: and integrating the effective equipment point position distance set and the fusion connection relation set into a loss calculation set, namely, the optical fiber connection distance corresponds to the optical fiber connection fusion connection relation data, so that the loss calculation can be referred to simultaneously to obtain intrinsic loss and extrinsic loss. And allocating unique index numbers to all effective equipment points in the loss calculation set so as to facilitate the subsequent expression of different equipment points and different path selections.
Establishing a linked list set according to the effective connection relation among all the effective equipment points in the loss calculation set and the corresponding index sequence numbers, namely converting the set into an entity data array (Vexnode), and facilitating the subsequent reachable path enumeration operation; preferably, a NodeArry entity class and an edge node entity class can be added in the process of building the linked list set, wherein the attribute of the NodeArry entity class comprises an index position (int DataIndex), equipment point position relation details (EdgeNode CurrentNode, and edge node is an entity class) and a calling condition (bootie), and the attribute of the edge node entity class comprises a current equipment point position index (int adjvex) and a next point position index (EdgeNode nextEdge). Taking any one effective equipment point in the loss calculation set as an origin, and acquiring all effective point positions directly connected with the origin to form a linked list aiming at the origin; and sequentially setting all effective equipment points in the loss calculation set as origins, repeatedly obtaining the corresponding linked lists respectively, and combining the obtained linked lists to form a linked list set. Taking the embodiment shown in fig. 2 as an example, a schematic diagram of the effective device point position relationship from the device 1 to the device 5 is given, which can be approximately understood that the connection relationship between the device 1 and the device 5 in practice is shown in fig. 2; after the connection data is obtained, the connection relationship may be converted into a linked list set as shown in fig. 3 through the related step of the method, a leftmost column is set as an origin to list other points which can be reached by the origin, a next connectable point is expressed by the next, and no more connectable points exist by null expression, for example, for the example, taking the device 1 as the origin (the first row in fig. 3), the surface device 1 point can be connected with the device 2, the device 3 and the device 4.
Forming an reachable path set from all reachable paths from the starting point to the ending point in the linked list set; it is preferable to use a depth-first algorithm to exhaust all reachable paths, for example, for the embodiment shown in fig. 2 and 3, with device 1 as the starting point and device 5 as the ending point, the reachable paths can be calculated to include the following three paths: device 1-device 2-device 3-device 5, device 1-device 4-device 3-device 5, device 1-device 3-device 5.
And calculating the total loss of each of all the reachable paths in the reachable path set, and sequencing to obtain the reachable path with the minimum total loss, namely the required minimum loss path. It should be noted that the intrinsic and extrinsic losses of the fiber optic connection need to be included in the calculation of the total loss, specifically by: respectively calculating connection loss between the effective equipment points directly connected in the reachable path; the connection loss comprises an addition value of the intrinsic loss obtained by calculation of the connection length, a fusion connection relation and the extrinsic loss obtained by calculation of the fiber core number; summing the connection losses of the segments results in a total loss of the reachable path. Wherein the intrinsic loss per unit length of optical fiber and the loss of a particular fusion type can be given empirically, i.e. the total loss in the actual calculation is directly related to the fiber connection length and the fiber connection fusion relationship. It should also be noted that the extrinsic losses in the total loss calculation are in a significant proportion and cannot be ignored, so the resulting minimum loss path calculated is likely not the shortest path.
On the basis of obtaining the minimum loss path by the method, the minimum loss path can be further calculated for a plurality of times to provide a plurality of different scheme references (multi-path routing planning), meanwhile, the phenomenon that the obtained result is not optimal due to the calculation inherent error can be avoided, and the method specifically comprises the following steps: removing effective equipment points included in the calculated minimum loss path to form a new loss calculation set, and recalculating the secondary minimum loss path by using the new loss calculation set; and repeating the step of eliminating the effective equipment point positions to form a new loss calculation set, and calculating a plurality of secondary selection minimum loss paths until the residual effective equipment point positions cannot meet the connection requirements from the starting point to the ending point. Further, a desired path can be obtained by comparing the path data with each other as needed.
Fig. 4 is a schematic flow chart of a preferred embodiment of a method according to the present invention, in which specific steps for calculating a path of minimum consumption of an optical fiber by applying the method according to the present invention are provided, and in particular, a plurality of judgment steps may be further preferably included to avoid a situation of calculation not applicable to the method according to the present invention.
The foregoing is only a preferred embodiment of the present invention, but the scope of the present invention is not limited thereto, and any changes or substitutions easily contemplated by those skilled in the art within the scope of the present invention should be included in the scope of the present invention. Therefore, the protection scope of the present invention should be subject to the protection scope of the claims.
Claims (8)
1. A method for planning a path of least consumption of an optical fiber, comprising:
respectively acquiring a starting point device point location distance set of all effective device points in a starting point region and an ending point device point location distance set of all effective device points in an ending point region according to a set starting point and ending point of the optical fiber path; the effective equipment point positions are equipment point positions with the number of fiber cores in the equipment being more than 1;
acquiring the length of a linear connecting line between a set starting point and an end point of an optical fiber path as a calculation distance, setting a circular calculation area passing through the starting point and the end point by taking the calculation distance as a diameter, and acquiring an area equipment point position distance set of all effective equipment points in the calculation area;
the point location distance set of the starting point device and the point location distance set of the ending point device are integrated with the point location distance set of the regional device in a de-duplication mode, and an effective device point location distance set is obtained;
acquiring a fusion connection relation set corresponding to all the connected equipment points in the effective equipment point distance set;
integrating the effective equipment point location distance set and the welding relation set to form a loss calculation set;
allocating unique index numbers to all effective equipment points in the loss calculation set;
establishing a linked list set according to the effective connection relation among all the effective equipment points in the loss calculation set and the corresponding index sequence numbers;
forming an reachable path set from all reachable paths from the starting point to the ending point in the linked list set;
and calculating the total loss of each of all the reachable paths in the reachable path set, and sequencing to obtain the reachable path with the minimum total loss, namely the required minimum loss path.
2. The method of claim 1, wherein the start point region comprises a selected radius circular region centered around a set start point; the end point region comprises a selected radius circular region centered on the set end point.
3. The method of claim 2 wherein the selected radius is a sum of a radius base and a product of a search number and an increment base; the radius base, the search times and the increment base are nonnegative values which are set arbitrarily according to the requirement.
4. The method of claim 1, wherein the establishing a linked list set comprises:
taking any one effective equipment point in the loss calculation set as an origin, and acquiring all effective point positions directly connected with the origin to form a linked list aiming at the origin;
and sequentially setting all effective equipment points in the loss calculation set as origins, repeatedly obtaining the corresponding linked lists respectively, and combining the obtained linked lists to form a linked list set.
5. The method of claim 1, wherein the total loss comprises intrinsic and extrinsic losses of the fiber optic connection.
6. The method of claim 5, wherein calculating the respective total loss for all reachable paths in the set of reachable paths comprises:
respectively calculating connection loss between the effective equipment points directly connected in the reachable path; the connection loss comprises an addition value of the intrinsic loss obtained by calculation of the connection length, a fusion connection relation and the extrinsic loss obtained by calculation of the fiber core number;
summing the connection losses of the segments results in a total loss of the reachable path.
7. The method of claim 1, wherein the method further comprises:
removing effective equipment points included in the calculated minimum loss path to form a new loss calculation set, and recalculating the secondary minimum loss path by using the new loss calculation set;
and repeating the step of eliminating the effective equipment point positions to form a new loss calculation set, and calculating a plurality of secondary selection minimum loss paths until the residual effective equipment point positions cannot meet the connection requirements from the starting point to the ending point.
8. The method of claim 7, wherein the method further comprises:
the required path is selected from the minimum loss path and all the sub-selected minimum loss paths.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010762760.1A CN112115567B (en) | 2020-08-01 | 2020-08-01 | Optical fiber minimum consumption path planning method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010762760.1A CN112115567B (en) | 2020-08-01 | 2020-08-01 | Optical fiber minimum consumption path planning method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112115567A CN112115567A (en) | 2020-12-22 |
| CN112115567B true CN112115567B (en) | 2024-04-16 |
Family
ID=73799105
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010762760.1A Active CN112115567B (en) | 2020-08-01 | 2020-08-01 | Optical fiber minimum consumption path planning method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112115567B (en) |
Citations (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6721414B1 (en) * | 1999-08-17 | 2004-04-13 | Nec America, Inc. | Cable management system |
| CN104679947A (en) * | 2015-02-02 | 2015-06-03 | 南京航空航天大学 | Automatic generation method of cable component optimizing structure of mechanical and electrical product |
| CN104753694A (en) * | 2013-12-25 | 2015-07-01 | 中国移动通信集团河北有限公司 | Method and device for automatic route selection of optical cable |
| WO2017045578A1 (en) * | 2015-09-16 | 2017-03-23 | 烽火通信科技股份有限公司 | Topological graph optimal path algorithm with constraint conditions |
| CN107978219A (en) * | 2016-10-25 | 2018-05-01 | 武汉四维图新科技有限公司 | A kind of method and device for the road network for building numerical map |
| CN108827335A (en) * | 2018-08-22 | 2018-11-16 | 北京理工大学 | A kind of shortest path planning method based on unidirectional search model |
| CN109344513A (en) * | 2018-10-12 | 2019-02-15 | 厦门市美亚柏科信息股份有限公司 | A kind of minimal path planing method, system and computer storage medium |
| CN109583667A (en) * | 2019-01-08 | 2019-04-05 | 北京航空航天大学 | A kind of cable trails solving optimization method |
| CN110782178A (en) * | 2019-11-01 | 2020-02-11 | 北京航空航天大学 | Traffic network planning aid decision-making method and device |
| CN110808883A (en) * | 2019-11-07 | 2020-02-18 | 中国电子科技集团公司第三十四研究所 | Searching method of optical fiber communication transmission path |
| CN111027738A (en) * | 2019-10-18 | 2020-04-17 | 国网浙江省电力有限公司嘉兴供电公司 | Electric power communication optical cable laying optimization method based on genetic algorithm |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8452176B2 (en) * | 2011-02-18 | 2013-05-28 | At&T Intellectual Property I, Lp | Reachability matrices spanning multiple domains in an optical network |
-
2020
- 2020-08-01 CN CN202010762760.1A patent/CN112115567B/en active Active
Patent Citations (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6721414B1 (en) * | 1999-08-17 | 2004-04-13 | Nec America, Inc. | Cable management system |
| CN104753694A (en) * | 2013-12-25 | 2015-07-01 | 中国移动通信集团河北有限公司 | Method and device for automatic route selection of optical cable |
| CN104679947A (en) * | 2015-02-02 | 2015-06-03 | 南京航空航天大学 | Automatic generation method of cable component optimizing structure of mechanical and electrical product |
| WO2017045578A1 (en) * | 2015-09-16 | 2017-03-23 | 烽火通信科技股份有限公司 | Topological graph optimal path algorithm with constraint conditions |
| CN107978219A (en) * | 2016-10-25 | 2018-05-01 | 武汉四维图新科技有限公司 | A kind of method and device for the road network for building numerical map |
| CN108827335A (en) * | 2018-08-22 | 2018-11-16 | 北京理工大学 | A kind of shortest path planning method based on unidirectional search model |
| CN109344513A (en) * | 2018-10-12 | 2019-02-15 | 厦门市美亚柏科信息股份有限公司 | A kind of minimal path planing method, system and computer storage medium |
| CN109583667A (en) * | 2019-01-08 | 2019-04-05 | 北京航空航天大学 | A kind of cable trails solving optimization method |
| CN111027738A (en) * | 2019-10-18 | 2020-04-17 | 国网浙江省电力有限公司嘉兴供电公司 | Electric power communication optical cable laying optimization method based on genetic algorithm |
| CN110782178A (en) * | 2019-11-01 | 2020-02-11 | 北京航空航天大学 | Traffic network planning aid decision-making method and device |
| CN110808883A (en) * | 2019-11-07 | 2020-02-18 | 中国电子科技集团公司第三十四研究所 | Searching method of optical fiber communication transmission path |
Non-Patent Citations (2)
| Title |
|---|
| 《光纤数据的最优传播路径计算机仿真研究》;刘文龙等著;《激光杂志》;第40卷(第6期);第171-175页 * |
| 《基于Dijkstra算法的电缆敷设系统设计及实现》;黄祖光等著;《电网与清洁能源》;第36卷(第6期);第105-110页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112115567A (en) | 2020-12-22 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110401145B (en) | Cable laying method | |
| CN110213107B (en) | Automatic layout method, device and equipment for network topological graph | |
| CN103999390B (en) | Method and system for managing Optical Distribution Network | |
| CN104796193B (en) | Method for quick querying and locating of optical cable link relation | |
| WO2016167453A1 (en) | Metaheuristic method for designing pipe network on basis of water source tracing | |
| CN112612000B (en) | Intelligent configuration platform suitable for rapidly laying UWB positioning system | |
| CN111064505B (en) | Point distribution method of optical fiber testing equipment, storage medium and optical fiber testing system | |
| CN112115567B (en) | Optical fiber minimum consumption path planning method | |
| CN104348691A (en) | Fiber link scheduling method, equipment and system | |
| CN103618974B (en) | A kind of expansion method of optical-fiber network | |
| CN109740789A (en) | Cable management method, apparatus, equipment and storage medium | |
| CN108932565A (en) | A kind of method for searching and system based on network management | |
| CN109558654B (en) | Topology design method for planar tension integral structure | |
| CN114218734B (en) | Optimal path planning and calculating method for cable | |
| CN114545577B (en) | Modularized optical cable assembly and networking topological structure | |
| CN113704935B (en) | Cable channel attribute and association relation extraction method considering three-dimensional modeling randomness | |
| JP2013003876A (en) | Program, device and system for cable lying design in consideration of layable route | |
| US20150261891A1 (en) | System for integrated design of electric plant of an industrial site | |
| CN105656029B (en) | A kind of super radius of electricity supply of low-voltage power supply taiwan area load point determines method and device | |
| CN109547150B (en) | Non-interference point selection method and device for optical switch | |
| CN111798053A (en) | Optical fiber path planning method | |
| CN115146423B (en) | Cable network ring-opening design method | |
| WO2017113977A1 (en) | Configuration method and device for optical multiplexer/demultiplexer | |
| CN113297648B (en) | Optimization method for drawing digital room scheme design drawing | |
| EP4037204A1 (en) | System and method for automated identification of fiber capacity |
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 |