CN110059885A - A kind of optimization method of optical fiber layout path - Google Patents
A kind of optimization method of optical fiber layout path Download PDFInfo
- Publication number
- CN110059885A CN110059885A CN201910327170.3A CN201910327170A CN110059885A CN 110059885 A CN110059885 A CN 110059885A CN 201910327170 A CN201910327170 A CN 201910327170A CN 110059885 A CN110059885 A CN 110059885A
- Authority
- CN
- China
- Prior art keywords
- city
- optical fiber
- fiber
- intermediate node
- optic network
- 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.)
- Granted
Links
- 239000013307 optical fiber Substances 0.000 title claims abstract description 61
- 238000000034 method Methods 0.000 title claims abstract description 15
- 238000005457 optimization Methods 0.000 title claims abstract description 12
- 239000000835 fiber Substances 0.000 claims abstract description 67
- 230000005540 biological transmission Effects 0.000 claims description 20
- 239000011159 matrix material Substances 0.000 claims description 19
- 238000011161 development Methods 0.000 claims description 4
- 239000000463 material Substances 0.000 abstract description 2
- 238000010586 diagram Methods 0.000 description 4
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000004891 communication Methods 0.000 description 1
- 238000012217 deletion Methods 0.000 description 1
- 230000037430 deletion Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
Classifications
-
- G—PHYSICS
- G02—OPTICS
- G02B—OPTICAL ELEMENTS, SYSTEMS OR APPARATUS
- G02B6/00—Light guides; Structural details of arrangements comprising light guides and other optical elements, e.g. couplings
- G02B6/46—Processes or apparatus adapted for installing or repairing optical fibres or optical cables
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
- G06Q10/047—Optimisation of routes or paths, e.g. travelling salesman problem
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
- G06Q50/10—Services
- G06Q50/26—Government or public services
Landscapes
- Business, Economics & Management (AREA)
- Engineering & Computer Science (AREA)
- Human Resources & Organizations (AREA)
- Physics & Mathematics (AREA)
- Tourism & Hospitality (AREA)
- Economics (AREA)
- General Physics & Mathematics (AREA)
- Strategic Management (AREA)
- General Business, Economics & Management (AREA)
- Development Economics (AREA)
- Theoretical Computer Science (AREA)
- Marketing (AREA)
- General Health & Medical Sciences (AREA)
- Primary Health Care (AREA)
- Health & Medical Sciences (AREA)
- Educational Administration (AREA)
- Game Theory and Decision Science (AREA)
- Entrepreneurship & Innovation (AREA)
- Operations Research (AREA)
- Quality & Reliability (AREA)
- Optics & Photonics (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
- Telephonic Communication Services (AREA)
- Optical Communication System (AREA)
Abstract
The invention discloses a kind of optimization methods of optical fiber layout path.This method considers and selects intermediate node city, introduce the weight variable in intermediate node city, objective function is turned to, using the weight variable in intermediate node city as independent variable using the maximum of total fiber costs of entire fiber optic network, non-linear optimizing is carried out, fiber optic network connection topology is adjusted according to optimizing result.The present invention solve existing fiber be laid with plan model it is too simple, have ignored the problems such as material elements in practical application, have devised optical fiber be laid with scheme can more embody network value.
Description
Technical field
The invention belongs to optical fiber laying technology fields.
Background technique
Existing optical fiber, which is laid with scheme, can solve the laying problem of the optical fiber between simple city.For simple city light
Fibre, which is laid with, can be abstracted as graph theoretic problem, can be solved based on minimum spanning tree scheme.But in currently existing scheme only
Simply just consider that connection between each city and expense are minimum, the maximum distance, most without considering optical fiber laying road
The particular problems such as large capacity and intermediate node.And in actual fiber laying, what is more focused on relative to cost is whole
The value of a network entirety, therefore saving cost should not be only pursued in optical fiber laying.
Summary of the invention
In order to solve the technical issues of above-mentioned background technique proposes, the invention proposes a kind of optimizations of optical fiber layout path
Method.
In order to achieve the above technical purposes, the technical solution of the present invention is as follows:
A kind of optimization method of optical fiber layout path, comprising the following steps:
(1) calculate do not consider in the case of intermediate node each plan a city between fiber costs；
(2) according to the layout path quantity M of planning, the fiber costs calculated step (1) are ranked up, and select wherein light
M optical fiber of fine Maximum Value；
(3) it checks whether all to plan a city and is connected into fiber optic network, if there is n city not to be connected into fiber optic network,
Leave out the smallest n optical fiber of fiber costs in the M optical fiber that step (2) obtains, is chosen again from step (2) remaining optical fiber
The maximum n optical fiber of fiber costs fills into, and executes this step repeatedly, until all planning a city is connected into fiber optic network；
(4) the finally obtained fiber optic network connection topology of fixing step (3), considers and selects intermediate node city, introduce
The weight variable in intermediate node city turns to objective function, with the maximum of total fiber costs of entire fiber optic network with middle node
The weight variable in point city is independent variable, carries out non-linear optimizing, adjusts fiber optic network connection topology according to optimizing result.
Further, in step (1), the fiber costs are as follows:
In above formula, N (i, j) is fiber costs of the city i to city j, Pi、PjThe population matrix of city i and city j respectively,
CtotalTo transmit total capacity.
Further, in step (4), the selection rule in intermediate node city is as follows:
If the maximum unicast transmission capacity of optical fiber is R in entire fiber optic networkmax, then RmaxCorresponding maximum transmission distance is
LmaxIf certain L to plan a citymaxThere is no others to plan a city in range, then the city cannot be selected as intermediate node city.
Further, in step (4), the weight variable for introducing intermediate node city is as follows:
If from i, intermediate node city j and terminal city k indicate the optical fiber of city i to city k with h (i, j, k)
For the weight through intermediate node city j, if city i to city k without path, h (i, j, k)=0, and
Wherein, K indicates the sum to plan a city.
Further, in step (4), following Optimized model is established:
Wherein, NV is total fiber costs of entire fiber optic network, R1,...,RNN kind in respectively entire fiber optic network is not
With the path matrix of unicast transmission capacity optical fiber, and Rs(i, j) is matrix RsIn the i-th row jth column element, indicate city i to city
The quantity of s type optical fiber, s=1 ..., N are laid in city j, rank of matrix is sought in rank (*) expression, and num (*) expression asks non-in matrix
Zero number；N ' (i, j) indicates the fiber costs of city i to city j behind introducing intermediate node city,The optical fiber transmission capacity of C (a, b) expression city a to city b.
Further, when considering city's GDP and balanced development, then the Optimized model in step (4) is as follows:
Wherein,GjAnd GkRespectively city j and city k
GDP；D indicates capacity variance per capita, D=var (PCi), var (*) is variance function, PCiFor capacity per capita,
CAiFor the sum of all fiber capacities of city i,
By adopting the above technical scheme bring the utility model has the advantages that
It is laid with that plan model is too simple, has ignored material elements in practical application for existing fiber, the present invention examines
Consider each practical particular problem, creatively introduces intermediate node weight distribution in optical fiber laying, while also contemplating population
Situations such as several and city GPD.It is verified, when intercity connection number is more, i.e., when fiber optic network topology is more complex, using this
Invention not only realizes network value maximization, also helps each intercity balanced development.
Detailed description of the invention
Fig. 1 is overall flow figure of the invention；
Fig. 2 is 12 cities (group) schematic diagram in embodiment；
Fig. 3 is the preliminary network topological diagram in embodiment；
Fig. 4 is the network topological diagram of whole city connections in embodiment.
Specific embodiment
Below with reference to attached drawing, technical solution of the present invention is described in detail.
A kind of optimization method for optical fiber layout path that the present invention designs, as shown in Figure 1, steps are as follows:
Step 1: calculate do not consider in the case of intermediate node each plan a city between fiber costs；
Step 2: according to the layout path quantity M of planning, the fiber costs calculated step 1 are ranked up, select wherein
The maximum M optical fiber of fiber costs；
Step 3: checking whether all to plan a city is connected into fiber optic network, if there is n city not to be connected into fiber optic network,
Then leave out the smallest n optical fiber of fiber costs in the M optical fiber that step 2 obtains, chooses light again from the remaining optical fiber of step 2
N optical fiber of fine Maximum Value fills into, and executes this step repeatedly, until all planning a city is connected into fiber optic network；
Step 4: the finally obtained fiber optic network of fixing step 3 connection topology considers and selects intermediate node city, introduces
The weight variable in intermediate node city turns to objective function, with the maximum of total fiber costs of entire fiber optic network with middle node
The weight variable in point city is independent variable, carries out non-linear optimizing, adjusts fiber optic network connection topology according to optimizing result.
In step 1, Preferable scheme is that, the fiber costs are as follows:
In above formula, N (i, j) is fiber costs of the city i to city j, Pi、PjThe population matrix of city i and city j respectively,
CtotalTo transmit total capacity.
In step 4, Preferable scheme is that, the selection rule in intermediate node city is as follows:
If the maximum unicast transmission capacity of optical fiber is R in entire fiber optic networkmax, then RmaxCorresponding maximum transmission distance is
LmaxIf certain L to plan a citymaxThere is no others to plan a city in range, then the city cannot be selected as intermediate node city.
In step 4, Preferable scheme is that, the weight variable for introducing intermediate node city is as follows:
If from i, intermediate node city j and terminal city k indicate the optical fiber of city i to city k with h (i, j, k)
For the weight through intermediate node city j, if city i to city k without path, h (i, j, k)=0, and
Wherein, K indicates the sum to plan a city.
In step 4, Preferable scheme is that, following Optimized model is established:
Wherein, NV is total fiber costs of entire fiber optic network, R1,...,RNN kind in respectively entire fiber optic network is not
With the path matrix of unicast transmission capacity optical fiber, and Rs(i, j) is matrix RsIn the i-th row jth column element, indicate city i to city
The quantity of s type optical fiber, s=1 ..., N are laid in city j, rank of matrix is sought in rank (*) expression, and num (*) expression asks non-in matrix
Zero number；N ' (i, j) indicates the fiber costs of city i to city j behind introducing intermediate node city,The optical fiber transmission capacity of C (a, b) expression city a to city b.
In constraint condition, h (i, j, k) C (i, j)=h (k, j, i) C (k, j)≤min (C (i, j), C (k, j)) table
Show, for intermediate node city j, the capacity of the distribution of road i → j and j → k should be equal, and is less than present road maximum and holds
Limit.rank(R1+...+RN)=K indicates that the matrix that N number of optical fiber path matrix is added should be full rank, that is, guarantees that each city can
Access network order.num(R1)+...+num(RN)=M indicates that the sum of the non-zero number of N number of optical fiber path matrix should be and need to spread in total
If road quantity M.
Consider that connection developed regions can bring more incomes from operator's angle, therefore considers GDP to the shadow of fiber costs
It rings, then the fiber costs modification in above-mentioned model are as follows:
Wherein, GjAnd GkThe respectively GDP of city j and city k.
From the angle of national whole balanced development, optical fiber paving cannot be just reduced because of the remote economics of underdevelopment of some regions
If therefore the equilibrium that introducing optical fiber is laid with, then the objective function modification in above-mentioned model are as follows:
Wherein, D indicates capacity variance per capita, D=var (PCi), var (*) is variance function, PCiFor capacity per capita,CAiFor the sum of all fiber capacities of city i,D is used to measure the communication imbalance degree of Current protocols, and D is got over
Greatly, then more unbalanced.
Hereafter by taking 12 cities (group) as an example, the present invention will be described.
As shown in Fig. 2, 12 cities (group) is respectively Urumchi, Ha Erbing, Beijing Tianjin, Shanghai, Zhengzhou, Wuhan, again
Celebrating, Chengdu, Xi'an, Shenzhen &, Guangzhou, Kunming and Lhasa.The present embodiment uses the optical fiber of three kinds of unicast transmission capacities, the paving of planning
If number of paths is 16, three kinds of optical fiber are as shown in table 1, and calculated fiber costs are as shown in table 2.
Table 1
| Unicast transmission capacity | Maximum transmission distance | Total capacity |
| 100Gb/s | 3000km | 8Tb/s |
| 200Gb/s | 1200km | 16Tb/s |
| 400Gb/s | 600km | 32Tb/s |
Table 2
12 cities (group) network topology then tentatively obtained is as shown in Figure 3.From the figure 3, it may be seen that be not connected there are four city,
In view of all cities must all connect, the smallest 4 deletions of fiber costs in the path matrix searched for, for connecting
It is not connected the city of network access network, until whole cities are connected network access network.The net of whole cities connection as shown in Figure 4 can be obtained
Network topological diagram.In Fig. 3,4, chain-dotted line indicates the transmission of the first type optical fiber, i.e. unicast transmission capacity is 100GB/s, pure dotted line table
Show that the second type optical fiber transmits, i.e., unicast transmission capacity is 200GB/s, and solid line indicates that the transmission of third type optical fiber, i.e. unicast transmission are held
Amount is 400GB/s.
Screened according to the mode that intermediate node is chosen, can be by Urumchi, Lhasa, Harbin, Kunming, Guangzhou this
Several cities exclude.And Chengdu, Chongqing, Wuhan, the city that range class is screened in these cities of Zhengzhou is most, therefore intermediate node
It can be chosen in these cities.Then weight variable h is adjusted according to selected intermediate node city, is obtained final
As a result.
Embodiment is merely illustrative of the invention's technical idea, and this does not limit the scope of protection of the present invention, it is all according to
Technical idea proposed by the present invention, any changes made on the basis of the technical scheme are fallen within the scope of the present invention.
Claims (6)
1. a kind of optimization method of optical fiber layout path, which comprises the following steps:
(1) calculate do not consider in the case of intermediate node each plan a city between fiber costs；
(2) according to the layout path quantity M of planning, the fiber costs calculated step (1) are ranked up, and select wherein optical fiber valence
It is worth maximum M optical fiber；
(3) it checks whether all to plan a city and is connected into fiber optic network, if there is n city not to be connected into fiber optic network, leave out
The smallest n optical fiber of fiber costs in the M optical fiber that step (2) obtains chooses optical fiber from step (2) remaining optical fiber again
N optical fiber of Maximum Value fills into, and executes this step repeatedly, until all planning a city is connected into fiber optic network；
(4) the finally obtained fiber optic network connection topology of fixing step (3), considers and selects intermediate node city, introduces intermediate
The weight variable of node city turns to objective function, with the maximum of total fiber costs of entire fiber optic network with intermediate node city
The weight variable in city is independent variable, carries out non-linear optimizing, adjusts fiber optic network connection topology according to optimizing result.
2. the optimization method of optical fiber layout path according to claim 1, which is characterized in that in step (1), the optical fiber
It is worth as follows:
In above formula, N (i, j) is fiber costs of the city i to city j, Pi、PjThe population matrix of city i and city j respectively, Ctotal
To transmit total capacity.
3. the optimization method of optical fiber layout path according to claim 1, which is characterized in that in step (4), intermediate node
The selection rule in city is as follows:
If the maximum unicast transmission capacity of optical fiber is R in entire fiber optic networkmax, then RmaxCorresponding maximum transmission distance is Lmax,
If certain L to plan a citymaxThere is no others to plan a city in range, then the city cannot be selected as intermediate node city.
4. the optimization method of optical fiber layout path according to claim 1, which is characterized in that in step (4), introduce intermediate
The weight variable of node city is as follows:
If from i, intermediate node city j and terminal city k, with h (i, j, k) indicate city i to city k optical fiber for
Weight through intermediate node city j, if city i to city k without path, h (i, j, k)=0, andWherein,
K indicates the sum to plan a city.
5. the optimization method of optical fiber layout path according to claim 4, which is characterized in that in step (4), establish as follows
Optimized model:
Wherein, NV is total fiber costs of entire fiber optic network, R1,...,RNN kind in respectively entire fiber optic network is different single
The path matrix of wave transmission capacity optical fiber, and Rs(i, j) is matrix RsIn the i-th row jth column element, indicate city i to city j
Rank of matrix is sought in the middle quantity for being laid with s type optical fiber, s=1 ..., N, rank (*) expression, and num (*) indicates to seek the non-zero in matrix
Number；N ' (i, j) indicates the fiber costs of city i to city j behind introducing intermediate node city,The optical fiber transmission capacity of C (a, b) expression city a to city b.
6. the optimization method of optical fiber layout path according to claim 5, which is characterized in that when consideration city's GDP and equilibrium
Development, then the Optimized model in step (4) is as follows:
Wherein,GjAnd GkRespectively city j's and city k
GDP；D indicates capacity variance per capita, D=var (PCi), var (*) is variance function, PCiFor capacity per capita,CAi
For the sum of all fiber capacities of city i,
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910327170.3A CN110059885B (en) | 2019-04-23 | 2019-04-23 | Optimization method of optical fiber laying path |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910327170.3A CN110059885B (en) | 2019-04-23 | 2019-04-23 | Optimization method of optical fiber laying path |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110059885A true CN110059885A (en) | 2019-07-26 |
| CN110059885B CN110059885B (en) | 2022-01-14 |
Family
ID=67320138
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910327170.3A Active CN110059885B (en) | 2019-04-23 | 2019-04-23 | Optimization method of optical fiber laying path |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110059885B (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110646905A (en) * | 2019-09-19 | 2020-01-03 | 烽火通信科技股份有限公司 | Method and system for calculating fiber running distance between ODF frames |
| CN116166829A (en) * | 2023-03-20 | 2023-05-26 | 上海信辉科技有限公司 | Automatic pipeline path building system based on graph database |
| CN116338950A (en) * | 2023-04-04 | 2023-06-27 | 深圳市比洋光通信科技股份有限公司 | Optical fiber path arrangement method and system based on OXC all-optical backboard |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105007223A (en) * | 2015-07-16 | 2015-10-28 | 南京邮电大学 | Optical network dynamic multicast routing wavelength allocation method based on optical hierarchical structure |
| CN105225004A (en) * | 2015-09-29 | 2016-01-06 | 中铁第一勘察设计院集团有限公司 | The construction method of group of cities inter-city passenger rail gauze |
| CN105841709A (en) * | 2016-03-22 | 2016-08-10 | 吉林大学 | Method for planning car driving path |
| CN106355268A (en) * | 2016-08-22 | 2017-01-25 | 中交天津港航勘察设计研究院有限公司 | Optimization method for urban industrial structure based on environmental carrying capacity |
| CN106951619A (en) * | 2017-03-13 | 2017-07-14 | 西安交通大学 | Meter and the marine wind electric field topology design method of reliability constraint |
| CN107483239A (en) * | 2017-08-07 | 2017-12-15 | 深圳供电规划设计院有限公司 | A kind of electric power communication transmission network reliability determines method |
-
2019
- 2019-04-23 CN CN201910327170.3A patent/CN110059885B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105007223A (en) * | 2015-07-16 | 2015-10-28 | 南京邮电大学 | Optical network dynamic multicast routing wavelength allocation method based on optical hierarchical structure |
| CN105225004A (en) * | 2015-09-29 | 2016-01-06 | 中铁第一勘察设计院集团有限公司 | The construction method of group of cities inter-city passenger rail gauze |
| CN105841709A (en) * | 2016-03-22 | 2016-08-10 | 吉林大学 | Method for planning car driving path |
| CN106355268A (en) * | 2016-08-22 | 2017-01-25 | 中交天津港航勘察设计研究院有限公司 | Optimization method for urban industrial structure based on environmental carrying capacity |
| CN106951619A (en) * | 2017-03-13 | 2017-07-14 | 西安交通大学 | Meter and the marine wind electric field topology design method of reliability constraint |
| CN107483239A (en) * | 2017-08-07 | 2017-12-15 | 深圳供电规划设计院有限公司 | A kind of electric power communication transmission network reliability determines method |
Non-Patent Citations (2)
| Title |
|---|
| 你你你尼YEAR: "第十五届"华为杯"中国研究生数学建模竞题—B题", 《百度文库》 * |
| 王磊: "基于最小生成树算法的配电网络重构", 《陕西电力》 * |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110646905A (en) * | 2019-09-19 | 2020-01-03 | 烽火通信科技股份有限公司 | Method and system for calculating fiber running distance between ODF frames |
| CN116166829A (en) * | 2023-03-20 | 2023-05-26 | 上海信辉科技有限公司 | Automatic pipeline path building system based on graph database |
| CN116166829B (en) * | 2023-03-20 | 2023-10-03 | 上海信辉科技有限公司 | Automatic pipeline path building system based on graph database |
| CN116338950A (en) * | 2023-04-04 | 2023-06-27 | 深圳市比洋光通信科技股份有限公司 | Optical fiber path arrangement method and system based on OXC all-optical backboard |
| CN116338950B (en) * | 2023-04-04 | 2024-01-30 | 深圳市比洋光通信科技股份有限公司 | Optical fiber path arrangement method and system based on OXC all-optical backboard |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110059885B (en) | 2022-01-14 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110059885A (en) | A kind of optimization method of optical fiber layout path | |
| CN107579518B (en) | Power system environment economic load dispatching method and apparatus based on MHBA | |
| CN110334391A (en) | A kind of various dimensions constraint wind power plant collection electric line automatic planning | |
| CN103001219B (en) | A kind of more FACTS based on trend entropy optimize control method for coordinating | |
| CN110717226A (en) | Regional comprehensive energy system layout planning method considering energy network topological characteristics | |
| CN105938505B (en) | A kind of method for arranging of water supply network pressure detecting point | |
| CN101216982A (en) | A 2D relay-type automatic route meter reading method and carrier route dynamic maintenance method | |
| CN105976048A (en) | Power transmission network extension planning method based on improved artificial bee colony algorithm | |
| CN102970163B (en) | Power communication backbone network node upgrade method and system | |
| CN110380450A (en) | Photovoltaic control method, device, equipment and computer readable storage medium | |
| CN108769843A (en) | A kind of EPON network optimized approach that power optical fiber is registered one's residence and system | |
| CN109378819A (en) | The power system voltage partition method and system verified based on spectral clustering and modularity | |
| CN115528682A (en) | Optimized regulation and control method considering loss characteristics of key equipment of flexible interconnected power distribution network | |
| CN103279661A (en) | Substation capacity optimal configuration method based on mixed quantum evolutionary algorithm | |
| CN109995059A (en) | Low-voltage distribution system three-phase load based on genetic algorithm optimizes balanced arrangement method | |
| CN111224398A (en) | Loss reduction planning method and device for power distribution network with distributed power supply | |
| CN109980650A (en) | A kind of radial pattern distribution system tidal current computing method | |
| CN108493908B (en) | A kind of locality protection partition method considering communication constraint | |
| CN102709955A (en) | Multi-section-based power flow control method | |
| CN109449994A (en) | A kind of power regulation method of the active distribution network of the device containing flexible interconnection | |
| CN111834996B (en) | Power grid line loss calculation method and device | |
| CN106054665B (en) | A kind of large-scale photovoltaic inverter system divides group's equivalent modeling method | |
| CN117039882A (en) | Resource aggregation regulation and control method and system based on binary consistency algorithm | |
| CN113224770B (en) | Power grid reactive power partitioning method integrating electrical distance and edge betweenness | |
| CN105470976A (en) | Coordinated configuration method for SVC and TCSC under steady state condition |
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 |