CN104617985B - Power telecom network line optimization method and device based on ant group algorithm - Google Patents
Power telecom network line optimization method and device based on ant group algorithm Download PDFInfo
- Publication number
- CN104617985B CN104617985B CN201410851070.8A CN201410851070A CN104617985B CN 104617985 B CN104617985 B CN 104617985B CN 201410851070 A CN201410851070 A CN 201410851070A CN 104617985 B CN104617985 B CN 104617985B
- Authority
- CN
- China
- Prior art keywords
- mrow
- circuit
- ant
- msub
- msup
- 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.)
- Expired - Fee Related
Links
- 238000005457 optimization Methods 0.000 title claims abstract description 32
- 238000000034 method Methods 0.000 title claims abstract description 26
- 238000004422 calculation algorithm Methods 0.000 title claims abstract description 18
- 239000003016 pheromone Substances 0.000 claims abstract description 96
- 238000010276 construction Methods 0.000 claims abstract description 58
- 238000004891 communication Methods 0.000 claims abstract description 53
- 125000004122 cyclic group Chemical group 0.000 claims abstract description 36
- 230000007704 transition Effects 0.000 claims abstract description 27
- 238000010586 diagram Methods 0.000 description 8
- 230000003287 optical effect Effects 0.000 description 4
- 238000012913 prioritisation Methods 0.000 description 3
- 230000008569 process Effects 0.000 description 3
- 238000011160 research Methods 0.000 description 3
- 238000007363 ring formation reaction Methods 0.000 description 3
- 241000257303 Hymenoptera Species 0.000 description 2
- 238000009825 accumulation Methods 0.000 description 2
- 230000005540 biological transmission Effects 0.000 description 2
- 230000008859 change Effects 0.000 description 2
- 238000002474 experimental method Methods 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000004364 calculation method Methods 0.000 description 1
- 238000013480 data collection Methods 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 239000004744 fabric Substances 0.000 description 1
- 230000036541 health Effects 0.000 description 1
- 238000011835 investigation Methods 0.000 description 1
- 230000006855 networking Effects 0.000 description 1
- 230000035945 sensitivity Effects 0.000 description 1
- 238000004088 simulation Methods 0.000 description 1
- 230000006641 stabilisation Effects 0.000 description 1
- 238000011105 stabilization Methods 0.000 description 1
Landscapes
- Telephonic Communication Services (AREA)
Abstract
The present invention relates to communication network line construction technical field, and in particular to a kind of power telecom network line optimization method and device based on ant group algorithm.By the way that ant is randomly dispersed on each website, ensure at least one ant on each website, each ant is moved to adjacent sites based on transition probability, form a communication network figure, judge whether communication network figure meets connective and cyclic rate requirement, satisfaction then proceeds and updates the plain concentration of line information, is reached and finally converged on optimal path by the continuous renewal of pheromones.Technical solution of the present invention most preferably optimizes direction with economy, using cyclic rate as constraint, consider the factors such as economy, reliability and service distribution, effective layout of roads scheme can be provided when in face of different cyclic rate values, with very high flexibility, it is capable of the powerline network of reasonably optimizing construction economic and reliable, important reference frame can be brought for its construction.
Description
Technical field
The present invention relates to communication network line construction technical field, and in particular to a kind of power telecom network based on ant group algorithm
Line optimization method and device.
Background technology
Power communication line optimization refers on the basis of known sites position and service distribution, according to existing network knot
Structure, under conditions of service distribution and reliability constraint is met, determines the optimal communication line deployment scheme of economy.With
Power network scale expands day by day, and the optimization problem of powerline network also becomes to become increasingly complex.Therefore, optimize for power transmission network
Further investigation good operation not only to China's power system, the more stabilization and national economy for society is quick, health
Development suffer from positive role.The existing power communication optimization method only warp of prioritization scheme from the point of view of single
Ji property or reliability, and this economic, reliable two big index can not be taken into account simultaneously, so as to get prioritization scheme has one-sidedness.Thus,
Building most reliable communication network such as how minimum cost turns into one of key issue that power telecom network optimizes.Adopted in data
Collection Research of Routing Algorithm field has been achieved for more achievement in research.
Currently for some the existing researchs of power telecom network optimization problem, a class is the economy mould for taking out communication line
Type, and problem is solved using intelligent optimization algorithm, the minimum of line construction cost is realized, but it is not examined
Consider reliability constraint, cause the cyclic rate of communication site not enough, cause network in failure, impacted business can not and
Shi Huifu.Another kind of is to cause resource redundancy by adding communication site into network, ensures the redundancy ability of network with this,
Network reliability is improved, but increase redundant sites can greatly improve the construction cost of network, not simply fail to ensure networking
Economy, can also cause the unnecessary wasting of resources.Further, since the heterogeneity of communication service distribution, causes portfolio
Certain site is concentrated in, now should ensure that between these websites has communication line direct-connected, so as to reduce the hop count of business route.
The content of the invention
The defect of this economic, reliable two big index, this hair can not be taken into account simultaneously for existing power communication optimization method
It is bright to provide a kind of power telecom network line optimization method and device based on ant group algorithm.
On the one hand, a kind of power telecom network line optimization method based on ant group algorithm that the present invention is provided, including：
S1, obtains the construction cost of circuit between communication network site information and each website；
S2, initializes the pheromone concentration of every circuit；
S3, is that each described website is randomly assigned at least one ant；
S4, each ant is moved to a website adjacent with being currently located website based on transition probability, obtains one and leads to
Letter net figure, the transition probability is determined according to the pheromone concentration and construction cost of every circuit；
S5, judges whether the communication network figure meets connective and cyclic rate and be less than pre-set threshold value, no if then performing S6
Then perform S3；
S6, whether the construction cost for judging the communication network figure is current minimum construction cost, if then performing S7, otherwise
Perform S3；
S7, updates the pheromone concentration and communication network figure of circuit selected by each ant, and performs S3, until iterations
Reach preset times, the minimum communication network figure of output construction cost.
Further, the pheromone concentration initialization value of every circuit is a constant, the letter of all circuits in the S2
The plain concentration initialization value of breath is equal.
Further, the S4 transition probabilities are represented using below equation：
Wherein,The transition probability of circuit (i, j) is selected in t for ant k；τij(t) for circuit (i, j) in t
The pheromone concentration at moment；ηijFor the heuristic function of circuit (i, j),dijFor the construction cost of circuit (i, j)；α is
Pheromone concentration factor of influence；β is visibility factor.
Further, the pheromone concentration of circuit selected by each ant is updated in the S7 using below equation：
τij(t+1)=(1- ρ) τij(t)+Δτij(t+1)
Wherein, ρ is pheromones volatilization factor, and 1- ρ then remain the factor for pheromones；Δτij(t+1) it is t+1 moment circuits
Pheromone concentration increment on (i, j)；Pass through the pheromone concentration that circuit (i, j) is produced at the t+1 moment for ant k
Increment.
Further, the ant k passes through the pheromone concentration increment that circuit (i, j) is produced at the t+1 moment
Represented using below equation：
Wherein, Q is the pheromone concentration of the every circuit initialized；P is cable line way to be selected；eijFor 0-1 variables, when
Circuit (i, j) is 1 when having ant to pass through, and is otherwise 0；wijFor the construction cost of circuit (i, j)；Ring_rate is cyclic rate；For cyclic rate pre-set threshold value.
On the other hand, the present invention also provides a kind of power telecom network line optimization device based on ant group algorithm, the dress
Put including：
Acquisition module, the construction cost for obtaining circuit between communication network site information and each website；
Initialization module, the pheromone concentration for initializing every circuit；
Distribute module, for being randomly assigned at least one ant for website each described；
Mobile module, a website adjacent with being currently located website is moved to for each ant based on transition probability,
Obtain a communication network figure, the transition probability is determined according to the pheromone concentration and construction cost of every circuit；
First judge module, is less than pre-set threshold value for judging whether the communication network figure meets connective and cyclic rate；
Second judge module, for judging whether the construction cost of the communication network figure is current minimum construction cost；
Update module, for updating the pheromone concentration of circuit selected by each ant and communication network figure, iterations reaches
The minimum communication network figure of construction cost is exported after to preset times.
Further, the pheromone concentration initialization value of every circuit is initialized in the initialization module normal for one
Number, the pheromone concentration initialization value of all circuits is equal.
Further, the mobile module transition probability is represented using below equation：
Wherein,The transition probability of circuit (i, j) is selected in t for ant k；τij(t) for circuit (i, j) in t
The pheromone concentration at moment；ηijFor the heuristic function of circuit (i, j),dijFor the construction cost of circuit (i, j)；α is
Pheromone concentration factor of influence；β is visibility factor.
Further, the pheromone concentration of circuit selected by each ant is updated in the update module using below equation：
τij(t+1)=(1- ρ) τij(t)+Δτij(t+1)
Wherein, ρ is pheromones volatilization factor, and 1- ρ then remain the factor for pheromones；Δτij(t+1) it is t+1 moment circuits
Pheromone concentration increment on (i, j)；Pass through the pheromone concentration that circuit (i, j) is produced at the t+1 moment for ant k
Increment.
Further, the ant k passes through the pheromone concentration increment that circuit (i, j) is produced at the t+1 moment
Represented using below equation：
Wherein, Q is the pheromone concentration of the every circuit initialized；P is cable line way to be selected；eijFor 0-1 variables, when
Circuit (i, j) is 1 when having ant to pass through, and is otherwise 0；wijFor the construction cost of circuit (i, j)；Ring_rate is cyclic rate；For cyclic rate pre-set threshold value.
A kind of power telecom network line optimization method and device based on ant group algorithm that the present invention is provided, with economy most
Good is optimization direction, using cyclic rate as constraint, the factors such as economy, reliability and service distribution is considered, in face of difference
Effective layout of roads scheme can be provided during cyclic rate value, being capable of reasonably optimizing construction economy with very high flexibility
Reliable powerline network, can bring important reference frame for its construction.
Brief description of the drawings
The features and advantages of the present invention can be more clearly understood from by reference to accompanying drawing, accompanying drawing is schematical without that should manage
Solve to carry out any limitation to the present invention, in the accompanying drawings：
Fig. 1 is the power telecom network line optimization method flow signal based on ant group algorithm in one embodiment of the invention
Figure；
The structural representation of power telecom network line optimization device based on ant group algorithm in Fig. 2 one embodiment of the invention
Figure；
The optional line construction schematic diagram of communication network to be optimized in Fig. 3 one embodiment of the invention；
Pheromone concentration change schematic diagram under different cyclization rates in Fig. 4 one embodiment of the invention；
Power telecom network Different Optimization scenario-frame schematic diagram under cyclic rate in three in Fig. 5 one embodiment of the invention.
Embodiment
Technical solution of the present invention is further elaborated in conjunction with drawings and examples.
Fig. 1 shows the power telecom network line optimization method flow schematic diagram based on ant group algorithm in the present embodiment, such as
Shown in Fig. 1, a kind of power telecom network line optimization method based on ant group algorithm that the present embodiment is provided, including：
S1, obtains the construction cost of circuit between communication network site information and each website；
S2, initializes the pheromone concentration of every circuit；
S3, is that each described website is randomly assigned at least one ant.
Ant quantity, chooses several times of website quantity even more according to the precision of specific station point quantity and result of calculation
Ant quantity, ant is distributed using Probability principle for each website at random.Also, it is the circuit between any two website
Initialization information element concentration, specifically, the pheromone concentration initialization value of every circuit is a constant, and the letter of all circuits
The plain concentration initialization value of breath is equal.
S4, each ant is moved to a website adjacent with being currently located website based on transition probability, obtains one and leads to
Letter net figure, the transition probability is determined according to the pheromone concentration and construction cost of every circuit.
Each ant can select to shift circuit according to transition probability, and the corresponding transition probability of different circuits is different, tool
Body is represented using below equation：
Wherein,The transition probability of circuit (i, j) is selected in t for ant k；τij(t) for circuit (i, j) in t
The pheromone concentration at moment；ηijFor the heuristic function of circuit (i, j),dijFor the construction cost of circuit (i, j)；α is
Pheromone concentration factor of influence；β is visibility factor.
α represents that ant also indicates that this circuit for the sensitivity of pheromone concentration as pheromone concentration factor of influence
Relative importance, its value is bigger, and now ant is easily influenceed when selecting next searching of line by pheromone concentration,
Ant tends to the higher circuit of pheromone concentration, that is, has the circuit that more ants are passed by while being also to enhance ant
Between exchange of information become apparent from the coordination system to each other；β is also known as expecting factor as visibility factor, represents ant in itself
Visibility to the importance in route choosing, its value is more big, ant selection circuit when be more to rely on visibility information,
When value is very high, ant is then to select the searching of line of next step with a kind of rule of almost greediness, and ignores pheromones shadow
Ring.
S5, judges whether the communication network figure meets connective and cyclic rate and be less than pre-set threshold value, no if then performing S6
Then perform S3；
S6, whether the construction cost for judging the communication network figure is current minimum construction cost, if then performing S7, otherwise
Perform S3；
S7, updates the pheromone concentration and communication network figure of circuit selected by each ant, and performs S3, until iterations
Reach preset times, the minimum communication network figure of output construction cost.
Further, the pheromone concentration of circuit selected by each ant is updated in the S7 using below equation：
τij(t+1)=(1- ρ) τij(t)+Δτij(t+1)
Wherein, ρ is pheromones volatilization factor, and 1- ρ then remain the factor for pheromones；Δτij(t+1) it is t+1 moment circuits
Pheromone concentration increment on (i, j)；Pass through the pheromone concentration that circuit (i, j) is produced at the t+1 moment for ant k
Increment.
With the increase of loop iteration number of times, pheromones can be all left on many circuits, and the selection of more ants is passed through
The pheromone concentration that leaves of circuit it is higher, in order to prevent a large amount of residual risks element constantly accumulation on each circuit from causing
Ant ignores visibility information, needs to consider volatilization situation of the pheromone concentration with the time in pheromone concentration renewal process.
For example, above-mentioned ρ is pheromones volatilization factor, 1- ρ then remain the factor for pheromones, for the ant swarm in the boundary that more gets close to nature
Body, and the excessive accumulation of pheromones is prevented, the common spans of ρ are
The ant k passes through the pheromone concentration increment that circuit (i, j) is produced at the t+1 momentUsing following public affairs
Formula is represented：
Wherein, Q is the pheromone concentration of the every circuit initialized；P is cable line way to be selected；eijFor 0-1 variables, when
Circuit (i, j) is 1 when having ant to pass through, and is otherwise 0；wijFor the construction cost of circuit (i, j)；Ring_rate is cyclic rate；For cyclic rate pre-set threshold value.
On the other hand, as shown in Fig. 2 the present invention also provides a kind of power telecom network line optimization dress based on ant group algorithm
Put, including：
Acquisition module 101, the construction cost for obtaining circuit between communication network site information and each website；
Initialization module 102, the pheromone concentration for initializing ant quantity and every circuit；
Distribute module 103, for being randomly assigned at least one ant for website each described；
Mobile module 104, a station adjacent with being currently located website is moved to for each ant based on transition probability
Point, obtains a communication network figure, and the transition probability is determined according to the pheromone concentration and construction cost of every circuit；
First judge module 105, is less than default valve for judging whether the communication network figure meets connective and cyclic rate
Value；
Second judge module 106, for judging whether the construction cost of the communication network figure is current minimum construction cost；
Update module 107, for updating the pheromone concentration of circuit selected by each ant and communication network figure, iterations
Reach and the minimum communication network figure of construction cost is exported after preset times.
Further, the pheromone concentration initialization value that every circuit is initialized in the initialization module 102 is one
Constant, the pheromone concentration initialization value of all circuits is equal.
Further, the transition probability of mobile module 104 is represented using below equation：
Wherein,The transition probability of circuit (i, j) is selected in t for ant k；τij(t) for circuit (i, j) in t
The pheromone concentration at moment；ηijFor the heuristic function of circuit (i, j),dijFor the construction cost of circuit (i, j)；α is
Pheromone concentration factor of influence；β is visibility factor.
Further, the pheromones in the update module 107 using circuit selected by each ant of below equation renewal are dense
Degree：
τij(t+1)=(1- ρ) τij(t)+Δτij(t+1)
Wherein, ρ is pheromones volatilization factor, and 1- ρ then remain the factor for pheromones；Δτij(t+1) it is t+1 moment circuits
Pheromone concentration increment on (i, j)；Pass through the pheromone concentration that circuit (i, j) is produced at the t+1 moment for ant k
Increment.
Further, the ant k passes through the pheromone concentration increment that circuit (i, j) is produced at the t+1 moment
Represented using below equation：
Wherein, Q is the pheromone concentration of the every circuit initialized；P is cable line way to be selected；eijFor 0-1 variables, when
Circuit (i, j) is 1 when having ant to pass through, and is otherwise 0；wijFor the construction cost of circuit (i, j)；Ring_rate is cyclic rate；For cyclic rate pre-set threshold value.
A kind of power telecom network line optimization method and device based on ant group algorithm that the present embodiment is provided, by by ant
Ant is randomly dispersed on each website, it is ensured that at least one ant on each website, each ant is moved based on transition probability
To adjacent sites, a communication network figure is formed, judges whether communication network figure meets connective and cyclic rate requirement, satisfaction then continues
Carry out and update the plain concentration of line information, reached and finally converged on optimal path by the continuous renewal of pheromones.This implementation
Example technical scheme most preferably optimizes direction with economy, using cyclic rate as constraint, considers economy, reliability and business point
The factors such as cloth, can provide effective layout of roads scheme, with very high flexibility, energy when in face of different cyclic rate values
Enough reasonably optimizings build the powerline network of economic and reliable, can bring important reference frame for its construction.
The present embodiment technical scheme is illustrated below by way of an emulation experiment：
The simulation optimization method proposed in the present embodiment carries out emulation experiment for 15 node systems.15 node system structures
As shown in figure 3,15 websites are wherein had, the 20 optional circuits of optical cable primarily determined that according to actual conditions, wherein solid line table
Show that original circuit, dotted line represent optional circuit to be extended.The construction cost of every circuit as shown in table 1, do not provided in table 1 its
Its line construction cost is set as infinity in optimization process.
The lightguide cable link cost of table 1
For there is the cost of circuit, although we illustrate actual financial cost in this table, but in reality
The line cost existed is not considered in optimization process.Specific practice can be adopted as every circuit plus a Boolean bool,
Existing circuit is represented when the value is 1,0 is newly-built circuit, when calculating the construction cost of communication network, in the base of line cost
It is multiplied by plinth (1-bool).
Specifically, the present embodiment method is with prioritization scheme, ant quantity takes 50, and iterations takes 300, optimal with economy
For optimization direction, the cyclic rate CR of adjustment website threshold valuesCR is made to be more than 0.5,0.7 and 0.9 respectively；Under 3 kinds of cyclic rate constraints
Pheromone concentration it is as shown in Figure 4 with the change of iterations.
From fig. 4, it can be seen that in rate constraint cyclic in face of different websites, the pheromone concentration of the present embodiment method exists
Iteration rises rapidly initial stage, and convergence can be reached in finite iteration number of times, illustrates that the present embodiment method can be provided based on not
With the electric power Optical Transmission Network OTN route optimization of cyclization rate constraint.
Experimental result under 3 kinds of cyclic rate constraints is as shown in table 2.
Experimental result under the cyclic rate constraint of 23 kinds of table
From table 2 it can be seen that optical cable construction cost increases with the raising of cyclic rate, this is due to need to build more
Optical cable makes website connection cyclization.Wherein, the corresponding communication network optimization schematic diagram of different schemes is as shown in figure 5, wherein Fig. 5 (a) sides
Case one optimizes schematic diagram, the optimization schematic diagram of Fig. 5 (b) schemes two, the optimization schematic diagram of Fig. 5 (c) schemes three.
The present embodiment technical scheme most preferably optimizes direction with economy, using cyclic rate as constraint, consider economy,
The factor such as reliability and service distribution, can provide effective layout of roads scheme when in face of different cyclic rate values, have
Very high flexibility, is capable of the powerline network of reasonably optimizing construction economic and reliable, can bring important reference for its construction
Foundation.
Although being described in conjunction with the accompanying embodiments of the present invention, those skilled in the art can not depart from this hair
Various modifications and variations are made in the case of bright spirit and scope, such modifications and variations are each fallen within by appended claims
Within limited range.
Claims (10)
1. a kind of power telecom network line optimization method based on ant group algorithm, it is characterised in that methods described includes：
S1, obtains the construction cost of circuit between communication network site information and each website；
S2, initializes the pheromone concentration of every circuit；
S3, is that each described website is randomly assigned at least one ant；
S4, each ant is moved to a website adjacent with being currently located website based on transition probability, obtains a communication network
Figure, the transition probability is determined according to the pheromone concentration and construction cost of every circuit；
S5, judges whether the communication network figure meets connective and cyclic rate and be less than pre-set threshold value, if then performing S6, otherwise holds
Row S3；
S6, whether the construction cost for judging the communication network figure is current minimum construction cost, if then performing S7, is otherwise performed
S3；
S7, updates the pheromone concentration and communication network figure of circuit selected by each ant, and performs S3, until iterations reaches
Preset times, the minimum communication network figure of output construction cost.
2. according to the method described in claim 1, it is characterised in that the pheromone concentration initialization value of every circuit in the S2
For a constant, the pheromone concentration initialization value of all circuits is equal.
3. according to the method described in claim 1, it is characterised in that the S4 transition probabilities are represented using below equation：
<mrow>
<msup>
<msub>
<mi>P</mi>
<mi>ij</mi>
</msub>
<mi>k</mi>
</msup>
<mrow>
<mo>(</mo>
<mi>t</mi>
<mo>)</mo>
</mrow>
<mo>=</mo>
<mfrac>
<mrow>
<msup>
<mrow>
<mo>[</mo>
<msub>
<mi>&tau;</mi>
<mi>ij</mi>
</msub>
<mrow>
<mo>(</mo>
<mi>t</mi>
<mo>)</mo>
</mrow>
<mo>]</mo>
</mrow>
<mi>&alpha;</mi>
</msup>
<mo>&CenterDot;</mo>
<msup>
<mrow>
<mo>[</mo>
<msub>
<mi>&eta;</mi>
<mi>ij</mi>
</msub>
<mo>]</mo>
</mrow>
<mi>&beta;</mi>
</msup>
</mrow>
<mrow>
<mi>&Sigma;</mi>
<msup>
<mrow>
<mo>[</mo>
<msub>
<mi>&tau;</mi>
<mi>ij</mi>
</msub>
<mrow>
<mo>(</mo>
<mi>t</mi>
<mo>)</mo>
</mrow>
<mo>]</mo>
</mrow>
<mi>&alpha;</mi>
</msup>
<mo>&CenterDot;</mo>
<msup>
<mrow>
<mo>[</mo>
<msub>
<mi>&eta;</mi>
<mi>ij</mi>
</msub>
<mo>]</mo>
</mrow>
<mi>&beta;</mi>
</msup>
</mrow>
</mfrac>
</mrow>
Wherein, Pij k(t) transition probability of circuit (i, j) is selected in t for ant k；τij(t) for circuit (i, j) in t
Pheromone concentration；ηijFor the heuristic function of circuit (i, j),dijFor the construction cost of circuit (i, j)；α is information
Plain concentration factor of influence；β is visibility factor.
4. method according to claim 2, it is characterised in that updated in the S7 using below equation selected by each ant
The pheromone concentration of circuit：
τij(t+1)=(1- ρ) τij(t)+Δτij(t+1)
<mrow>
<msub>
<mi>&Delta;&tau;</mi>
<mi>ij</mi>
</msub>
<mrow>
<mo>(</mo>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
<mo>)</mo>
</mrow>
<mo>=</mo>
<munderover>
<mi>&Sigma;</mi>
<mrow>
<mi>k</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>m</mi>
</munderover>
<msubsup>
<mi>&Delta;&tau;</mi>
<mi>ij</mi>
<mi>k</mi>
</msubsup>
<mrow>
<mo>(</mo>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
<mo>)</mo>
</mrow>
</mrow>
Wherein, ρ is pheromones volatilization factor, and 1- ρ then remain the factor for pheromones；Δτij(t+1) it is t+1 moment circuits (i, j)
On pheromone concentration increment；Pass through the pheromone concentration increment that circuit (i, j) is produced at the t+1 moment for ant k.
5. method according to claim 4, it is characterised in that the ant k is produced at the t+1 moment by circuit (i, j)
Pheromone concentration incrementRepresented using below equation：
Wherein, Q is the pheromone concentration of the every circuit initialized；P is cable line way to be selected；eijFor 0-1 variables, work as circuit
(i, j) is 1 when having ant to pass through, and is otherwise 0；wijFor the construction cost of circuit (i, j)；Ring_rate is cyclic rate；For
Cyclic rate pre-set threshold value.
6. a kind of power telecom network line optimization device based on ant group algorithm, it is characterised in that described device includes：
Acquisition module, the construction cost for obtaining circuit between communication network site information and each website；
Initialization module, the pheromone concentration for initializing every circuit；
Distribute module, for being randomly assigned at least one ant for website each described；
Mobile module, is moved to a website adjacent with being currently located website based on transition probability for each ant, obtained
One communication network figure, the transition probability is determined according to the pheromone concentration and construction cost of every circuit；
First judge module, is less than pre-set threshold value for judging whether the communication network figure meets connective and cyclic rate；
Second judge module, for judging whether the construction cost of the communication network figure is current minimum construction cost；
Update module, for updating the pheromone concentration of circuit selected by each ant and communication network figure, iterations reaches pre-
If exporting the minimum communication network figure of construction cost after number of times.
7. device according to claim 6, it is characterised in that the information of every circuit is initialized in the initialization module
Plain concentration initialization value is a constant, and the pheromone concentration initialization value of all circuits is equal.
8. device according to claim 6, it is characterised in that the mobile module transition probability uses below equation table
Show：
<mrow>
<msup>
<msub>
<mi>P</mi>
<mi>ij</mi>
</msub>
<mi>k</mi>
</msup>
<mrow>
<mo>(</mo>
<mi>t</mi>
<mo>)</mo>
</mrow>
<mo>=</mo>
<mfrac>
<mrow>
<msup>
<mrow>
<mo>[</mo>
<msub>
<mi>&tau;</mi>
<mi>ij</mi>
</msub>
<mrow>
<mo>(</mo>
<mi>t</mi>
<mo>)</mo>
</mrow>
<mo>]</mo>
</mrow>
<mi>&alpha;</mi>
</msup>
<mo>&CenterDot;</mo>
<msup>
<mrow>
<mo>[</mo>
<msub>
<mi>&eta;</mi>
<mi>ij</mi>
</msub>
<mo>]</mo>
</mrow>
<mi>&beta;</mi>
</msup>
</mrow>
<mrow>
<mi>&Sigma;</mi>
<msup>
<mrow>
<mo>[</mo>
<msub>
<mi>&tau;</mi>
<mi>ij</mi>
</msub>
<mrow>
<mo>(</mo>
<mi>t</mi>
<mo>)</mo>
</mrow>
<mo>]</mo>
</mrow>
<mi>&alpha;</mi>
</msup>
<mo>&CenterDot;</mo>
<msup>
<mrow>
<mo>[</mo>
<msub>
<mi>&eta;</mi>
<mi>ij</mi>
</msub>
<mo>]</mo>
</mrow>
<mi>&beta;</mi>
</msup>
</mrow>
</mfrac>
</mrow>
Wherein, Pij k(t) transition probability of circuit (i, j) is selected in t for ant k；τij(t) for circuit (i, j) in t
Pheromone concentration；ηijFor the heuristic function of circuit (i, j),dijFor the construction cost of circuit (i, j)；α is information
Plain concentration factor of influence；β is visibility factor.
9. device according to claim 7, it is characterised in that each ant is updated using below equation in the update module
The pheromone concentration of circuit selected by ant：
τij(t+1)=(1- ρ) τij(t)+Δτij(t+1)
<mrow>
<msub>
<mi>&Delta;&tau;</mi>
<mi>ij</mi>
</msub>
<mrow>
<mo>(</mo>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
<mo>)</mo>
</mrow>
<mo>=</mo>
<munderover>
<mi>&Sigma;</mi>
<mrow>
<mi>k</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>m</mi>
</munderover>
<msubsup>
<mi>&Delta;&tau;</mi>
<mi>ij</mi>
<mi>k</mi>
</msubsup>
<mrow>
<mo>(</mo>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
<mo>)</mo>
</mrow>
</mrow>
Wherein, ρ is pheromones volatilization factor, and 1- ρ then remain the factor for pheromones；Δτij(t+1) it is t+1 moment circuits (i, j)
On pheromone concentration increment；Increase for the ant k pheromone concentrations produced at the t+1 moment by circuit (i, j)
Amount.
10. device according to claim 9, it is characterised in that the ant k is produced at the t+1 moment by circuit (i, j)
Pheromone concentration incrementRepresented using below equation：
Wherein, Q is the pheromone concentration of the every circuit initialized；P is cable line way to be selected；eijFor 0-1 variables, work as circuit
(i, j) is 1 when having ant to pass through, and is otherwise 0；wijFor the construction cost of circuit (i, j)；Ring_rate is cyclic rate；For
Cyclic rate pre-set threshold value.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410851070.8A CN104617985B (en) | 2014-12-31 | 2014-12-31 | Power telecom network line optimization method and device based on ant group algorithm |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410851070.8A CN104617985B (en) | 2014-12-31 | 2014-12-31 | Power telecom network line optimization method and device based on ant group algorithm |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104617985A CN104617985A (en) | 2015-05-13 |
| CN104617985B true CN104617985B (en) | 2017-09-19 |
Family
ID=53152296
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410851070.8A Expired - Fee Related CN104617985B (en) | 2014-12-31 | 2014-12-31 | Power telecom network line optimization method and device based on ant group algorithm |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104617985B (en) |
Families Citing this family (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105426992B (en) * | 2015-11-09 | 2021-11-16 | 江苏理工学院 | Mobile robot traveler optimization method |
| CN105717926A (en) * | 2015-11-09 | 2016-06-29 | 江苏理工学院 | Mobile robot traveling salesman optimization method based on improved ant colony algorithm |
| CN105871724B (en) * | 2016-03-21 | 2018-12-25 | 广州供电局有限公司 | Power telecom network line optimization method and system |
| CN106209460B (en) * | 2016-07-14 | 2019-06-11 | 国网江苏省电力公司电力科学研究院 | Power failure system restoration path optimization method based on network flow theory |
| CN106230615A (en) * | 2016-07-18 | 2016-12-14 | 国家电网公司 | A kind of business work order activating method based on intelligence route searching |
| CN106230716B (en) * | 2016-07-22 | 2019-05-21 | 江苏省电力公司信息通信分公司 | Method for searching path and energy communication service concocting method based on ant group algorithm |
| CN106789408B (en) * | 2016-12-06 | 2020-02-14 | 中国联合网络通信有限公司山东省分公司 | Method for calculating ring forming rate of IPRAN network access layer equipment |
| CN109523089A (en) * | 2018-11-30 | 2019-03-26 | 国网西藏电力有限公司 | A kind of artificial intelligence approach in the power distribution network path planning of high altitude localities |
| CN110290001B (en) * | 2019-06-26 | 2022-04-19 | 广东电网有限责任公司 | Single-chain structure optimization method, device and equipment for power communication network |
| CN110557275B (en) * | 2019-07-12 | 2020-09-25 | 广东电网有限责任公司 | Electric power communication network detection station selection algorithm based on network intrinsic characteristics |
| CN113556728B (en) * | 2021-06-07 | 2023-09-22 | 北京邮电大学 | Ad hoc network route based on composite pheromone concentration field ant colony algorithm |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101667972B (en) * | 2009-10-19 | 2011-09-28 | 国网信息通信有限公司 | Power communication network service routing method and device |
| CN103002520B (en) * | 2012-06-06 | 2015-05-20 | 北京邮电大学 | Method for multi-mode terminal to select target networks with guaranteed quality of service |
| CN103281245B (en) * | 2013-04-26 | 2016-02-24 | 广东电网公司电力调度控制中心 | Determine method and the device of business routed path |
-
2014
- 2014-12-31 CN CN201410851070.8A patent/CN104617985B/en not_active Expired - Fee Related
Also Published As
| Publication number | Publication date |
|---|---|
| CN104617985A (en) | 2015-05-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104617985B (en) | Power telecom network line optimization method and device based on ant group algorithm | |
| CN107566194A (en) | A kind of method for realizing the mapping of cross-domain virtual network network | |
| CN103840967A (en) | Method for locating faults in power communication network | |
| CN101702655A (en) | Layout method and system of network topological diagram | |
| CN105282038A (en) | Distributed asterism networking optimization method based on stability analysis and used in mobile satellite network | |
| CN105721192A (en) | Method and apparatus for realizing capacity planning | |
| CN105208622B (en) | A kind of route selection method and method for managing route table of the router-table structure that high-efficiency dynamic is safeguarded automatically | |
| CN104466959A (en) | Power system key line identification method and system | |
| CN109067453A (en) | The elastic routing algorithm of the unpredictable interruption of satellite DTN network based on space-time graph model | |
| CN102546440B (en) | Routing and wavelength assignment method and system | |
| CN106685745A (en) | Network topology construction method and device | |
| CN107483079A (en) | Double population genetic Ant Routing algorithms of low-voltage powerline carrier communication | |
| CN105610707A (en) | Implementation method of AntNet routing algorithm in two-dimensional mesh topology network-on-chip | |
| CN106612232A (en) | Concentrator initiative meter-reading routing method suitable for variable factors | |
| CN106067074A (en) | A kind of by optimizing the method that the on off state of link promotes network system robustness | |
| Li et al. | Demonstration of alarm knowledge graph construction for fault localization on ONOS-based SDON platform | |
| CN110290001A (en) | Single-stranded structure optimization method, device and the equipment of power telecom network | |
| CN110808911B (en) | Networking communication routing method based on ant colony pheromone | |
| Maniscalco et al. | Binary and m-ary encoding in applications of tree-based genetic algorithms for QoS routing | |
| CN116634504A (en) | Unmanned aerial vehicle networking topology relation and bandwidth allocation optimization strategy based on improved NSGA-II algorithm | |
| Li et al. | Lifetime optimization for reliable broadcast and multicast in wireless ad hoc networks | |
| CN105429793A (en) | Communication network weighted link importance degree assessment method | |
| CN106603294A (en) | Comprehensive vulnerability assessment method based on power communication network structure and state | |
| CN103096412B (en) | Data fusion method with time delay restriction in delay tolerant network | |
| CN109934486A (en) | A method of extracting the differentiation of multipotency stream load nargin and its interaction feature in faults coupling communication process |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20170919 |