CN106953768A - A kind of network reliability model and mixing intelligent optimizing method - Google Patents
A kind of network reliability model and mixing intelligent optimizing method Download PDFInfo
- Publication number
- CN106953768A CN106953768A CN201710238749.3A CN201710238749A CN106953768A CN 106953768 A CN106953768 A CN 106953768A CN 201710238749 A CN201710238749 A CN 201710238749A CN 106953768 A CN106953768 A CN 106953768A
- Authority
- CN
- China
- Prior art keywords
- represent
- network
- link
- node
- max
- 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.)
- Pending
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/14—Network analysis or design
- H04L41/145—Network analysis or design involving simulating, designing, planning or modelling of a network
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/08—Configuration management of networks or network elements
- H04L41/0803—Configuration setting
- H04L41/0823—Configuration setting characterised by the purposes of a change of settings, e.g. optimising configuration for enhancing reliability
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/12—Discovery or management of network topologies
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention belongs to network communication technology field, disclose a kind of network reliability model and mixing intelligent optimizing method, network reliability model adds Survivabilities of Networks relevant evaluation index, design is optimized from two angles of survivability and survivability, and allow node to be failed with certain probability among optimization design, design is optimized to network topology structure, the single defect of existing reliability model restrictive condition is overcome, more improves and meets practical application scene.Optimization method of the present invention is poor for the local search ability of genetic algorithm, overall search ability is stronger, and ant group algorithm overall search ability is poor, the characteristics of local search ability is stronger, propose the integrated intelligent algorithm that genetic algorithm and ant group algorithm are combined, learn from other's strong points to offset one's weaknesses, overcome the defect of single intelligent algorithm inherently, improve the solution quality understood.
Description
Technical field
The invention belongs to network communication technology field, a kind of network reliability model and mixing intelligent optimizing side are related generally to
Method.
Background technology
Network system is real-life important system structure, such as power network, communication network, computer network all
It is the infrastructure involved the interests of the state and the people, they all have network topology structure, its reliability performance directly influences social peace
Complete and people's lives.Network system once breaks down, it will cause great to the living of people, economic and social safety etc.
Influence.Therefore, the reliability of network is increasingly valued by people.Reliability can substantially go to consider in terms of three:Network
Survivability, validity and survivability.The survivability of network refers to the network for having certain failure probability for node or link,
Under randomness destruction, network can keep the probability of connection.Survivabilities of Networks is the reliability ginseng based on topological structure
Number, does not consider the reliability of network edge and node, and measurement is that node in a network or side occur weathering or disliked
Under conditions of meaning attack, network topology structure keeps the ability of connection.There are many documents both at home and abroad with regard to the anti-of network topology structure
Ruining property, which is estimated, to be studied, and Main Conclusions has figure resistance degree, algebraic connectivity etc..Validity be then based on network performance can
By property index, represent that network system meets the degree of communication service performance requirement under network components failure condition.Network is reliable
Property optimization problem is a NP-Hard combinatorial problems, and it includes:1) using network reliability as constraints, minimization is invested into
This;2) using cost of investment as constraints, maximize network reliability.Wherein, the former is the Hou Zheshi using operator as starting point
Using user as starting point.
Existing more researcher deploys to study from the angle of survivability to network reliability at present.Integrity problem is
It is NP-Hard problems to be certified as, and ordinary circumstance people can not obtain the optimal solution of problem.Basima Elshqeirat exist
Topology design with minimal cost subject to network reliability constraint mono-
Solve the problems, such as Network Topology Design under reliability restrictive condition based on dynamic programming in text.The algorithm is first with three inspirations
Formula method produces k spanning tree sequence, and the k spanning tree sequence then produced using each heuristic correspondence produces excellent
Change result.Berna Dengiz et al. are in A self-tuning heuristic for the design of
The minimization under reliability restrictive condition is solved using self-adjusting heuristic in the texts of communication networks mono-
The network reliability optimization problem of cost of investment.The above research is typically taken when optimizing solution to reliability model
Heuristic or single intelligent algorithm, but because the latent defect of algorithm inherently, solving result is easily trapped into part most
Excellent solution.When reliability model is analyzed, research all assumes that node is completely reliable in the past, carries out network reliability topological optimization and sets
Meter, actually this does not meet actual conditions.In addition, the survivability problem of network is only considered in research in the past, with
Full terminal reliability is directed to the survivability problem of network as network survivability metric objective, in model optimization research not
Consider calculation of correlation index.
In summary, the problem of prior art is present be:Current reliability model does not consider node when model is set up
The situation of failure, does not meet practical situation;Restrictive condition is single among model, and simply carrying out reliability from the angle of survivability opens up
Optimization design is flutterred, the survivability energy of network is not considered, the network according to designed by optimizing existing reliability model out may
Survival properties are preferably but survivability can be poor;Latent defect of the current reliability optimized algorithm due to algorithm inherently, it is required
Optimum results are easily trapped into local optimum.
The content of the invention
The problem of existing for prior art, the invention provides a kind of network reliability model and mixing intelligent optimizing side
Method.
The present invention is achieved in that a kind of network reliability model, and the network reliability model is:
S.T.R(X)≥R0 (2)
aij=aji=xij (4)
di>=2, i=1,2 ..., N (6)
L (G)=D (G)-A (G) (7)
λ1≤λ2≤…≤λN (8)
Formula (2-3) represents that the full Terminal Reliability of network is not less than the full Terminal Reliability of minimum requirements;Formula (4-6) represents net
Node degree is both greater than the connected graph for being equal to that 2, i.e. network are a constraints of satisfaction 2 among network topological diagram;Formula (7-9) represents network
Algebraic connectivity be not less than minimum requirements algebraic connectivity;Formula (10-12) represents that the figure resistance degree of network is wanted not less than minimum
Seek figure resistance degree;
Wherein, the physical topology of network is G (V, E), node set V={ vi| i=1,2 ... N } represent network equipment collection
Close;Wherein, N represents the number of node in network;lijRepresent node viAnd vjBetween link, and the collection of link is combined into E { lij|
i,j∈N};
F (X) represents object function;C*Represent the figure resistance degree after normalization;Represent minimum requirements figure resistance degree;cijTable
Show the link cost of i and j point-to-point transmissions;R (X) represents full Terminal Reliability;R0Represent the full Terminal Reliability of minimum requirements;RGRepresent
Scheme resistance degree;xijRepresent link decisions variable, xij=1 expression node i and j have direct link connection, xij=0 represent node i and
J is connected without direct link;X{x12,x13,…,xij,…,x(N-1)NRepresent a kind of network topology link combinations;λ0Represent minimum to want
Seek algebraic connectivity;λ2Representation algebra degree of communication;A (G) represents figure G adjacency matrix;aijRepresent the i-th of figure G adjacency matrix
Row jth column element;D (G) represents figure G node degree diagonal matrix;dijRepresent the i-th row jth row of figure G node degree diagonal matrix
Element;diRepresent node degree;L (G) represents figure G Laplacian Matrix;λiRepresent L (G) ith feature value;peRepresent link
Reliability;pvRepresent node point reliability.
It is described another object of the present invention is to provide a kind of mixing intelligent optimizing method of the network reliability model
Optimization method comprises the following steps:
Step one, initialize:Initialization information element, link cost matrix, nodal information, link information, initial solution xout;
Given population scale pop, crossover probability pc, mutation probability pm, the maximum evolutionary generation g of hereditymax;Randomly generate and meet constraints
Initial population, and make hereditary initial evolutionary generation g=0;
Step 2, by just when assessing the individual in population, by fitness function value and x maximum in populationoutFitness
Functional value is compared, if being more than, and its corresponding x is assigned into xout;Otherwise, xoutKeep constant;
Step 3, by the roulette selection method of optimum maintaining strategy, is intersected and mutation operation;
Step 4, iterative algebra g=g+1;
Step 5, if g > gmax, then stop, and export xout, go to step six;Otherwise, two are gone to step;
Step 6, according to xoutValue fresh information element, and the another initial evolutionary generation t=0 of ant colony;
Step 7, ant colony search is carried out according to node transition rule;
Pheromones on link are updated by step 8;
Step 9, iterative algebra t=t+1 judges whether to meet end condition, if satisfaction, exports statistical information, program
Terminate;Otherwise seven are gone to step.
Further, binary coding mode is used to population at individual, there is link between two nodes is represented with 1, otherwise
Represented with 0;One chromosome of each X correspondences;For the network that node number is N, N is up among its map network topological diagram
(N-1)/2 side, chromosome is defined as the bit string that length is equal to N (N-1)/2.
Further, object function and fitness function separately design for:
Object function:Z (X)=f (X);
Fitness function:F (X)=Cmax-f(X);
Wherein, CmaxLink totle drilling cost when connecting entirely for network topology structure.
Further, using the roulette selection strategy of optimum maintaining strategy;First, by fitness function value in current population
Highest individual is intactly copied in population of future generation;Then, by roulette selection strategy execution selection operation.
Further, the crossover operation is using single-point interleaved mode, random two parent chromosomes of selection from population,
The interval random number p of regeneration one (0,1)randomIf, prandomLess than crossover probability pc, then a gene location is randomly choosed
As cross-point locations, crossover operation is carried out to two individuals, the chromosome after intersection is put into progeny population;If prandomNo
Less than crossover probability, then two individual holdings are constant, and parent individuality is copied directly in progeny population;Crossover probability pcAnd evolution
Function p associated algebraically ic(i), computing formula:
pc(i)=pc_min+(pc_max-pc_min)×i/gmax;
Wherein, pc(i) crossover probability in the i-th generation, p are representedc_maxRepresent the maximum crossover probability of setting, pc_minRepresent setting
Minimum crossover probability, gmaxRepresent the maximum evolutionary generation of hereditary section sets among algorithm;
The mutation operation is using the method uniformly made a variation, for each gene in chromosome, generates (0, a 1) area
Between random number prandom;If prandomLess than mutation probability pm, then the value on the gene location of this in chromosome is become another
Virtual value;If prandomNot less than mutation probability, then the value holding on gene location is constant;Mutation probability and genetic evolution algebraically i
Associated function pm(i), computing formula:
pm(i)=pm_min+(pm_max-pm_min)×i/gmax;
Wherein, pm(i) mutation probability in the i-th generation, p are representedm_maxRepresent the maximum mutation probability of setting, pm_minRepresent setting
Minimum mutation probability, gmaxRepresent the maximum evolutionary generation of hereditary section sets among algorithm.
Further, global renewal is carried out to pheromones on link according to formula:
τij(new)=(1-p) τij(old)+Δτij;
If ant k have selected link (i, j);
Wherein m is the quantity of ant, and Q represents pheromones intensity, Δ τijFor pheromones on this circulation link (i, j)
Increment, p is pheromones volatilization factor, τij(old) it is the pheromone concentration on link (i, j) before this circulation, τij(new) it is
Pheromone concentration after this circulation on link (i, j).
Another object of the present invention is to provide a kind of network topology structure of the application network reliability model.
Advantages of the present invention and good effect are:Network reliability Optimized model proposed by the present invention adds network survivability
Property relevant evaluation index, design is optimized from two angles of survivability and survivability, and allows among optimization design node
Failed with certain probability, design is optimized to network topology structure, existing reliability model restrictive condition is overcome single
Defect, more improve and meet practical application scene.Heredity proposed by the present invention and ant colony integrated intelligent algorithm MGACA, pin
Local search ability to genetic algorithm (Genetic Algorithm, GA) is poor, and overall search ability is stronger, and ant colony is calculated
Method (Ant Colony Optimization, ACO) overall search ability is poor, the characteristics of local search ability is stronger, by GA and
ACO is combined, and is learnt from other's strong points to offset one's weaknesses, and overcomes the defect of single intelligent algorithm inherently, improves the solution quality understood.With it is existing
Network reliability model method it is different, the present invention constructs a kind of new reliability model, and proposes genetic algorithm and ant
The integrated intelligent algorithm that group's algorithm is combined searches out optimal network topology link allocation method.
Brief description of the drawings
Fig. 1 is the mixing intelligent optimizing method flow chart of network reliability model provided in an embodiment of the present invention.
Fig. 2 is that the mixing intelligent optimizing method of network reliability model provided in an embodiment of the present invention realizes flow chart.
Fig. 3 is that algorithm performance is contrasted when node number provided in an embodiment of the present invention is 10.
Fig. 4 is that algorithm performance is contrasted when node number provided in an embodiment of the present invention is 15.
Fig. 5 is that algorithm performance is contrasted when node number provided in an embodiment of the present invention is 14.
Comparative result schematic diagram when Fig. 6 is algebraic connectivity change provided in an embodiment of the present invention.
Embodiment
In order to make the purpose , technical scheme and advantage of the present invention be clearer, with reference to embodiments, to the present invention
It is further elaborated.It should be appreciated that the specific embodiments described herein are merely illustrative of the present invention, it is not used to
Limit the present invention.
The application principle of the present invention is explained in detail below in conjunction with the accompanying drawings.
As shown in figure 1, the mixing intelligent optimizing method of network reliability model provided in an embodiment of the present invention is including following
Step:
S101:Network node sum, link cost matrix, link reliability information, node reliability information etc. are inputted, just
Beginning time genetic algorithm parameter;
S102:Randomly generate the initial population for meeting constraints;
S103:Individual fitness function is assessed in population;
S104:Using the roulette selection method of optimum maintaining strategy.First, by fitness function value in current population most
High individual is intactly copied in population of future generation;Secondly, by roulette selection strategy execution selection operation;
S105:Intersect and make a variation;
S106:Judge whether current cycle time is less than maximum iteration:If current cycle time changes less than maximum
Generation number, then cycle-index adds 1, and goes to step S103;If current cycle time is equal to maximum iteration, terminates heredity and calculate
Method step, output result, and go to step S107;
S107:The result fresh information element exported according to genetic algorithm, initializes to the parameter in ant group algorithm, joins
Number includes the maximum evolutionary generation of ant colony, globally optimal solution and iteration optimal solution etc.;
S108:The probability selection path that ant calculates according to state transition probability formula;
S109:Global renewal is carried out to the pheromones on link according to formula;
S110:Judge whether current cycle time is less than maximum iteration:If current cycle time changes less than maximum
Generation number, then cycle-index adds 1, and goes to step S108;If current cycle time is equal to maximum iteration, terminate ant colony
Search, exports statistical information, EP (end of program).
The application principle of the present invention is further described below in conjunction with the accompanying drawings.
1. technical scheme
1.1 degree of reiability indexs
(1) survivability is measured
The survivability of network refers to the network for having certain failure probability for node or link, in randomness destruction
Under, the probability of network-in-dialing can be kept.Survivability is that the knowledge based on probability theory and graph theory puts forward, and describes randomness
The influence of destruction and network topology structure to network reliability.
The present invention is full Terminal Reliability for the Measure Indexes selection of survivability, i.e., among probability graph, any two section
There is the probability of normal operation link between point, survival ability of the whole network in the case of unit failure can be weighed.
(2) survivability is measured
Survivabilities of Networks is the dependability parameter based on topological structure, and the node in network and the reliability on side are not considered,
Weigh be node in a network or weathering or under conditions of deliberately being attacked, network topology structure holding occurs for side
The ability of connection.The survivability of network refers at least need the key node or critical link that destroy many small numbers, caused whole
Network is split into several subnets or disappearance critical path, so that the ability of the communication between interrupt unit node.Survivability is ground
Study carefully the topological structure intrinsic mainly by analyzing network, primary metric parameter is figure resistance degree, algebraic connectivity etc..The present invention
Using algebraic connectivity, scheme Measure Indexes of the resistance degree as Survivabilities of Networks.
1) algebraic connectivity
If G (V, E) is a undirected simple graph.Figure G adjacency matrix be designated as A (G), make D (G) be G Vertex Degree it is diagonal
Matrix, defines G Laplacian Matrix L (G)=D (G)-A (G), if L (G) eigenvalue λ1,λ2,…λNMeet λ1≤λ2
≤…≤λN。λ2Referred to as G algebraic connectivity, is designated as α (G).
2) figure resistance degree
If G (V, E) is a undirected simple graph.Figure G adjacency matrix be designated as A (G), make D (G) be G Vertex Degree it is diagonal
Matrix, defines G Laplacian Matrix L (G)=D (G)-A (G), if L (G) eigenvalue λ1,λ2,…λNMeet λ1≤λ2
≤…≤λN.Wherein, N is network node number, RGReferred to as scheme resistance degree, computing formula is as follows.
1.2 reliability optimization models
If the physical topology of given network is G (V, E), node set V={ vi| i=1,2 ... N } represent network equipment collection
Close.Wherein, N represents the number of node in network;lijRepresent node viAnd vjBetween link, and the collection of link is combined into E { lij|
i,j∈N}。
The implication of variable symbol is as follows:
f(X):Object function;
C*:Figure resistance degree after normalization;
:Minimum requirements figure resistance degree;
cij:The link cost of i and j point-to-point transmissions;
R(X):Full Terminal Reliability;
R0:The full Terminal Reliability of minimum requirements;
RG:Scheme resistance degree;
xij:Link decisions variable, xij=1 expression node i and j have direct link connection, xij=0 represent node i and j without
Direct link is connected;
X:{x12,x13,…,xij,…,x(N-1)NA kind of network topology link combinations;
λ0:Minimum requirements algebraic connectivity;
λ2:Algebraic connectivity;
A(G):Scheme G adjacency matrix;
aij:Scheme the i-th row jth column element of G adjacency matrix;
D(G):Scheme G node degree diagonal matrix;
dij:Scheme the i-th row jth column element of G node degree diagonal matrix;
di:Node degree;
L(G):Scheme G Laplacian Matrix;
λi:L (G) characteristic value;
pe:Link reliability;
pv:Node point reliability;
Model hypothesis condition:
(1) network node number is given and corresponding reliability is to determine;
(2) cost and reliability of each of the links are to determine;
(3) each of the links is two-way, and can only have a link between node i and node j;
(4) each of the links has two states, i.e. normal and failure, and link failure is statistical iteration;
(5) each node has two states, i.e. normal and failure, and node failure is statistical iteration;
(6) system is unrepairable;
Based on above description, present invention construction reliability optimization model shown below.
S.T.R(X)≥R0Formula (2)
aij=aji=xijFormula (4)
di>=2, i=1,2 ..., N formulas (6)
L (G)=D (G)-A (G) formula (7)
λ1≤λ2≤…≤λNFormula (8)
Formula (2-3) represents that the full Terminal Reliability of network is not less than the full Terminal Reliability of minimum requirements;Formula (4-6) represents net
Node degree is both greater than the connected graph for being equal to that 2, i.e. network are a constraints of satisfaction 2 among network topological diagram;Formula (7-9) represents network
Algebraic connectivity be not less than minimum requirements algebraic connectivity;Formula (10-12) represents that the figure resistance degree of network is wanted not less than minimum
Seek figure resistance degree.
1.3 mixing intelligent optimizing algorithms
The present invention is poor for the local search ability of genetic algorithm (Genetic Algorithm, GA), ability of searching optimum
It is relatively strong, and ant group algorithm (Ant Colony OptimizationACO) overall search ability is poor, local search ability is stronger
The characteristics of, GA and ACO are combined, learnt from other's strong points to offset one's weaknesses, construction integrated intelligent algorithm MGACA (Mixed Gene and Ant
Colony Algorithm).Its basic ideas is that algorithm early stage carries out global search using genetic algorithm, utilizes genetic algorithm
Global convergence, rapidity, randomness, its Search Results produce the initial information element distribution of relevant issues.The algorithm later stage uses
Ant group algorithm, in the case where there is initial information element distribution, makes full use of ant group algorithm positive feedback, concurrency, refinement solution effect
The features such as rate is high.
The step that implements of the optimization method of inventive network reliability model is:
(1) initialize:Initialization information element, link cost matrix, nodal information, link information, initial solution xoutDeng;Give
Determine population scale pop, crossover probability pc, mutation probability pm, the maximum evolutionary generation g of hereditymax;Randomly generate and meet constraints
Initial population, and make hereditary initial evolutionary generation g=0;
(2) press just when assessing each individual in population, by fitness function value and x maximum in populationoutFitness
Functional value is compared, if being more than, and its corresponding x is assigned into xout;Otherwise, xoutKeep constant;
(3) the roulette selection method of optimum maintaining strategy is pressed, is intersected and mutation operation;
(4) iterative algebra g=g+1;
(5) if g > gmax, then stop, and export xout, turn (6);Otherwise, turn (2);
(6) according to xoutValue fresh information element, and the another initial evolutionary generation t=0 of ant colony;
(7) ant colony search is carried out according to node transition rule;
(8) Pheromone update;
(9) iterative algebra t=t+1, judges whether to meet end condition, if meeting, exports statistical information, program knot
Beam;Otherwise turn (7);
As shown in Fig. 2 the optimization method of inventive network reliability model to implement step as follows:
Step 1:Network node sum, link cost matrix, link reliability information, node reliability information etc. are inputted,
Initialize genetic algorithm parameter.
Step 2:Randomly generate the initial population for meeting constraints
The present invention uses binary coding bit string to population at individual, and there is link between two nodes is represented with 1, is otherwise used
0 represents.One chromosome of each X correspondences, chromosome uses binary coding.For the network that node number is N, its correspondence net
It is up to N (N-1)/2 side in network figure, therefore chromosome is defined as the bit string that length is equal to N (N-1)/2.
The coding form for representing this network is:
[x12 x13 x14 x15 x23 x24 x25 x34 x35 x45]
[1 1 0 1 1 0 1 1 0 1]
Step 3:Individual fitness function is assessed in population
Fitness function is a kind of standard judged the quality of genetic algorithm solution, and fitness function value is that heredity is entered
The Main Basiss of row selection operation, for the minimization cost optimization model in the present invention, object function and fitness function point
It is not designed as:
Object function:Z (X)=f (X);
Fitness function:F (X)=Cmax-f(X);
Wherein CmaxLink totle drilling cost when connecting entirely for network topology structure.
Step 4:Selection operation
The present invention uses the roulette selection strategy of optimum maintaining strategy.First, by fitness function value in current population
Highest individual is intactly copied in population of future generation;Secondly, by roulette selection strategy execution selection operation;The strategy
Advantage is the individual that obtained result is the highest fitness occurred in successive dynasties population when Genetic Algorithms are terminated.
Step 5:Intersect and make a variation
1) crossover operation
So the present invention uses single-point interleaved mode.Its concrete operations is two parent dyeing of random selection from population
Body, the interval random number p of regeneration one (0,1)randomIf, prandomLess than crossover probability pc, then a gene is randomly choosed
Position carries out crossover operation to two individuals, the chromosome after intersection is put into progeny population as cross-point locations;If
prandomNot less than crossover probability, then two individual holdings are constant, and parent individuality is copied directly in progeny population.
With the gradually increase of genetic evolution algebraically, the individual in population is become better and better.To keep individual many in population
Sample, it is to avoid optimum results are absorbed in local optimum, overcomes Premature convergence, makes crossover probability pcWith controllability, make pcWith
The increase of evolutionary generation and gradually increase.Therefore, a crossover probability p is set up among algorithmcIt is associated with evolutionary generation i
Function pc(i), computing formula is as follows:
pc(i)=pc_min+(pc_max-pc_min)×i/gmax
Wherein, pc(i) crossover probability in the i-th generation, p are representedc_maxRepresent the maximum crossover probability of setting, pc_minRepresent setting
Minimum crossover probability, gmaxRepresent the maximum evolutionary generation of hereditary section sets among algorithm.
2) mutation operation
The main function of mutation operation is to increase the diversity of individuals of population, and it is various that uniform variation can increase individual well
Property, so algorithm proposed by the present invention is using the method uniformly made a variation.Its basic operation is:For each base in chromosome
Cause, the interval random number p of generation one (0,1)random.If prandomLess than mutation probability pm, by the gene location of this in chromosome
On value be changed into another virtual value;If prandomNot less than mutation probability, then the value holding on gene location is constant.
Equally, to avoid Premature Convergence, algorithm proposed by the present invention makes the value of mutation probability have certain controllability, built
Found the mutation probability function p associated with genetic evolution algebraically im(i), computing formula is as follows:
pm(i)=pm_min+(pm_max-pm_min)×i/gmax
Wherein, pm(i) mutation probability in the i-th generation, p are representedm_maxRepresent the maximum mutation probability of setting, pm_minRepresent setting
Minimum mutation probability, gmaxRepresent the maximum evolutionary generation of hereditary section sets among algorithm.
Step 6:Judge whether current cycle time is less than maximum iteration:If current cycle time changes less than maximum
Generation number, then cycle-index adds 1, and goes to step 3;If current cycle time is equal to maximum iteration, terminate genetic algorithm
Step, exports xout, and go to step 7.
Step 7:According to xoutValue fresh information element, and the parameter in ant group algorithm is initialized, parameter includes ant
The maximum evolutionary generation of group, globally optimal solution and iteration optimal solution etc..
Step 8:The probability selection path that ant calculates according to state transition probability formula.
Step 9:Global renewal is carried out to the pheromones on link according to formula.
τij(new)=(1-p) τij(old)+Δτij;
If ant k have selected link (i, j);
Wherein m is the quantity of ant, and Q represents pheromones intensity, Δ τijFor pheromones on this circulation link (i, j)
Increment, p is pheromones volatilization factor, τij(old) it is the pheromone concentration on link (i, j) before this circulation, τij(new) it is
Pheromone concentration after this circulation on link (i, j).
Step 10:Judge whether current cycle time is less than maximum iteration:If current cycle time is less than maximum
Iterations, then cycle-index adds 1, and goes to step 8;If current cycle time is equal to maximum iteration, terminate ant colony
Search, exports statistical information, EP (end of program).
The application effect of the present invention is explained in detail with reference to emulation.
Condition set by Computer Simulation of the present invention is as follows:
Experimental situation:Software test and emulation are carried out under Microsoft Windows XP operating system environments, is owned
Emulation is all run in Hewlett-Packard's computer (four cores, CPU frequency 3.30GHz, internal memory 4GB), and Imitation Development Platform is
JDK1.7.0_25+Eclipse, source code is write using Java language.
In order to embody performance of the MGACA algorithms under different scenes, choose three typical telecommunications networks and tested, one
The network for being N=10 for node number, secondly being the network that node number is interior N=15.This corresponding net of two groups of test problems
Network topology link maximum number be respectively 45,105, the coded system that problem is used forBinary coding bit string, this
Search space corresponding to two groups of test problem solutions is respectively 245,2105, so that different search is crossed in the test of algorithm
Space, it is ensured that the general properties of test of heuristics.Finally, a kind of emulation topology knot conventional to node number N=14 classics
Structure NSFnet topologys re-start the optimization of reliability Topology connection, verify the actual applicability suggested plans.
Other simulated environment parameter configurations are:Link reliability ρe=0.95, node point reliability pv=0.98, each link into
This (unit:Member) it is the integer randomly generated between [1,100], R0=0.95, λo=0.7,Crossover probability lower limit
For 0.5, the upper limit is 0.9, and heredity maximum evolutionary generation and the maximum evolutionary generation of ant colony are set to 6000, population scale and ant
Number is set to 50, and pheromones volatilization factor is set to ρ=0.5.
In order to be able to the performance of preferably testing algorithm, for each test problem, by MGACA algorithms and it is recently proposed
STH (Self-tuning Heuristic) algorithm is analyzed, to verify the performance of MGACA algorithms.
In order to be able to preferably compare the optimization performance of two kinds of algorithms, for each test problem, two kinds of algorithms are by calculating
Machine carries out 10 random experiments, takes 10 simulation results to be contrasted and analyzed as output data.
The Optimization Solution quality of algorithm refers to the height for being eventually found solution quality, for Optimized model of the present invention,
Ensure under conditions of reliability requirement, the solution correspondence target function value found out is smaller, then the solution effect of algorithm is better.
In following simulation result figure, the longitudinal axis of accompanying drawing 3 to 5 represents network cost, characterizes algorithm optimization and solves matter
The ability of amount;The transverse axis of accompanying drawing 3 to 5 represents experiment number;The transverse axis representation algebra degree of communication of accompanying drawing 6.
Accompanying drawing 3,4 and 5 gives the Comparative result of different node number MGACA algorithms and STH algorithms, from three figures all
As can be seen that the result of MGACA algorithms is better than STH algorithms.
Table 1 give the solution mass ratio of algorithm compared with.It can be seen that what MGACA was found out by the test result in table 1
Solution, either the average value of preferably solution, worst solution or solution is all best.Therefore, MGACA algorithms find out majorization of solutions quality
It is higher, demonstrate the validity of put forward algorithm.Table 2 gives these three test problems final prioritization scheme.
The Algorithm for Solving mass ratio of table 1 compared with
The prioritization scheme of table 2
Under same test scene, algorithm is also due to the difference of constraints, the result differed greatly.
In order to test influence of the different parameters to MGACA algorithm performances, we are provided with difference to node number for 10 test problem
Influence of the minimum requirements algebraic connectivity to network cost.Accompanying drawing 6 gives simulation result and compared.It can be seen that net
Network cost increases with the increase of the two, and the corresponding network cost of MGACA algorithms network cost corresponding compared with STH algorithms is low.
Presently preferred embodiments of the present invention is the foregoing is only, is not intended to limit the invention, all essences in the present invention
Any modification, equivalent and improvement made within refreshing and principle etc., should be included within the scope of the present invention.
Claims (7)
1. a kind of network reliability model, it is characterised in that the network reliability model is:
S.T. R(X)≥R0 (2)
aij=aji=xij (4)
di>=2, i=1,2 ..., N (6)
L (G)=D (G)-A (G) (7)
λ1≤λ2≤…≤λN (8)
Formula 2- formulas 3 represent that the full Terminal Reliability of network is not less than the full Terminal Reliability of minimum requirements;Formula 4- formulas 6 represent that network is opened up
Flutter node degree among figure and be both greater than the connected graph for being equal to that 2, i.e. network are a constraints of satisfaction 2;Formula 7- formulas 9 represent the generation of network
Number degree of communication is not less than minimum requirements algebraic connectivity;Formula 10- formulas 12 represent that the figure resistance degree of network is not less than minimum requirements figure
Resistance degree;
Wherein, the physical topology of network is G (V, E), node set V={ vi| i=1,2 ... N } represent sets of network devices;Its
In, N represents the number of node in network;lijRepresent node viAnd vjBetween link, and the collection of link is combined into E { lij|i,j∈
N};
F (X) represents object function;C*Represent the figure resistance degree after normalization;Represent minimum requirements figure resistance degree;cijRepresent i
With the link cost of j point-to-point transmissions;R (X) represents full Terminal Reliability;R0Represent the full Terminal Reliability of minimum requirements;RGExpression figure is supported
Anti- degree;xijRepresent link decisions variable, xij=1 expression node i and j have direct link connection, xij=0 represent node i and j without
Direct link is connected;X{x12,x13,…,xij,…,x(N-1)NRepresent a kind of network topology link combinations;λ0Represent minimum requirements
Algebraic connectivity;λ2Representation algebra degree of communication;A (G) represents figure G adjacency matrix;aijRepresent the i-th row of figure G adjacency matrix
Jth column element;D (G) represents figure G node degree diagonal matrix;dijRepresent the i-th row jth row member of figure G node degree diagonal matrix
Element;diRepresent node degree;L (G) represents figure G Laplacian Matrix;λiRepresent L (G) ith feature value;peRepresent that link is reliable
Degree;pvRepresent node point reliability.
2. a kind of mixing intelligent optimizing method of network reliability model as claimed in claim 1, it is characterised in that the mixing
Intelligent optimization method comprises the following steps:
Step one, initialize:Initialization information element, link cost matrix, nodal information, link information, initial solution xout;It is given
Population scale pop, crossover probability pc, mutation probability pm, the maximum evolutionary generation g of hereditymax;Randomly generate and meet the first of constraints
Beginning population, and make hereditary initial evolutionary generation g=0;
Step 2, by just when assessing the individual in population, by fitness function value and x maximum in populationoutFitness function
Value is compared, if being more than, and its corresponding x is assigned into xout;Otherwise, xoutKeep constant;
Step 3, by the roulette selection method of optimum maintaining strategy, is intersected and mutation operation;
Step 4, iterative algebra g=g+1;
Step 5, if g > gmax, then stop, and export xout, go to step six;Otherwise, two are gone to step;
Step 6, according to xoutValue fresh information element, and the another initial evolutionary generation t=0 of ant colony;
Step 7, ant colony search is carried out according to node transition rule;
Step 8, Pheromone update;
Step 9, iterative algebra t=t+1 judges whether to meet end condition, if satisfaction, exports statistical information, program knot
Beam;Otherwise seven are gone to step.
3. mixing intelligent optimizing method as claimed in claim 2, it is characterised in that binary coding side is used to population at individual
There is link between formula, two nodes to be represented with 1, otherwise represented with 0;One chromosome of each X correspondences;It is for node number
N (N-1)/2 side is up among N network, its map network topological diagram, chromosome is defined as length and is equal to N's (N-1)/2
Bit string.
4. mixing intelligent optimizing method as claimed in claim 2, it is characterised in that object function and fitness function are set respectively
It is calculated as:
Object function:Z (X)=f (X);
Fitness function:F (X)=Cmax-f(X);
Wherein CmaxNetwork totle drilling cost when all being connected for network topology structure link.
5. mixing intelligent optimizing method as claimed in claim 2, it is characterised in that selected using the roulette of optimum maintaining strategy
Select strategy;First, fitness function value highest individual in current population is intactly copied in population of future generation;Then,
By roulette selection strategy execution selection operation.
6. mixing intelligent optimizing method as claimed in claim 2, it is characterised in that the crossover operation uses single-point intersection side
Formula, randomly chooses two parent chromosomes, the interval random number p of regeneration one (0,1) from populationrandomIf, prandomIt is small
In crossover probability pc, then a gene location is randomly choosed as cross-point locations, and crossover operation is carried out to two individuals, will be intersected
Chromosome afterwards is put into progeny population;If prandomNot less than crossover probability, then two individual holdings are constant, and parent individuality is straight
Connect and copy in progeny population;Crossover probability pcThe function p being associated with evolutionary generation ic(i), computing formula:
pc(i)=pc_min+(pc_max-pc_min)×i/gmax;
Wherein, pc(i) crossover probability in the i-th generation, p are representedc_maxRepresent the maximum crossover probability of setting, pc_minRepresent setting most
Small crossover probability, gmaxRepresent the maximum evolutionary generation of hereditary section sets among algorithm;
The mutation operation is using the method uniformly made a variation, and for each gene in chromosome, generation one (0,1) is interval
Random number prandom;If prandomLess than mutation probability pm, then the value on the gene location of this in chromosome is become into another has
Valid value;If prandomNot less than mutation probability, then the value holding on gene location is constant;Mutation probability and genetic evolution algebraically i phases
The function p of associationm(i), computing formula:
pm(i)=pm_min+(pm_max-pm_min)×i/gmax;
Wherein, pm(i) mutation probability in the i-th generation, p are representedm_maxRepresent the maximum mutation probability of setting, pm_minRepresent setting most
Small mutation probability, gmaxRepresent the maximum evolutionary generation of hereditary section sets among algorithm.
7. mixing intelligent optimizing method as claimed in claim 2, it is characterised in that the pheromones on link are entered according to formula
Row global information element updates:
τij(new)=(1-p) τij(old)+Δτij;
Wherein m is the quantity of ant, and Q represents pheromones intensity, Δ τijFor the increasing of pheromones on this circulation link (i, j)
Amount, p is pheromones volatilization factor, τij(old) it is the pheromone concentration on link (i, j) before this circulation, τij(new) it is this
Pheromone concentration after secondary circulation on link (i, j).
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201710238749.3A CN106953768A (en) | 2017-04-13 | 2017-04-13 | A kind of network reliability model and mixing intelligent optimizing method |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201710238749.3A CN106953768A (en) | 2017-04-13 | 2017-04-13 | A kind of network reliability model and mixing intelligent optimizing method |
Publications (1)
Publication Number | Publication Date |
---|---|
CN106953768A true CN106953768A (en) | 2017-07-14 |
Family
ID=59475836
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201710238749.3A Pending CN106953768A (en) | 2017-04-13 | 2017-04-13 | A kind of network reliability model and mixing intelligent optimizing method |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN106953768A (en) |
Cited By (8)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN108960509A (en) * | 2018-06-29 | 2018-12-07 | 无锡易通精密机械股份有限公司 | A kind of manufacture system intelligence scheduled production method and system |
CN110046434A (en) * | 2019-04-18 | 2019-07-23 | 电子科技大学 | The machine components reliability design approach with genetic algorithm is returned based on Gaussian process |
CN111007813A (en) * | 2019-11-19 | 2020-04-14 | 一汽物流有限公司 | AGV obstacle avoidance scheduling method based on multi-population hybrid intelligent algorithm |
CN112235035A (en) * | 2020-10-08 | 2021-01-15 | 军事科学院***工程研究院网络信息研究所 | Spatial information network networking method based on distributed constellation |
CN113285832A (en) * | 2021-05-24 | 2021-08-20 | 国网河南省电力公司信息通信公司 | NSGA-II-based power multi-mode network resource optimization allocation method |
CN113765718A (en) * | 2021-09-10 | 2021-12-07 | 烽火通信科技股份有限公司 | Test topology construction method and device for QUIC protocol |
CN114025361A (en) * | 2021-10-20 | 2022-02-08 | 北京航空航天大学 | Cooperative relay task oriented multi-unmanned aerial vehicle network topology construction and planning method |
CN114169374A (en) * | 2021-12-10 | 2022-03-11 | 湖南工商大学 | Cable-stayed bridge stay cable damage identification method and electronic equipment |
Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN104200272A (en) * | 2014-08-28 | 2014-12-10 | 北京工业大学 | Complex network community mining method based on improved genetic algorithm |
CN105430707A (en) * | 2015-11-03 | 2016-03-23 | 国网江西省电力科学研究院 | WSN (Wireless Sensor Networks) multi-objective optimization routing method based on genetic algorithm |
-
2017
- 2017-04-13 CN CN201710238749.3A patent/CN106953768A/en active Pending
Patent Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN104200272A (en) * | 2014-08-28 | 2014-12-10 | 北京工业大学 | Complex network community mining method based on improved genetic algorithm |
CN105430707A (en) * | 2015-11-03 | 2016-03-23 | 国网江西省电力科学研究院 | WSN (Wireless Sensor Networks) multi-objective optimization routing method based on genetic algorithm |
Cited By (12)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN108960509A (en) * | 2018-06-29 | 2018-12-07 | 无锡易通精密机械股份有限公司 | A kind of manufacture system intelligence scheduled production method and system |
CN108960509B (en) * | 2018-06-29 | 2022-03-11 | 无锡易通精密机械股份有限公司 | Intelligent production scheduling method and system for manufacturing system |
CN110046434A (en) * | 2019-04-18 | 2019-07-23 | 电子科技大学 | The machine components reliability design approach with genetic algorithm is returned based on Gaussian process |
CN111007813A (en) * | 2019-11-19 | 2020-04-14 | 一汽物流有限公司 | AGV obstacle avoidance scheduling method based on multi-population hybrid intelligent algorithm |
CN112235035A (en) * | 2020-10-08 | 2021-01-15 | 军事科学院***工程研究院网络信息研究所 | Spatial information network networking method based on distributed constellation |
CN113285832A (en) * | 2021-05-24 | 2021-08-20 | 国网河南省电力公司信息通信公司 | NSGA-II-based power multi-mode network resource optimization allocation method |
CN113765718A (en) * | 2021-09-10 | 2021-12-07 | 烽火通信科技股份有限公司 | Test topology construction method and device for QUIC protocol |
CN113765718B (en) * | 2021-09-10 | 2023-06-09 | 烽火通信科技股份有限公司 | QUIC protocol-oriented test topology construction method and device |
CN114025361A (en) * | 2021-10-20 | 2022-02-08 | 北京航空航天大学 | Cooperative relay task oriented multi-unmanned aerial vehicle network topology construction and planning method |
CN114025361B (en) * | 2021-10-20 | 2023-08-15 | 北京航空航天大学 | Multi-unmanned aerial vehicle network topology construction and planning method for cooperative relay tasks |
CN114169374A (en) * | 2021-12-10 | 2022-03-11 | 湖南工商大学 | Cable-stayed bridge stay cable damage identification method and electronic equipment |
CN114169374B (en) * | 2021-12-10 | 2024-02-20 | 湖南工商大学 | Cable-stayed bridge stay cable damage identification method and electronic equipment |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN106953768A (en) | A kind of network reliability model and mixing intelligent optimizing method | |
CN109935332A (en) | A kind of miRNA- disease association prediction technique based on double random walk models | |
CN109932903A (en) | The air-blower control Multipurpose Optimal Method of more parent optimization networks and genetic algorithm | |
CN109634121A (en) | More parent genetic algorithm air source heat pump multiobjective optimization control methods based on radial basis function neural network | |
CN106934722A (en) | Multi-objective community detection method based on k node updates Yu similarity matrix | |
CN107463702A (en) | A kind of database multi-join query optimization method based on evolution algorithm | |
CN104484548B (en) | A kind of improved sequential Fault Diagnosis Strategy optimization method | |
CN103905246A (en) | Link prediction method based on grouping genetic algorithm | |
CN109919791A (en) | Method and system for analyzing cooperation level in prisoner predicament network game based on betweenness | |
CN103455612A (en) | Method for detecting non-overlapping network communities and overlapping network communities based on two-stage strategy | |
CN108665068A (en) | The improved adaptive GA-IAGA of water distribution hydraulic model automatic Check problem | |
Wang et al. | A personalized self‐learning system based on knowledge graph and differential evolution algorithm | |
CN104156462B (en) | Complex network community method for digging based on cellular Learning Automata | |
CN105930272A (en) | Important statement-based branch coverage testing data generation method | |
CN113762602A (en) | Short-term wind speed prediction method for wind power plant | |
CN102799940B (en) | Online community partitioning method based on genetic algorithm and priori knowledge | |
Zhao et al. | Alphuzz: Monte carlo search on seed-mutation tree for coverage-guided fuzzing | |
CN109599146A (en) | A kind of band false knot nucleic acid Structure Prediction Methods based on multi-objective genetic algorithm | |
CN102521649A (en) | Network community structure detection method based on memetic computation | |
CN104933103A (en) | Multi-target community discovering method integrating structure clustering and attributive classification | |
CN102768735B (en) | Network community partitioning method based on immune clone multi-objective optimization | |
CN112182968A (en) | Method, system and equipment for constructing equivalent circuit model of lithium ion battery | |
CN106776088A (en) | Diagnosis method for system fault based on Malek models | |
Jang et al. | Coevolutionary characteristics of knowledge diffusion and knowledge network structures: A GA-ABM model | |
CN110866586A (en) | Improved genetic programming algorithm optimization method for resource-constrained multi-project scheduling |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
PB01 | Publication | ||
PB01 | Publication | ||
SE01 | Entry into force of request for substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
AD01 | Patent right deemed abandoned | ||
AD01 | Patent right deemed abandoned |
Effective date of abandoning: 20200911 |