CN105871724A

CN105871724A - Method and system for optimizing power communication network circuit

Info

Publication number: CN105871724A
Application number: CN201610166338.3A
Authority: CN
Inventors: 王敏; 孙颖; 王浩; 毕云阶; 蔡继涛; 王萍修; 陈永涛
Original assignee: Guangzhou Power Supply Bureau Co Ltd
Current assignee: Guangzhou Power Supply Bureau of Guangdong Power Grid Co Ltd
Priority date: 2016-03-21
Filing date: 2016-03-21
Publication date: 2016-08-17
Anticipated expiration: 2036-03-21
Also published as: CN105871724B

Abstract

The invention relates to a method and a system for optimizing a power communication network circuit. The method comprises the following steps: constructing a cost function of a to-be-selected power communication network circuit planning scheme and calculating a ring formation rate; establishing a fitness function according to the cost function and the ring formation rate; employing a particle swarm optimization to obtain a global optimal position which meets preset constraint conditions and whose fitness is the smallest in all particles; obtaining an optimal solution of circuit selection parameters; and taking the circuit corresponding to the optimal solution as an optimal circuit of the power communication network circuit planning. The preset constraint conditions include the circuit selected correspondingly via a position and the established circuit form a connected graph, the ring formation rate of nodes in the connected graph formed by the circuit selected correspondingly via the position and the established circuit is greater than or equal to a preset threshold value, and the circuit selected correspondingly via the position meets service distribution constraints, so that the circuit selection parameters corresponding to the global optimal position are optimal; and through constructing the circuit selected correspondingly via the optimal circuit selection parameters, while the reliability of the power communication network circuit is improved, the cost is reduced.

Description

Power telecom network line optimization method and system

Technical field

The present invention relates to network optimisation techniques, particularly relate to a kind of power telecom network line optimization method and be System.

Background technology

Power telecom network line optimization refers on the basis of known node position and service distribution, according to existing Network structure, under conditions of meeting service distribution and reliability constraint, determines the communication that economy is optimal Circuit deployment scheme.Along with the expanding day of electrical network scale, the optimization problem of power telecom network circuit also becomes Become increasingly complex.Therefore, for the further investigation of power telecom network line optimization not only to China's power system Good operation, more society is stablized and development that national economy is quick, healthy suffers from actively making With.The existing power telecom network line optimization method only economy of prioritization scheme from the point of view of single Or reliability, and economy, reliably this two big index can not be taken into account so as to get prioritization scheme has unilateral simultaneously Property.Thus, building most reliable communication network such as how minimum cost becomes the pass that power telecom network optimizes One of key problem.

Currently for the more existing researchs of power telecom network optimization problem, a class is to take out the warp of communication line Ji property model, uses this model and utilizes intelligent optimization algorithm to solve problem, it is achieved that line construction Minimizing of cost, but it does not all account for reliability constraint, the cyclization rate causing communication node is not enough, Causing network when breaking down, affected business cannot be recovered in time.Another kind of is by network Add communication node and cause resource redundancy, ensure the redundancy ability of network with this, improve network reliability, But increase redundant node and can be greatly improved the construction cost of network, do not simply fail to ensure the economy of networking Property, also can cause the unnecessary wasting of resources.Additionally, due to the heterogeneity of communication service distribution, cause Portfolio is concentrated in some node, now should ensure that and has communication line direct-connected between these nodes, thus reduces The jumping figure of business route.

At present, in order to realize communication network lines optimization, frequently with method have distribution line detection and power supply Layouting method for arranging, the method, with County Power Plant as plan objects, calculates circuit by electric network model and is good for Kang Du also divides diverting route.I.e. utilize current electric network model, by the calculating of load moment, to health degree The best circuit carries out load shunting, to electric power under the fewest change and under Best Economy design Circuit designs or transforms old circuit.But the method is inefficient.It addition, frequently with method There is the mapping method of virtual network of node link pressure weight adaptive equalization, relate to virtual network mapping problems, Mainly completed by three steps, the first step, it is proposed that the virtual network of node link pressure adaptive equilibrium maps Target, this target can realize making overall plans and coordinate of node optimization and link optimizing, thus it is excellent to reach overall situation pressure The effect changed.Second step, is designed the adjustable parameter in object function, it is proposed that a kind of adaptive Parameter prediction pattern, makes weight parameter gradually optimize tune according to network state change and self two factor of evolution Whole.3rd step, in order to ensure the stability of this self adaptation adjustable parameter, it is proposed that a kind of to adjustable parameter receipts Holding back the mechanism that direction carries out judging, this mechanism can be stopped on span border by statistical weight parameter Time judges whether system enters divergent state, and uses corresponding strategy to make system again recover equilibrium, adopts Carry out distribution and the scheduling of peak optimizating network resource by the method, improve safety and service quality, reduction operation Maintenance cost, solves the Internet existing ossify, with patch with to be updated to main development existing in the hope of essence Shape.But the program is difficulty with the coordination between multiple virtual subnet.

Summary of the invention

Based on this, it is necessary to be difficult to effectively realize not only economy but also reliable problem for existing optimization method, carry For one not only economy but also reliable power telecom network line optimization method and system.

A kind of power telecom network line optimization method, comprises the steps:

Initialize the circuit to be selected of power telecom network circuit；

According to described routing line to be selected, route choosing parameter and the cost presetting construction single line, build The cost function of circuit communication netting twine circuit planning scheme to be selected also calculates the cyclization rate of correspondence, wherein, and described line Road Selection parameter is 1 or 0, when described in time selecting circuit to be selected, and the described route choosing parameter of its correspondence Being 1, otherwise, the described route choosing parameter of its correspondence is 0；

Using described power telecom network layout of roads scheme to be selected as the particle in described particle cluster algorithm, by institute State power telecom network layout of roads scheme to be selected to be calculated as described population by described route choosing parameter characterization The position of particle in method, according to described cost function and described cyclization rate, builds in particle cluster algorithm required Fitness function；

According to described fitness function, utilize described particle cluster algorithm to obtain in all particles and meet default constraint Condition and the global optimum position of fitness minimum；Wherein, described default constraints includes position correspondence choosing The circuit taken and the railway superstructures connected graph set up, the corresponding circuit chosen in position and the circuit structure set up The cyclization rate of the described connected graph interior joint become is chosen more than or equal to described predetermined threshold value and position correspondence Circuit meets service distribution constraint；

According to described global optimum position, obtain the described of corresponding power telecom network layout of roads scheme to be selected The optimal solution of route choosing parameter, circuit optimal solution correspondence chosen is that power telecom network layout of roads is optimum Circuit.

The present invention also provides for a kind of power telecom network line optimization system, including:

Route initialization module to be selected, for initializing the circuit to be selected of power telecom network circuit；

Cost builds module, for single according to described routing line to be selected, route choosing parameter and default construction The cost of bar circuit, builds the cost function of circuit communication netting twine circuit planning scheme to be selected and calculates the one-tenth of correspondence Ring rate, wherein, described route choosing parameter is 1 or 0, and when described in time selecting circuit to be selected, it is corresponding Described route choosing parameter be 1, otherwise, the described route choosing parameter of its correspondence is 0；

Fitness function builds module, is used for described power telecom network layout of roads scheme to be selected as described Particle in particle cluster algorithm, by described power telecom network layout of roads scheme to be selected by described route choosing Parameter characterization is as the position of particle in described particle cluster algorithm, according to described cost function and described cyclization Rate, builds fitness function required in particle cluster algorithm；

Optimize module, for according to described fitness function, utilize described particle cluster algorithm to obtain all particles In meet and preset the global optimum position that constraints and fitness are minimum；Wherein, described default constraints The circuit chosen including position correspondence and the railway superstructures connected graph set up, the corresponding circuit chosen in position with The cyclization rate of the described connected graph interior joint of the railway superstructures set up more than or equal to described predetermined threshold value and The circuit that position correspondence is chosen meets service distribution constraint；

Determine module, for according to described global optimum position, obtain corresponding power telecom network circuit to be selected The optimal solution of the described route choosing parameter of programme, circuit optimal solution correspondence chosen is power communication Netting twine circuit planning optimal route.

Above-mentioned power telecom network line optimization method and system, first initialize power telecom network circuit to be optimized Circuit to be selected, according to routing line to be selected, route choosing parameter and build single line cost, structure Build the cost function of power telecom network layout of roads scheme to be selected and calculate cyclization rate, according to cost function and Cyclization rate, sets up fitness function, according to fitness function, utilizes particle cluster algorithm to obtain in all particles Meet the global optimum position of the fitness minimum presetting constraints, according to global optimum position, obtain line The optimal solution of road Selection parameter, circuit optimal solution correspondence chosen is power telecom network layout of roads optimum line Road, it is achieved power telecom network line optimization.Default constraints includes that circuit that position correspondence chooses is with built The circuit that vertical railway superstructures connected graph, position correspondence are chosen saves in the connected graph of the railway superstructures set up The cyclization rate of point meets service distribution constraint more than or equal to the circuit that predetermined threshold value and position correspondence are chosen, The global optimum position obtained is to meet above-mentioned default constraints, thus the circuit that global optimum position is corresponding Selection parameter is optimum, and the circuit of optimal route Selection parameter corresponding selection is carried out network line construction, Can improve the reliability of power telecom network circuit, the global optimum position utilizing particle cluster algorithm to obtain is not only full Foot fitness is minimum, but also considers network reliability and service distribution situation, and fitness size is and becomes This correspondence, i.e. by global optimum's position acquisition line parameter circuit value optimal solution, and according to optimal solution corresponding selection When circuit carries out power telecom network line optimization, while meeting the constraint of network reliability and service distribution, Network optimization cost minimization.

Accompanying drawing explanation

Fig. 1 is the flow chart of the power telecom network line optimization method of an embodiment；

Fig. 2 be another embodiment power telecom network line optimization method in the sub-process figure of step S400；

Fig. 3 be another embodiment power telecom network line optimization method in the sub-process figure of step S430；

Fig. 4 is electrically-based communication net node system construction drawing；

Fig. 5 be the predetermined threshold value of cyclization rate be the network optimization result figure under 0.6 constraints；

Fig. 6 be the predetermined threshold value of cyclization rate be the network optimization result figure under 0.7 constraints；

Fig. 7 be the predetermined threshold value of cyclization rate be the network optimization result figure under 0.9 constraints；

Fig. 8 is that the predetermined threshold value of cyclization rate is 0.6 and there is the constraints of line between node 4 and node 5 Under network optimization result figure；

Fig. 9 is the module map of the power telecom network line optimization system of an embodiment；

Figure 10 be another embodiment power telecom network line optimization system in optimize module 400 submodule Figure；

Figure 11 be another embodiment power telecom network line optimization system in the first son determining unit 430 Module map.

Detailed description of the invention

Refer to Fig. 1, it is provided that a kind of power telecom network line optimization method of embodiment, comprise the steps:

S100: initialize the circuit to be selected of power telecom network circuit.

Power telecom network line optimization refers to select more excellent circuit on the basis of existing power communication web frame Carry out network extension, i.e. power telecom network circuit and there may be the circuit set up, these circuits set up Cost no longer line optimization time cost limit of consideration.When carrying out construction network, whole power telecom network The compound mode of the circuit between interior joint has multiple, at the beginning of needing to carry out the optional circuit in power telecom network Beginningization, it is thus achieved that circuit to be selected, when follow-up conducting transmission line optimizes, from circuit to be selected, access line is entered Row enlarging.In order to realize line optimization problem, introduce the concept of figure, the top of power telecom network interior joint figure Point represents, circuit limit represents, line optimization problem can be conceptualized as from figure in n bar circuit to be selected Determine that k bar circuit makes it constitute not only economy but also reliable network structure.

S200: according to routing line to be selected, route choosing parameter and the cost presetting construction single line, structure Build the cost function of power telecom network layout of roads scheme to be selected and calculate the cyclization rate of correspondence.

Wherein, route choosing parameter is 1 or 0, when being selected until selection circuit, and the route choosing of its correspondence Parameter is 1, and otherwise, the route choosing parameter of its correspondence is 0.The corresponding single circuit choosing of wall scroll circuit to be selected Selecting parameter, i.e. every circuit to be selected all correspondence has circuit Selection parameter, when certain circuit to be selected is corresponding When route choosing parameter is 1, this routing to be selected is selected.In circuit to be selected, access line is carried out During construction, corresponding construction cost can be produced, before construction cost function, need to obtain every and wait to select The construction cost of circuit, the construction cost of every circuit to be selected can pass through power telecom network layout of roads personnel Assessment to circuit obtains, or can calculate acquisition according to the length of circuit and practical situation.At network line During planning, it is known that there is substantial amounts of business between node a and node b, in order to ensure logical between two nodes Letter, in time delay allowed band, needs to arrange service distribution constraint, i.e. conducting transmission line and can consider when optimizing A direct-connected optical cable, the line being directly connected between node a and node b is built between node a and node b Road is single line, i.e. limit between node a and node b exists, and when extending, needs to consider to be somebody's turn to do The cost of single line, in the present embodiment, the cost that network line is built only with in existing power communication The cost of the circuit newly increased on the basis of netting twine road is relevant, the circuit existed with existing powerline network Unrelated and unrelated with two nodes itself.The circuit not being selected in circuit to be selected is equivalent to this circuit Limit between two end nodes does not exists, then do not take into account that the cost of this circuit.Each power communication netting twine to be selected Circuit planning scheme has cost and the cyclization rate of correspondence, thus, can be according to circuit to be selected, route choosing The cost of parameter and construction single line can set up power communication netting twine to be selected during power telecom network line optimization The cost function of circuit planning scheme also calculates the cyclization rate of correspondence.

S300: using power telecom network layout of roads scheme to be selected as the particle in particle cluster algorithm, by be selected Power telecom network layout of roads scheme passes through route choosing parameter characterization as the position of particle in particle cluster algorithm Put, according to cost function and cyclization rate, build fitness function required in particle cluster algorithm.

Particle cluster algorithm (Particle Swarm Optimization, PSO) comes from and grinds flock of birds foraging behavior Studying carefully, bevy is at random search food, and only one piece of food in this region, all of bird is not all known Food where, but they know that current position is the most how far from food.So find the simplest of food Single is exactly effectively the peripheral region searching the bird nearest present off food.PSO algorithm is just from this biological species Group's behavioral trait gains enlightenment and for solving-optimizing problem.In PSO algorithm, each optimization problem Potential solution can be imagined as a point on D dimension search volume, we term it " particle " (Particle), Each particle has an adaptive value determined by object function (Fitness Value), i.e. fitness, each grain Son also have speed to determine direction that they circle in the air and distance, then particles just follow current optimum grain Son is searched in solution space.Bird only follows the trail of the neighbours of its limited quantity but final whole result is whole Flock of birds is again under the control at a center, and i.e. complicated global behavior is to be drawn by the interaction of simple rule Rise.PSO algorithm is exactly the process simulating bevy search of food, and each bird is exactly the particle in PSO, Namely we need may solving of Solve problems, and these birds, during search of food, can not stop to change The Position And Velocity oneself aloft flown, does not the most stop to change the Position And Velocity of particle, until finding particle Optimal location, thus find the optimal solution needing Solve problems.Owing to flock of birds can be suddenly during diverting one's attention Changing direction, scatter or assemble, its behavior is unpredictable, but its entirety always keeps concordance, and individual and Remain the distance of signal between individuality, this behavior embodies a kind of existence with the information in biocenose altogether Enjoy mechanism, provide a kind of advantage for Jinhua of colony, particle cluster algorithm make individual and individual, individual with Between colony can mutual experience for reference, thus promote the development of whole colony.Particle cluster algorithm is according to individual Between cooperation with competition by the evaluation to ideal adaptation degree, it is achieved the search of optimal solution in complex space.

Cyclization rate refers to the ratio of effective cyclization nodes and total number of nodes, and cyclization node refers to lead at electric power The node in the loop being connected by circuit in letter net and formed, cyclization rate represents shielded chain in power telecom network The number of the quantity of road and node, shielded link and number of nodes are the most, and the reliability of network is the highest, Therefore, embody the reliability of network with cyclization rate, by changing the size of predetermined threshold value, cyclization can be changed Rate retrains.

Using power telecom network layout of roads scheme to be selected as the particle in particle cluster algorithm, electric power to be selected is led to Letter netting twine circuit planning scheme by route choosing parameter characterization as the position of particle in particle cluster algorithm, will Power telecom network layout of roads scheme to be selected is as the particle in particle cluster algorithm, by power communication netting twine to be selected The circuit Selecting All Parameters of circuit planning scheme is as the position of particle, and particle is equivalent to power telecom network circuit to be selected By the occurrence of circuit Selecting All Parameters, programme, owing to understanding whether circuit is chosen, say, that The position of particle can represent the circuit chosen.Power telecom network layout of roads scheme to be selected is i.e. from line to be selected Choosing routing in road to plan, the circuit that different programmes is chosen is different, chooses due to circuit and uses line Road Selection parameter characterizes, thus, the routing chosen is different, and route choosing parameter corresponding to circuit to be selected is not With, the process of power telecom network line optimization is i.e. the optimal solution process finding route choosing parameter.Such as, Initially there are 10 routing lines to be selected, have 20 particles, corresponding 20 kinds of power telecom network programmes to be selected, When initializing one of them particle, it is i.e. to initialize a kind of programme initially to choose the route i.e. position of particle And renewal speed, such as, the position of particle is (1,0,1,1,1,0,0,1,0,1), wherein Including 10 parameter values, i.e. represent the circuit Selecting All Parameters that 10 routing lines to be selected are corresponding, be 1 when being selected, It is otherwise 0, the circuit of the 1st, 3,4,5,8 and 10 bars of routing lines to be selected of positional representation of above-mentioned particle Selection parameter is 1, represents and is selected, and All other routes are unselected.When being updated, the position of particle Become (1,0,0,1,1,0,1,1,0,1), the route choosing parameter of the 3rd article of circuit to be selected by 1 becomes 0, i.e. Article 3 circuit to be selected does not selects, and the route choosing parameter of the 7th article of circuit to be selected is become by 0 It is 1, i.e. have chosen the 7th bar of routing line to be selected.The optimal solution process finding route choosing parameter is i.e. to particle The continuous renewal process in position, be i.e. that route choosing parameter is constantly updated process, until finding the overall situation Excellent position, i.e. finds the circuit that in all power telecom network layout of roads schemes to be selected, global optimum position is corresponding Selection parameter, carries out line construction, it is achieved the optimization of power telecom network circuit.

Fitness function is relevant to cost function and cyclization rate, is utilizing particle cluster algorithm according to fitness When being optimized, it is contemplated that line construction cost and cyclization rate size, obtain at later use particle cluster algorithm Optimal solution ensure that power communication line reliability while make construction cost minimum.

S400: according to fitness function, utilizes particle cluster algorithm to obtain in all particles and meets default constraint bar The fitness minimum of part and global optimum position.

Wherein, default constraints include the circuit that position correspondence chooses and the railway superstructures connected graph set up, The circuit that position correspondence is chosen is more than or equal to the cyclization rate of the connected graph interior joint of the railway superstructures set up The circuit that predetermined threshold value and position correspondence are chosen meets service distribution constraint.In reliability and service distribution In the case of constraint, it is considered to power telecom network line optimization cost minimization, thus available power communication netting twine The mathematical model that road optimizes is:

G is power telecom network line optimization topological diagram, and R is cyclization rate,For the predetermined threshold value of cyclization rate, (a, b) is the limit between node a and node b to e, and G is the network topology that this constraint of connected graph ensures after optimizing It is a connected graph, it is possible to achieve TOCOM total communication,Constraint guarantee the cyclization rate of network, so that it is guaranteed that The reliability of network, can be by changingCarry out the constraint of concept transfer cyclization rate, it is achieved different business demands, (a, b) there is this constraint is service distribution constraint to e, further ensures that network reliability.Carrying out power communication During net line optimization, need to consider cost, thus, according to cost function, set up cost optimization object function, I.e. set up the mathematical model of power telecom network line optimization, the optimization problem of cost optimization object function is i.e. asked Solution is to cost minimization problem.In addition to considering cost, for guaranteeing the reliability of layout of roads, also need electricity The reliability of power communication network and service distribution constraint, i.e. meet network reliability and service distribution constraint Under the conditions of, the network planning scheme that alternative costs are minimum, it is achieved power telecom network line optimization purpose.To become Ring rate embodies the reliability of network, by changing the size of predetermined threshold value, can change the constraint of cyclization rate, In the present embodiment, by arranging cyclization rate more than or equal to this default constraints of predetermined threshold value, it can be ensured that The reliability of network.It addition, for the reliability improving power telecom network layout of roads further, add industry Business distribution constraint, has a large number of services the most between the two nodes, for reducing time delay and the communication resource taken, Need to arrange direct-connected circuit between the two nodes, i.e. limit between the two node exists, to improve net The reliability on road, such as, has a large number of services between node a and node b, in order to ensure reliability transmission, Needing the service distribution constraints met is that (a, b) exists the limit e between node a and node b, i.e. node a Line direct with node b.

Wherein, fitness function is used to weigh the standard of particle homographic solution quality, above-mentioned with optimization problem Mathematical model is closely related, when utilizing particle cluster algorithm that above-mentioned mathematical model is solved optimal solution, is i.e. to solve for The optimal solution of route choosing parameter.If mathematical model needs to solve maximum, then fitness is the biggest, gained Xie Yue is excellent, if mathematical model needs to solve minima, then fitness is the least, the Xie Yuehao of gained.In this reality Execute in example, the most reliable but also economical during in order to make power telecom network line optimization, when making optimization reliably and circuit is built It is set as this least, meets default constraints and the global optimum of fitness minimum by PSO Algorithm Position, thus the optimal solution of route choosing parameter can be obtained.

S500: according to global optimum position, obtain the line of corresponding power telecom network layout of roads scheme to be selected The optimal solution of road Selection parameter, circuit optimal solution correspondence chosen is power telecom network layout of roads optimum line Road.

The optimal solution correspondence fitness of route choosing parameter is minimum, meets net during powerline network line optimization Under conditions of network reliability and service distribution constraint, the route choosing of power telecom network line construction Optimum cost, On the other hand, fitness function is set up according to cost function and cyclization rate, and cost function is according to treating Selecting route to set up with route choosing parameter and the default cost building single line, the circuit chosen is corresponding Cost consideration, cost corresponding to the circuit do not chosen is without considering, i.e. cost function is to lead to electric power During letter net line optimization, the circuit chosen and construction cost corresponding to circuit are relevant, thus, fitness big The little circuit being and choose is relevant, and the circuit chosen is the most excellent, then fitness is the least, utilizes particle by above-mentioned The electric power to be selected that the global optimum position of the satisfied default constraints of group's algorithm acquisition and fitness minimum is corresponding leads to The circuit of letter netting twine circuit planning scheme selection is optimal route, can be corresponding according to global optimum's position acquisition The optimal solution of the route choosing parameter of power telecom network layout of roads scheme to be selected, chooses optimal solution correspondence The optimal route that circuit is planned as power telecom network, it is achieved power telecom network line optimization.

Above-mentioned power telecom network line optimization method, first initializes the to be selected of power telecom network circuit to be optimized Select circuit, according to routing line to be selected, route choosing parameter and the cost building single line, build to be selected The cost function of power telecom network layout of roads scheme also calculates cyclization rate, according to cost function and cyclization rate, Set up fitness function, according to fitness function, utilize particle cluster algorithm to obtain satisfied in all particles presetting The global optimum position that the fitness of constraints is minimum, according to global optimum position, obtains route choosing ginseng The optimal solution of number, circuit optimal solution correspondence chosen is power telecom network layout of roads optimal route, it is achieved Power telecom network line optimization.Default constraints includes position the correspondence circuit chosen and the circuit set up Constitute the cyclization of circuit that connected graph, position correspondence choose and the connected graph interior joint of the railway superstructures set up Rate meets service distribution constraint more than or equal to the circuit that predetermined threshold value and position correspondence are chosen, it is thus achieved that complete Office's optimal location is to meet above-mentioned default constraints, thus the route choosing parameter that global optimum position is corresponding It is optimum, the circuit of optimal route Selection parameter corresponding selection is carried out network line construction, electricity can be improved The reliability of power communication network circuit, the global optimum position utilizing particle cluster algorithm to obtain not only meets fitness Minimum, but also consider network reliability and service distribution situation, fitness size is corresponding with cost, I.e. by global optimum's position acquisition line parameter circuit value optimal solution, and carry out according to the circuit of optimal solution corresponding selection During power telecom network line optimization, while meeting the constraint of network reliability and service distribution, the network optimization Cost minimization.

In the present embodiment, choose due to follow-up circuit and carry out on the basis of circuit to be selected, from And for the follow-up circuit reliability chosen and minimizing amount of calculation, need to meet in time selecting circuit initializing Reliability, the most initialized circuit to be selected meets service distribution constraint and connects with the railway superstructures set up Figure and the cyclization rate with the connected graph interior joint of the railway superstructures set up are more than or equal to predetermined threshold value.I.e. In time selecting circuit, constraint has just been carried out initializing, so that it is guaranteed that the reliability during network optimization.

Refer to Fig. 2, wherein in an embodiment, according to fitness function, utilize particle cluster algorithm to obtain Step S400 meeting the fitness minimum and global optimum position of presetting constraints in all particles includes:

S410: initialize number of particles in particle cluster algorithm, iterations, maximum iteration time, inertia power Weight, the first accelerated factor and the second accelerated factor, pass through line by power telecom network layout of roads scheme to be selected Road Selection parameter characterizes as the position of particle in particle cluster algorithm, using the adjustment of the position to particle as grain The speed of particle in swarm optimization, initializes position and the speed of each particle.

Wherein, single in the layout of roads scheme correspondence particle cluster algorithm a kind of to be selected of power telecom network circuit Particle.The position of the particle of correspondence of choosing the best alternatives in multiple programmes, can realize the excellent of circuit Change and select.The position initializing particle i.e. initializes the circuit that programme to be selected is chosen.Due to by electricity to be selected Power communication network layout of roads scheme by route choosing parameter characterization as the position of particle in particle cluster algorithm, I.e. route choosing parameter obtains the overall situation as the position of particle in particle cluster algorithm, later use particle cluster algorithm Optimal location is i.e. the optimal solution of route choosing parameter.

First initializing iterations is 1, i.e. from the beginning of the 1st iteration.In the present embodiment, grain is initialized Quantum count is 40, and maximum iteration time is 200 times, and inertia weight is 0.5, and the first accelerated factor is 0.4 And second accelerated factor be 0.6.Each particle includes the position of particle and the speed of particle, the position of particle It is that the speed according to particle is updated.First, to the position of each particle, speed, inertia weight, First accelerated factor and the second accelerated factor initialize, for follow-up offer data foundation.

After initializing the relevant parameter of above-mentioned particle cluster algorithm, utilize particle cluster algorithm to be iterated calculating and open Begin.

S420: according to fitness function, calculate the fitness that the position of each particle is corresponding.

Owing to the most obtaining fitness function, behind the position initializing each particle, i.e. may know that each Particle initializes the circuit chosen, thus understands the cost of the circuit chosen, it is possible to know cyclization rate, cyclization rate Predetermined threshold value pre-set, thus the fitness that the position that calculates each particle is corresponding.

S430: according to the fitness of each particle, the individual history optimal location of each particle, all particles complete Office's history optimal location and default constraints, update the personal best particle of each particle and all particles Global optimum position.

After determining the fitness of position of each particle, and the fitness of the position according to each particle, update institute There are global optimum position and the personal best particle of each particle of particle.Fitness is the least, then it represents that this grain The position of son is the most excellent, owing to fitness function obtains according to cost function and cyclization rate, thus, adapt to Spending the least, the cost of its correspondence is the least.For the reliability of network, also need to add default constraints, i.e. Only when meeting default constraints, then can be to the personal best particle of particle and the overall situation of all particles Optimal location is updated, if being unsatisfactory for presetting constraints, even if fitness is than history personal best particle Corresponding fitness is little, does not carries out the renewal of personal best particle.

S440: according to number of particles, inertia weight, the first accelerated factor, the second accelerated factor, each particle The personal best particle of itself and the global optimum position of all particles, update position and the speed of each particle Degree.

Position and speed to each particle are updated, and are i.e. updated the circuit chosen, thus more New power telecom network layout of roads, the cost making line construction is the least, so that power telecom network layout of roads More reasonable, construction cost is the lowest.

S450: judge that whether iterations is more than maximum iteration time.

When iterations is not more than maximum iteration time, execution step:

S460: iterations is added 1.

And return according to fitness function, calculate step S420 of the fitness of each particle.

When iterations is more than maximum iteration time, execution step:

S470: determine the global optimum position of all particles.

When iterations is not more than maximum iteration time, continue the particle after updating is carried out fitness calculating, Proceed personal best particle and the searching of global optimum position.Until iterations is more than greatest iteration time Number, stops finding, and the global optimum position of all particles now is i.e. optimum, global optimum position now Being set to the optimal solution of route choosing parameter, the cost of the circuit that optimal solution correspondence is chosen is to meet default constraint Under the conditions of minimum cost.

Referring to Fig. 3, wherein in an embodiment, root is according to the fitness of each particle, the individuality of each particle History optimal location, the global history optimal location of all particles and default constraints, update each particle Personal best particle and step S430 that includes of the step of global optimum position of all particles include:

S431: when fit corresponding less than the individual history optimal location of particle of the fitness that the position of particle is corresponding Response, and the position of particle meets when presetting constraints, by individuality that the location updating of particle is particle Excellent position, to determine the personal best particle of each particle.

When for the 1st iteration, the position of initialized particle is the individual history optimal location of particle, Without comparing fitness size, using the position of particle as the personal best particle of particle, to determine each particle Personal best particle when the 1st iteration.The personal best particle obtained during the 1st iteration is the 2nd The individual history optimal location of this particle during secondary iteration, the personal best particle obtained during the 2nd iteration is the most Individual history optimal location during the 3rd iteration, the like, individual history during each iteration can be obtained Optimal location, further according to the fitness of position and the default constraints of particle, it may be determined that each particle is often Personal best particle during secondary iteration.

S432: according to the fitness that the position of each particle is corresponding, obtain in the personal best particle of all particles The optimal location that corresponding fitness is minimum.

S433: when the fitness that optimal location is corresponding is less than the global history optimal location of all particles, will Optimal location is updated to the global optimum position of all particles, to determine the global optimum position of all particles.

Global optimum position be i.e. all particles personal best particle in optimum, when the 1st iteration, The personal best particle initializing particle is i.e. the position of particle self, and the position of each particle is to there being adaptation Degree, the position of fitness minimum is i.e. position optimum in all particles, can be by particle minimum for fitness Position as global optimum position, then global optimum position is that the fitness meeting and presetting constraints is minimum Position, the global optimum position of particle is the global history optimal location of particle.When iterations is more than 1 Time, during front an iteration, the global optimum position of acquisition is as global history optimal location during current iteration, The optimum that in the personal best particle that global optimum position is all particles of all particles, corresponding fitness is minimum Position, optimum during i.e. global optimum position is all personal best particles.

Wherein in an embodiment, the speed of each particle more new formula particularly as follows:

v_i(t+1)=w × v_i(t)+c₁×r₁(P_i(t)-x_i(t))+c₂×r₂[P_g(t)-x_i(t)]。

The location updating formula of each particle particularly as follows:

x_i(t+1)=x_i(t)+v_i(t+1)。

In formula, v_i(t+1) being the i-th particle speed when t+1 iterations, w is inertia weight, V_i(t) For the i-th particle speed when t iterations, c₁For particle when t iterations first Accelerated factor, r₁And r₂It is respectively the random number between 0 to 1, P_iT () is that i-th particle is the t iteration Personal best particle during number of times, x_iT () is the i-th particle position when t iterations, c₂For grain The son the second accelerated factor when t iterations, P_gT () is all particles when t iterations Global optimum position, x_i(t+1) it is the i-th particle position when t+1 iterations.

I-th particle in the position of t iterations with a n-dimensional vector X_i(t)=(x_i1(t),x_i2(t),...,x_in(t)) Representing, speed is V_i(t)=(v_i1(t),v_i2(t),...,v_in(t)), n is the bar number of circuit to be selected, X_iT () is i-th grain Sub in the position of t iterations, x_i1T () is that i-th particle is in the position of t iterations the 1st The route choosing parameter that bar routing to be selected is corresponding, x_i2T () is that i-th particle is in the position of t iterations In routing Selection parameter corresponding to the 2nd article of routing to be selected, x_inT () is that i-th particle is at the t iterations Position in routing Selection parameter corresponding to nth bar routing to be selected, route choosing parameter is as the position of particle Putting, every corresponding route choosing parameter of circuit to be selected, when circuit is chosen, route choosing parameter is 1, Otherwise, it is 0.V_iT () is the i-th particle speed at t iterations, v_i1T () is that i-th particle is The speed of the route choosing parameter that the 1st bar of routing line to be selected is corresponding, v in the position of t iterations_i2T () is The speed of the route choosing parameter that i particle the 2nd bar of routing line to be selected in the position of t iterations is corresponding Degree, v_inT () is the i-th particle circuit that nth bar routing to be selected line is corresponding in the position of t iterations The speed of Selection parameter.When the position of particle is updated, when the route choosing parameter value updated is less than 0 Time, route choosing parameter value is set to 0, and when the route choosing parameter value updated is more than 1, route choosing is joined Number is set to 1, it is ensured that route choosing parameter is 0 or 1, thus can determine that routing Selection parameter is the most selected or quilt Choosing.

Wherein in an embodiment, the formula of construction cost function particularly as follows:

C = Σ_{i = 1}^{n} e_{i} c_{i} .

The defined formula of cyclization rate is:

R = \frac{{Σs}_{c}}{m} .

The concrete formula setting up fitness function is:

In formula, C is cost function, and n is routing line to be selected sum, c_iFor building the cost on i-th line road, e_i For the route choosing parameter that i-th line road is corresponding, when line optimization i-th line road is selected, e_i=1, otherwise, e_i=0, R are cyclization rate, and m is the sum of power telecom network interior joint, s_cFor cyclization node number, f is suitable Response function, α and β is constraint factor,Predetermined threshold value for cyclization rate.

By the expression formula of above-mentioned fitness function, fitness is directly proportional to cost, and and cyclization Rate is relevant, utilizes adaptation corresponding to the optimal solution of route choosing parameter that particle cluster algorithm finds according to fitness Degree meets cyclization rate and more than or equal to predetermined threshold value and meets under service distribution constraints minimum, from And the cost of correspondence is to meet to preset constraints minimum, it is ensured that the reliability of power telecom network line optimization And economy.

With a specific embodiment, above-mentioned power telecom network line optimization method is illustrated below.

In order to verify the effectiveness of power telecom network line optimization method that this specific embodiment provided, to this Algorithm carries out emulation experiment.First, first initializing iterations is 1, i.e. from the beginning of the 1st iteration, just Beginningization number of particles is 40, and maximum iteration time is 200 times, constraint factor α=0.5, β=0.5, inertia Weights omega=0.5, the first accelerated factor c₁=0.4 and second accelerated factor c₂=0.6.

Assume the system structure that power telecom network is 15 nodes, as shown in Figure 4.Wherein have 15 joints Point, primarily determines that 20 circuit selectables according to practical situation, and wherein solid line represents existing circuit, is not counted in Becoming undergraduate course, dotted line represents enlarging circuit that can be to be selected.

The construction cost of every circuit is as shown in table 1, and other line construction cost not be given in table 1 is excellent It is set as infinity during change, 0 is set as the line cost existed.With network optimization cost Little turn to target, i.e. to optimize cost the minimization of object function as target, consider network reliability and industry Business distribution constraint, carries out emulation experiment.

The construction cost of every circuit in table 1 power telecom network

In this specific embodiment, the reliability of network is embodied by the cyclization rate of node.In emulation, respectively Make the predetermined threshold value of node cyclization rate RIt is 0.6,0.7 and 0.9, utilizes the power telecom network of present embodiment Line optimization method obtains three kinds of different prioritization schemes.Wherein, under Fig. 3 is the constraint that predetermined threshold value is 0.6 Network optimization result figure, Fig. 4 predetermined threshold value is the lower network optimization result figure of constraint of 0.7, and Fig. 5 is default Threshold value is the network optimization result figure under the constraint of 0.9.

Cyclization rate and cost is simply considered, to guarantee the reliability of network, for entering one during above-mentioned optimization Step strengthens the reliability of network, on the basis of network reliability requires, adds service distribution constraints It is analyzed.Make the predetermined threshold value of node cyclization rate RIt is 0.6, big owing to having between node 4 and node 5 The business of amount, needs to arrange direct-connected circuit between the two node, i.e. e (4,5) must exist.By setting Put e (4,5) and this service distribution constraints must be there is, carry out the optimum results obtained when network line optimizes Figure is as shown in Figure 6.It will be appreciated from fig. 6 that limit e (4,5) is although construction cost is the highest, but divide to meet business The constraint of cloth, it is necessary to select this route.

Predetermined threshold valueBeing 0.6,0.7 and 0.9 respectively to scheme one, scheme two and scheme three, predetermined threshold value is 0.6 and add service distribution constraints e (4,5) and there is corresponding scheme four.The experimental result of four kinds of schemes such as table 2 Shown in.

Experimental result under table 2 various boundary conditions

From table 2 it can be seen that the cost of network line optimization increases with the raising of cyclization rate, this be due to Needing to build more circuit makes node connect into ring, but, in the case of cyclization rate requires equally, draw After entering service distribution constraint, construction cost increases.

Refer to Fig. 9, a kind of power telecom network line optimization system, including:

Route initialization module 100 to be selected, for initializing the circuit to be selected of power telecom network circuit.

Cost builds module 200, for according to routing line to be selected, route choosing parameter and default construction wall scroll The cost of circuit, builds the cost function of power telecom network layout of roads scheme to be selected and calculates the cyclization of correspondence Rate.

Fitness function builds module 300, is used for power telecom network layout of roads scheme to be selected as population Particle in algorithm, passes through route choosing parameter characterization as grain using power telecom network layout of roads scheme to be selected The position of particle in swarm optimization, according to cost function and cyclization rate, builds in particle cluster algorithm required Fitness function.

Optimize module 400, for according to fitness function, utilize particle cluster algorithm to obtain in all particles and meet Preset fitness minimum and the global optimum position of constraints.

Determine module 500, for according to global optimum position, obtain corresponding power telecom network circuit to be selected rule The optimal solution of the route choosing parameter of the scheme of drawing, circuit optimal solution correspondence chosen is power telecom network circuit Planning optimal route.

Above-mentioned power telecom network line optimization system, first initializes the to be selected of power telecom network circuit to be optimized Select circuit, according to routing line to be selected, route choosing parameter and the cost building single line, build to be selected The cost function of power telecom network layout of roads scheme also calculates cyclization rate, according to cost function and cyclization rate, Set up fitness function, according to fitness function, utilize particle cluster algorithm to obtain satisfied in all particles presetting The global optimum position that the fitness of constraints is minimum, according to global optimum position, obtains route choosing ginseng The optimal solution of number, circuit optimal solution correspondence chosen is power telecom network layout of roads optimal route, it is achieved Power telecom network line optimization.Default constraints includes position the correspondence circuit chosen and the circuit set up Constitute the cyclization of circuit that connected graph, position correspondence choose and the connected graph interior joint of the railway superstructures set up Rate meets service distribution constraint more than or equal to the circuit that predetermined threshold value and position correspondence are chosen, it is thus achieved that complete Office's optimal location is to meet above-mentioned default constraints, thus the route choosing parameter that global optimum position is corresponding It is optimum, the circuit of optimal route Selection parameter corresponding selection is carried out network line construction, electricity can be improved The reliability of power communication network circuit, the global optimum position utilizing particle cluster algorithm to obtain not only meets fitness Minimum, but also consider network reliability and service distribution situation, fitness size is corresponding with cost, I.e. by global optimum's position acquisition line parameter circuit value optimal solution, and carry out according to the circuit of optimal solution corresponding selection During power telecom network line optimization, while meeting the constraint of network reliability and service distribution, the network optimization Cost minimization.

Refer to Figure 10, wherein in an embodiment, optimize module 400 and include:

Parameter initialization unit 410, is used for initializing number of particles in particle cluster algorithm, iterations, maximum Iterations, inertia weight, the first accelerated factor and the second accelerated factor, by power communication netting twine to be selected Circuit planning scheme by route choosing parameter characterization as the position of particle in particle cluster algorithm, by particle Adjusting as the speed of particle in particle cluster algorithm of position, initializes position and the speed of each particle.

Computing unit 420, for according to fitness function, calculates the fitness that the position of each particle is corresponding.

After initializing the relevant parameter of above-mentioned particle cluster algorithm, utilize particle cluster algorithm to be iterated calculating and open Begin.Owing to the most obtaining fitness function, behind the position initializing each particle, i.e. may know that each Particle initializes the circuit chosen, thus understands the cost of the circuit chosen, it is possible to know cyclization rate, cyclization rate Predetermined threshold value pre-set, thus calculate the fitness of each particle.

First determines unit 430, for according to the fitness of each particle, the individual history optimal location of each particle, The global history optimal location of all particles and default constraints, update the personal best particle of each particle And the global optimum position of all particles.

Updating block 440, for according to number of particles, inertia weight, the first accelerated factor, second accelerate because of The personal best particle of particle, each itself and the global optimum position of all particles, update each particle Position and speed.

Second determines unit 450, for when iterations is not more than maximum iteration time, is added by iterations 1, and return computing module and proceed the fitness of particle and calculate, when iterations is more than maximum iteration time Time, determine the global optimum position of all particles.

Referring to Figure 11, wherein in an embodiment, first determines that unit 430 includes:

Individual optimum determines unit 431, for going through less than the individuality of particle when fitness corresponding to the position of particle The fitness that history optimal location is corresponding, and when the position of particle meets default constraints, by the position of particle It is updated to the personal best particle of particle, to determine the personal best particle of each particle.

Optimal particle acquiring unit 432, for the fitness corresponding according to the position of each particle, obtains all grains The optimal location that in the personal best particle of son, corresponding fitness is minimum.

Global optimum determines unit 433, for being less than the overall situation of all particles when fitness corresponding to optimal location During history optimal location, optimal location is updated to the global optimum position of all particles, to determine all grains The global optimum position of son.

Wherein in an embodiment, updating block 440 updates the concrete formula of the speed of each particle and is:

v_i(t+1)=w × v_i(t)+c₁×r₁(P_i(t)-x_i(t))+c₂×r₂[P_g(t)-x_i(t)]。

Updating block 440 updates the concrete formula of the position of each particle:

x_i(t+1)=x_i(t)+v_i(t+1)。

Wherein in an embodiment, cost build module 200 construction cost function formula particularly as follows:

C = Σ_{i = 1}^{n} e_{i} c_{i};

The defined formula of cyclization rate is:

R = \frac{s_{c}}{m};

Fitness function structure module 300 sets up the concrete formula of fitness function:

By the expression formula of above-mentioned fitness function, fitness is directly proportional to cost, according to adaptation The fitness spending the optimal solution utilizing particle cluster algorithm to find corresponding is minimum, thus the cost of correspondence is Little, meet during power telecom network line optimization most economical.In the case of satisfied economy, also by cyclization Rate is more than or equal to predetermined threshold value and meets the setting of service distribution constraints, it is ensured that power communication netting twine The reliability on road.

Each technical characteristic of above example can combine arbitrarily, for making description succinct, not to above-mentioned The all possible combination of each technical characteristic in embodiment is all described, but, as long as these technology are special There is not contradiction in the combination levied, is all considered to be the scope that this specification is recorded.

Above example only have expressed the several embodiments of the present invention, and it describes more concrete and detailed, but Can not therefore be construed as limiting the scope of the patent.It should be pointed out that, general for this area For logical technical staff, without departing from the inventive concept of the premise, it is also possible to make some deformation and improvement, These broadly fall into protection scope of the present invention.Therefore, the protection domain of patent of the present invention should be wanted with appended right Ask and be as the criterion.

Claims

1. a power telecom network line optimization method, it is characterised in that comprise the steps:

Initialize the circuit to be selected of power telecom network circuit；

Power telecom network line optimization method the most according to claim 1, it is characterised in that described According to described fitness function, utilize described particle cluster algorithm to obtain in all particles to meet preset constraints and The step of the global optimum position that fitness is minimum includes:

Initialize number of particles in described particle cluster algorithm, iterations, maximum iteration time, inertia weight, First accelerated factor and the second accelerated factor, pass through institute by described power telecom network layout of roads scheme to be selected State route choosing parameter characterization as the position of particle in described particle cluster algorithm, by the tune of the position to particle Whole as the speed of particle in described particle cluster algorithm, initialize position and the speed of each particle；

Iterative computation starts, and according to described fitness function, calculates the fitness that the position of each particle is corresponding；

Fitness according to each particle, the individual history optimal location of each particle, the global history of all particles Optimal location and described default constraints, update the personal best particle of each particle and all particles Global optimum position；

According to described number of particles, described inertia weight, described first accelerated factor, described second accelerate because of The personal best particle of particle, each and the global optimum position of all particles, update the position of each particle And speed；

When described iterations is not more than described maximum iteration time, described iterations is added 1, and returns Described according to described fitness function, calculate the step of the fitness of each particle；

When described iterations is more than described maximum iteration time, determine the global optimum of described all particles Position.

Power telecom network line optimization method the most according to claim 2, it is characterised in that described According to the fitness of each particle, the individual history optimal location of each particle, the global history optimum position of all particles Put and described default constraints, update the overall situation of the personal best particle of each particle and all particles The step of excellent position includes:

The described fitness corresponding when the position of particle is corresponding less than the individual history optimal location of described particle Fitness, and when the position of described particle meets described default constraints, by the location updating of described particle For the personal best particle of described particle, to determine the personal best particle of each particle；

The fitness that position according to each particle is corresponding, obtains in the personal best particle of all particles corresponding suitable The optimal location that response is minimum；

When the fitness that described optimal location is corresponding is less than the global history optimal location of all particles, by institute State optimal location and be updated to the global optimum position of described all particles, to determine the global optimum of all particles Position.

Power telecom network line optimization method the most according to claim 1, it is characterised in that set up institute The concrete formula stating fitness function is:

In formula, described f is described fitness function, and described α and described β is constraint factor, and described R is Described cyclization rate, describedFor the predetermined threshold value of described cyclization rate, described C is described cost function.

Power telecom network line optimization method the most according to claim 4, it is characterised in that be built into The formula of this function particularly as follows:

C = Σ_{i = 1}^{n} e_{i} c_{i};

The defined formula of described cyclization rate is:

R = \frac{s_{c}}{m};

In formula, described n is described routing line to be selected sum, described c_iFor building the cost on i-th line road, e_iFor The route choosing parameter that i-th line road is corresponding, when line optimization i-th line road is selected, e_i=1, otherwise, e_i=0, described m are the sum of described power telecom network interior joint, described s_cFor cyclization node number.

6. a power telecom network line optimization system, it is characterised in that including:

Power telecom network line optimization system the most according to claim 6, it is characterised in that described excellent Change module to include:

Parameter initialization unit, is used for initializing number of particles in described particle cluster algorithm, iterations, Big iterations, inertia weight, the first accelerated factor and the second accelerated factor, lead to described electric power to be selected Letter netting twine circuit planning scheme passes through described route choosing parameter characterization as the position of particle in described particle cluster algorithm Put, adjusting the position to particle as the speed of particle in described particle cluster algorithm, initialize each grain The position of son and speed；

Computing unit, for according to described fitness function, calculates the fitness that the position of each particle is corresponding；

First determines unit, for according to the fitness of each particle, the individual history optimal location of each particle, The global history optimal location of all particles and described default constraints, update the individual optimum of each particle The global optimum position of position and all particles；

Updating block, for according to described number of particles, described inertia weight, described first accelerated factor, The personal best particle of described second accelerated factor, each particle itself and the global optimum position of all particles, Update position and the speed of each particle；

Second determines unit, for when described iterations is not more than described maximum iteration time, by described Iterations adds 1, and returns described computing module and proceed the fitness of particle and calculate, when described iteration time When number is more than described maximum iteration time, determine the global optimum position of described all particles.

Power telecom network line optimization system the most according to claim 7, it is characterised in that described One determines that unit includes:

Individual optimum determines unit, for being less than described particle when described fitness corresponding to the position of particle The fitness that individual history optimal location is corresponding, and when the position of described particle meets described default constraints, By the personal best particle that location updating is described particle of described particle, to determine the individual optimum of each particle Position；

Optimal particle acquiring unit, for the fitness corresponding according to the position of each particle, obtains all particles Personal best particle in the minimum optimal location of corresponding fitness；

Global optimum determines unit, for being less than the complete of all particles when fitness corresponding to described optimal location During office's history optimal location, described optimal location is updated to the global optimum position of described all particles, with Determine the global optimum position of all particles.

Power telecom network line optimization system the most according to claim 6, it is characterised in that described suitable Response function structure module sets up the concrete formula of described fitness function:

Power telecom network line optimization system the most according to claim 9, it is characterised in that described Cost build module construction cost function formula particularly as follows:

C = Σ_{i = 1}^{n} e_{i} c_{i};

The defined formula of described cyclization rate is:

R = \frac{s_{c}}{m};