CN105933247B - The decomposition method and system of business network - Google Patents
The decomposition method and system of business network Download PDFInfo
- Publication number
- CN105933247B CN105933247B CN201610248418.3A CN201610248418A CN105933247B CN 105933247 B CN105933247 B CN 105933247B CN 201610248418 A CN201610248418 A CN 201610248418A CN 105933247 B CN105933247 B CN 105933247B
- Authority
- CN
- China
- Prior art keywords
- decomposing
- scheme
- decomposing scheme
- generation
- parameter
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000000354 decomposition reaction Methods 0.000 title claims abstract description 29
- 238000000034 method Methods 0.000 title claims abstract description 19
- 230000035772 mutation Effects 0.000 claims description 42
- 238000005265 energy consumption Methods 0.000 claims description 7
- 241000208340 Araliaceae Species 0.000 claims description 4
- 235000005035 Panax pseudoginseng ssp. pseudoginseng Nutrition 0.000 claims description 4
- 235000003140 Panax quinquefolius Nutrition 0.000 claims description 4
- 235000008434 ginseng Nutrition 0.000 claims description 4
- 238000010586 diagram Methods 0.000 description 2
- 238000011156 evaluation Methods 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000004891 communication Methods 0.000 description 1
- 230000007812 deficiency Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/70—Admission control; Resource allocation
- H04L47/80—Actions related to the user profile or the type of traffic
- H04L47/805—QOS or priority aware
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Telephonic Communication Services (AREA)
Abstract
The present invention provides a kind of decomposition method of business network and systems.This method comprises: S1, intersects each decomposing scheme and/or makes a variation, to obtain next-generation decomposing scheme；S2, the multiple decomposing schemes obtained for step S1, according to each decomposing scheme in the parameter by the parameter of decomposing scheme optimal under history number of iterations and/or all decomposing schemes decomposing scheme optimal in the case where passing through history number of iterations, calculating the decomposing scheme next generation should corresponding parameter, it should corresponding parameter until calculating all decomposing scheme next generations, parameter and decomposing scheme correspond, to can get the next-generation corresponding decomposing scheme of each decomposing scheme and be sent to step S1；S3 repeats step S1-S2 until preset number of iterations, selects optimal decomposing scheme as final decomposing scheme in the multiple decomposing schemes finally obtained.The decomposition method and system of the business network, can obtain preferably decomposing scheme, high and at low cost to the treatment effeciency of business.
Description
Technical field
The invention belongs to network function technical field of virtualization, and in particular to a kind of decomposition method of business network and be
System.
Background technique
Network function, which virtualizes, has become the important trend of global telecommunications industry development, network function virtualization technology be for
The deficiency of the existing private communication facility of solution and generate therewith, be that traditional network virtualization of function and is carried on and is adopted
With the software platform of common hardware, the software of conventional telecommunications equipment and hardware are decoupled, set based on general-purpose computations, storage, network
It is standby to realize telecommunication network function.
Currently, a business network answers top-down decomposition, until resource can be assigned to, in the prior art using with
Machine distributes a kind of decomposing scheme and is decomposed, not only not high to the treatment effeciency of business in this way and higher cost.
Summary of the invention
The present invention is directed at least solve one of the technical problems existing in the prior art, a kind of point of business network is proposed
Method and system are solved, preferably decomposing scheme can be obtained, so that the treatment effeciency to business is high and at low cost.
One of in order to solve the above problem, the present invention provides a kind of decomposition methods of business network, comprising: S1, to each
Decomposing scheme is intersected and/or is made a variation, to obtain next-generation decomposing scheme；S2, multiple described points obtained for step S1
Solution scheme, according to each decomposing scheme in parameter by optimal decomposing scheme under history number of iterations and/or all
Decomposing scheme calculates the next-generation decomposing scheme of the decomposing scheme in the parameter by decomposing scheme optimal under history number of iterations
Should corresponding parameter, until calculate all decomposing schemes next-generation decomposing scheme should corresponding parameter, the ginseng
The several and decomposing scheme corresponds, to can get the next-generation decomposing scheme of each decomposing scheme and be sent to step
Rapid S1；S3 repeats step S1-S2 until preset number of iterations, selects in the multiple decomposing schemes finally obtained
Optimal decomposing scheme is as final decomposing scheme.
Preferably, the next-generation decomposing scheme for calculating each decomposing scheme according to the following formula should corresponding parameter l:
Wherein,
R is current iteration number；
I refers to i-th of decomposing scheme；
t、d1、d2It is predetermined coefficient with θ；
ψ ∈ (0,1), θ ∈ (0,1)；
Refer to i-th of decomposing scheme in the parameter by decomposing scheme optimal under history number of iterations；
Refer to all decomposing schemes in the parameter by decomposing scheme optimal under history number of iterations.
It is preferably, described that intersect to each decomposing scheme include: that be randomly assigned an intersection to each decomposing scheme general
Rate；Crossover probability is selected to be greater than the decomposing scheme of threshold value；Crossover operation is carried out to the decomposing scheme of selection；Judgement is handed over
Whether the superiority-inferiority of the decomposing scheme is better than the average value of the superiority-inferiority of all decomposing schemes each of after fork operation, if
Be, then using the decomposing scheme after crossover operation as the next-generation decomposing scheme, if it is not, before then selecting crossover operation compared with
The excellent decomposing scheme is as the next-generation decomposing scheme.
Preferably, it is described to each decomposing scheme carry out variation include: that a change is randomly assigned to each decomposing scheme
Different probability；Each decomposing scheme carries out mutation operation according to the corresponding mutation probability；After judging mutation operation
The superiority-inferiority of the decomposing scheme whether be better than the superiority-inferiority before mutation operation, if so, the decomposition after mutation operation
Scheme is as the next-generation decomposing scheme, if it is not, the preferably described decomposing scheme is as the next generation before then selecting mutation operation
The decomposing scheme.
Preferably, the superiority-inferiority Z of each decomposing scheme is calculated according to following formula:
Wherein, pij∈ (0,1), i, j ∈ [0, n-1], alpha+beta+γ=1, α, beta, gamma ∈ (0,1)；
xij=0 or 1；
The smaller expression decomposing scheme of Z value is more excellent；
cijRefer to the ability of the unit Virtual base resource of the i-th row jth column；
pijRefer to the utilization rate of the ability of the unit Virtual base resource of the i-th row jth column；
tijRefer to the time cost of the unit Virtual base resource of the i-th row jth column；
eijRefer to the energy consumption cost of the unit Virtual base resource of the i-th row jth column.
The present invention also provides a kind of decomposing systems of business network, comprising:
Intersect and/or variation module is divided for each decomposing scheme to be intersected and/or made a variation with obtaining the next generation
Solution scheme is simultaneously sent to computing module；
Computing module, multiple decomposing schemes for being obtained for the intersection and/or variation module, according to each
The parameter of the decomposing scheme decomposing scheme optimal in the case where passing through history number of iterations and/or all decomposing schemes are by going through
The parameter of optimal decomposing scheme under history number of iterations, calculate the decomposing scheme next-generation decomposing scheme should corresponding parameter,
Until the next-generation decomposing scheme for calculating all decomposing schemes should corresponding parameter, the parameter and the decomposing scheme
It corresponds, to can get the next-generation decomposing scheme of each decomposing scheme and be sent to the intersection and/or variation
Module；
Determining module, for repeating number in the intersection and/or variation module and the computing module and reaching pre-
If after number of iterations, selecting optimal decomposing scheme as final decomposition side in the multiple decomposing schemes finally obtained
Case.
Preferably, the computing module, for calculating the next-generation decomposing scheme of each decomposing scheme according to the following formula
It should corresponding parameter l:
Wherein,
R is current iteration number；
I refers to i-th of decomposing scheme；
t、d1、d2It is predetermined coefficient with θ；
ψ ∈ (0,1), θ ∈ (0,1)；
Refer to i-th of decomposing scheme in the parameter by decomposing scheme optimal under history number of iterations；
Refer to all decomposing schemes in the parameter by decomposing scheme optimal under history number of iterations.
Preferably, the intersection and/or variation module are Cross module；The Cross module, for each decomposition side
Case is randomly assigned a crossover probability；Crossover probability is selected to be greater than the decomposing scheme of threshold value；To the decomposing scheme of selection
Carry out crossover operation；Each of judge after crossover operation whether the superiority-inferiority of the decomposing scheme is better than all decomposing schemes
Superiority-inferiority average value, if so, using the decomposing scheme after crossover operation as the next-generation decomposing scheme, if
No, then the preferably described decomposing scheme is as the next-generation decomposing scheme before selecting crossover operation.
Preferably, the intersection and/or variation module are variation module；The variation module, for each described point
Solution scheme is randomly assigned a mutation probability；Each decomposing scheme carries out variation behaviour according to the corresponding mutation probability
Make；Whether the superiority-inferiority of the decomposing scheme after judging mutation operation is better than the superiority-inferiority before mutation operation, is, then make a variation behaviour
The decomposing scheme after work is as the next-generation decomposing scheme, if it is not, the preferably described decomposition before then selecting mutation operation
Scheme is as the next-generation decomposing scheme.
Preferably, the computing module, for calculating the superiority-inferiority Z of each decomposing scheme according to following formula:
Wherein, pij∈ (0,1), i, j ∈ [0, n-1], alpha+beta+γ=1, α, beta, gamma ∈ (0,1)；
xij=0 or 1；
The smaller expression decomposing scheme of Z value is more excellent；
cijRefer to the ability of the unit Virtual base resource of the i-th row jth column；
pijRefer to the utilization rate of the ability of the unit Virtual base resource of the i-th row jth column；
tijRefer to the time cost of the unit Virtual base resource of the i-th row jth column；
eijRefer to the energy consumption cost of the unit Virtual base resource of the i-th row jth column.
The invention has the following advantages:
The decomposition method and system of business network provided by the invention, definition and the decomposition one-to-one parameter of division,
And after each decomposing scheme carries out generation intersection and/or variation, according to each decomposing scheme under by history number of iterations
The parameter of optimal decomposing scheme and/or all decomposing schemes are in the ginseng by decomposing scheme optimal under history number of iterations
Number, calculate the decomposing scheme next-generation decomposing scheme should corresponding parameter, to can get the next of each decomposing scheme
The initial decomposition scheme intersected and/or made a variation for decomposing scheme and as next time, since next-generation decomposing scheme is that basis is passing through
The optimal Decomposition scheme crossed under history number of iterations obtains, it is thus possible to improve the superiority of each decomposing scheme of every generation, weight
After executing repeatedly above-mentioned intersection and/or variation and calculating again, optimal point is selected in the multiple decomposing schemes finally obtained
Solution scheme then can finally obtain preferably decomposing scheme as final decomposing scheme, so that the treatment effeciency to business is high
And it is at low cost.
Detailed description of the invention
Fig. 1 is the flow chart of the decomposition method for the business network that the embodiment of the present invention 1 provides；
Fig. 2 is the functional block diagram of the decomposing system for the business network that the embodiment of the present invention 2 provides.
Specific embodiment
To make those skilled in the art more fully understand technical solution of the present invention, come with reference to the accompanying drawing to the present invention
The uplink bandwidth resource sharing method and system of offer are described in detail.
Embodiment 1
Fig. 1 is the flow chart of the decomposition method for the business network that the embodiment of the present invention 1 provides.Referring to Fig. 1, the present embodiment
The decomposition method of the business network of offer, comprising:
S0 obtains multiple decomposing schemes and therewith one-to-one parameter at random and is sent to step S1.
S1 is intersected and/or is made a variation to each decomposing scheme, to obtain next-generation decomposing scheme.
S2, for multiple decomposing schemes that step S1 is obtained, according to each decomposing scheme by under history number of iterations most
The parameter of excellent decomposing scheme and/or all decomposing schemes in the parameter by decomposing scheme optimal under history number of iterations,
Calculate the decomposing scheme next-generation decomposing scheme should corresponding parameter, until calculating the next generations of all decomposing schemes
Decomposing scheme should corresponding parameter, parameter and decomposing scheme correspond, to can get the next generation of each decomposing scheme
Decomposing scheme is simultaneously sent to step S1.
S3 repeats step S1-S2 until preset number of iterations, selects most in the multiple decomposing schemes finally obtained
Excellent decomposing scheme is as final decomposing scheme.
Illustrate herein, it is every by once-through operation obtains the next generation decomposing scheme, the operation include intersection mentioned above,
Variation and calculating etc.；Successively three generations's decomposing scheme can be then obtained by above-mentioned intersection, variation and calculating.
The decomposition method for the business network that the embodiment of the present invention 1 provides, definition and the decomposition one-to-one parameter of division,
And after each decomposing scheme is once intersected and/or made a variation, according to each decomposing scheme under by history number of iterations
The parameter of optimal decomposing scheme and/or all decomposing schemes are in the ginseng by decomposing scheme optimal under history number of iterations
Number, calculate the decomposing scheme next-generation decomposing scheme should corresponding parameter, to can get the next of each decomposing scheme
The initial decomposition scheme intersected and/or made a variation for decomposing scheme and as next time, since next-generation decomposing scheme is that basis is passing through
The optimal Decomposition scheme crossed under history number of iterations obtains, it is thus possible to improve the superiority of each decomposing scheme of every generation, weight
After executing repeatedly above-mentioned intersection and/or variation and calculating again, optimal point is selected in the multiple decomposing schemes finally obtained
Solution scheme then can finally obtain preferably decomposing scheme as final decomposing scheme, so that the treatment effeciency to business is high
And it is at low cost.
Specifically, in step s 2, the next-generation decomposing scheme for calculating each decomposing scheme according to the following formula should be right
The parameter l answered:
Wherein,
R is current iteration number；
I refers to i-th of decomposing scheme；
t、d1、d2It is predetermined coefficient with θ；
ψ ∈ (0,1), θ ∈ (0,1)；
Refer to i-th of decomposing scheme in the parameter by decomposing scheme optimal under history number of iterations；
Refer to all decomposing schemes in the parameter by decomposing scheme optimal under history number of iterations.
In this embodiment, it is preferred that intersect to each decomposing scheme includes: to be randomly assigned to each decomposing scheme
One crossover probability；Crossover probability is selected to be greater than the decomposing scheme of threshold value；Crossover operation is carried out to the decomposing scheme of selection；Judgement is handed over
Whether the superiority-inferiority of each decomposing scheme after fork operation is better than the average value of the superiority-inferiority of all decomposing schemes, if so, will
Decomposing scheme after crossover operation is as next-generation decomposing scheme, if it is not, preferably decomposing scheme is made before then selecting crossover operation
For next-generation decomposing scheme.
It is appreciated that using the decomposing scheme better than " parent " after crossover operation as next-generation decomposing scheme, and
Preferably decomposing scheme before crossover operation is selected to can be further improved every generation decomposing scheme as next-generation decomposing scheme
Superiority, to can finally obtain more preferably decomposing scheme.
In the present embodiment, furthermore it is preferred that each decomposing scheme carry out variation include: to each decomposing scheme with
Machine distributes a mutation probability；Each decomposing scheme carries out mutation operation according to corresponding mutation probability；Judge mutation operation
Whether the superiority-inferiority of decomposing scheme afterwards is better than the superiority-inferiority before mutation operation, if so, the decomposing scheme after mutation operation is made
For next-generation decomposing scheme, if it is not, preferably decomposing scheme is as next-generation decomposing scheme before then selecting crossover operation.
It is appreciated that using the decomposing scheme better than " parent " after mutation operation as next-generation decomposing scheme, and
Preferably decomposing scheme before mutation operation is selected to can be further improved every generation decomposing scheme as next-generation decomposing scheme
Superiority, to can finally obtain more preferably decomposing scheme.
In addition, in the present embodiment, the superiority-inferiority Z of each decomposing scheme is calculated according to following formula:
Wherein, pij∈ (0,1), i, j ∈ [0, n-1], alpha+beta+γ=1, α, beta, gamma ∈ (0,1)；
xij=0 or 1；
The smaller expression decomposing scheme of Z value is more excellent；
cijRefer to the ability of the unit Virtual base resource of the i-th row jth column；
pijRefer to the utilization rate of the ability of the unit Virtual base resource of the i-th row jth column；
tijRefer to the time cost of the unit Virtual base resource of the i-th row jth column；
eijRefer to the energy consumption cost of the unit Virtual base resource of the i-th row jth column.
From the foregoing, it will be observed that the capacity utilization ratio of unit Virtual base resource, time cost and energy consumption cost are decomposed as evaluation
The factor of scheme superiority-inferiority passes through above-mentioned x according to actual needsij=0 (or 1) is it is contemplated that selection at least one factor therein
Not as the factor of (or as) evaluation decomposing scheme superiority-inferiority；α, β, γ, can bases as the weight coefficient in three kinds of factors
Actual demand is configured, if the factor is more important, it is bigger that the corresponding weight coefficient value of the factor should be arranged.
It should be noted that in the present embodiment, although first carry out crossover operation in step S1 carries out mutation operation, needle again
Above-mentioned steps S2 is executed to the next-generation decomposing scheme obtained after mutation operation, still, the present invention is not limited thereto, in reality
In can also the operation of advanced row variation carry out crossover operation again, in the case, for the next generation obtained after crossover operation
The auspicious above-mentioned steps S2 of decomposing scheme intelligence.
In addition, in practical applications, can also only carry out one of crossover operation and mutation operation in step sl.
Embodiment 2
Fig. 2 is the functional block diagram of the decomposing system for the business network that the embodiment of the present invention 2 provides.Referring to Fig. 2, of the invention
The decomposing system for the business network that embodiment 2 provides, comprising: randomized blocks 10, intersection and/or variation module 11, computing module
12 and determining module 13.Wherein, randomized blocks 10 for obtaining multiple decomposing schemes and one-to-one parameter is simultaneously therewith at random
It is sent to intersection and/or variation module 11.Intersect and/or variation module 11 be used to intersect each decomposing scheme and/or make a variation,
To obtain next-generation decomposing scheme.Computing module 12 is used for for the multiple decomposing schemes intersected and/or variation module 11 obtains,
It is being passed through according to each decomposing scheme by the parameter and/or all decomposing schemes of decomposing scheme optimal under history number of iterations
The parameter for crossing decomposing scheme optimal under history number of iterations, the next-generation decomposing scheme for calculating the decomposing scheme corresponding should join
Number, until calculate all decomposing scheme next-generation decomposing scheme should corresponding parameter, parameter and decomposing scheme one are a pair of
It answers, to can get the next-generation decomposing scheme of each decomposing scheme and send best friend's fork and/or variation module 11.Determining module
13, for intersecting and/or make a variation module and computing module repeat after number reaches default number of iterations, obtain finally
Multiple decomposing schemes in select optimal decomposing scheme as final decomposing scheme.
Specifically, the next-generation decomposing scheme that computing module 12 is used to calculate each decomposing scheme according to the following formula should
Corresponding parameter l:
Wherein,
R is current iteration number；
I refers to i-th of decomposing scheme；
t、d1、d2It is predetermined coefficient with θ；
ψ ∈ (0,1), θ ∈ (0,1)；
Refer to i-th of decomposing scheme in the parameter by decomposing scheme optimal under history number of iterations；
Refer to all decomposing schemes in the parameter by decomposing scheme optimal under history number of iterations.
Specifically, intersect and/or the module 11 that makes a variation is Cross module；Cross module for dividing each decomposing scheme at random
With a crossover probability；Crossover probability is selected to be greater than the decomposing scheme of threshold value；Crossover operation is carried out to the decomposing scheme of selection；Judgement
Whether the superiority-inferiority of each decomposing scheme after crossover operation is better than the average value of the superiority-inferiority of all decomposing schemes, if so,
Using the decomposing scheme after crossover operation as next-generation decomposing scheme, if it is not, preferably decomposing scheme before then selecting crossover operation
As next-generation decomposing scheme.
Specifically, intersect and/or the module 11 that makes a variation is variation module；Variation module for dividing each decomposing scheme at random
With a mutation probability；Each decomposing scheme carries out mutation operation according to corresponding mutation probability；After judging mutation operation
Whether the superiority-inferiority of decomposing scheme is better than the superiority-inferiority before mutation operation, is, then the decomposing scheme after mutation operation is as next
For decomposing scheme, if it is not, preferably decomposing scheme is as next-generation decomposing scheme before then selecting mutation operation.
In addition, in the present embodiment, computing module 12 is used to calculate the superiority-inferiority of each decomposing scheme according to following formula:
Wherein, pij∈ (0,1), i, j ∈ [0, n-1], alpha+beta+γ=1, α, beta, gamma ∈ (0,1)；
xi j=0 or 1；
cijRefer to the ability of the unit Virtual base resource of the i-th row jth column；
pijRefer to the utilization rate of the ability of the unit Virtual base resource of the i-th row jth column；
tijRefer to the time cost of the unit Virtual base resource of the i-th row jth column；
eijRefer to the energy consumption cost of the unit Virtual base resource of the i-th row jth column.
It is understood that the principle that embodiment of above is intended to be merely illustrative of the present and the exemplary implementation that uses
Mode, however the present invention is not limited thereto.For those skilled in the art, essence of the invention is not being departed from
In the case where mind and essence, various changes and modifications can be made therein, these variations and modifications are also considered as protection scope of the present invention.
Claims (8)
1. a kind of decomposition method of business network characterized by comprising
S1 is intersected and/or is made a variation to each decomposing scheme, to obtain next-generation decomposing scheme；
S2 is passing through history number of iterations according to each decomposing scheme for multiple decomposing schemes that step S1 is obtained
Under optimal decomposing scheme parameter and/or all decomposing schemes in the ginseng by decomposing scheme optimal under history number of iterations
Number, calculate the decomposing scheme next-generation decomposing scheme should corresponding parameter, until calculate under all decomposing schemes
Generation decomposing scheme should corresponding parameter, the parameter and the decomposing scheme correspond, to can get each described
The next-generation decomposing scheme of decomposing scheme is simultaneously sent to step S1；
S3 repeats step S1-S2 until preset number of iterations, selects most in the multiple decomposing schemes finally obtained
Excellent decomposing scheme is as final decomposing scheme；
Wherein, the superiority-inferiority Z of each decomposing scheme is calculated according to following formula:
Wherein, pij∈ (0,1), i, j ∈ [0, n-1], alpha+beta+γ=1, α, beta, gamma ∈ (0,1)；
xij=0 or 1；
The smaller expression decomposing scheme of Z value is more excellent；
cijRefer to the ability of the unit Virtual base resource of the i-th row jth column；
pijRefer to the utilization rate of the ability of the unit Virtual base resource of the i-th row jth column；
tijRefer to the time cost of the unit Virtual base resource of the i-th row jth column；
eijRefer to the energy consumption cost of the unit Virtual base resource of the i-th row jth column.
2. the decomposition method of business network according to claim 1, which is characterized in that calculate each point according to the following formula
The next-generation decomposing scheme of solution scheme should corresponding parameter l:
Wherein,
σ=d1+d2≥4；
R is current iteration number；
I refers to i-th of decomposing scheme；
t、d1、d2It is predetermined coefficient with θ；
ψ ∈ (0,1), θ ∈ (0,1)；
Refer to i-th of decomposing scheme in the parameter by decomposing scheme optimal under history number of iterations；
Refer to all decomposing schemes in the parameter by decomposing scheme optimal under history number of iterations.
3. the decomposition method of business network according to claim 1, which is characterized in that described to be carried out to each decomposing scheme
Intersection includes:
One crossover probability is randomly assigned to each decomposing scheme；
Crossover probability is selected to be greater than the decomposing scheme of threshold value；
Crossover operation is carried out to the decomposing scheme of selection；
Each of judge after crossover operation whether the superiority-inferiority of the decomposing scheme is better than the superiority-inferiority of all decomposing schemes
Average value, if so, using the decomposing scheme after crossover operation as next-generation decomposing scheme, if it is not, then selecting to intersect
The preferably described decomposing scheme is as next-generation decomposing scheme before operation.
4. the decomposition method of business network according to claim 1, which is characterized in that described to be carried out to each decomposing scheme
Variation includes:
One mutation probability is randomly assigned to each decomposing scheme；
Each decomposing scheme carries out mutation operation according to the corresponding mutation probability；
Whether the superiority-inferiority of the decomposing scheme after judging mutation operation is better than the superiority-inferiority before mutation operation, if so, becoming
The decomposing scheme after ETTHER-OR operation is as next-generation decomposing scheme, if it is not, the preferably described decomposition before then selecting mutation operation
Scheme is as next-generation decomposing scheme.
5. a kind of decomposing system of business network characterized by comprising
Intersection and/or variation module, for each decomposing scheme to be intersected and/or made a variation, to obtain next-generation decomposition side
Case is simultaneously sent to computing module；
The computing module, multiple decomposing schemes for being obtained for the intersection and/or variation module, according to each
The parameter of the decomposing scheme decomposing scheme optimal in the case where passing through history number of iterations and/or all decomposing schemes are by going through
The parameter of optimal decomposing scheme under history number of iterations, calculate the decomposing scheme next-generation decomposing scheme should corresponding parameter,
Until the next-generation decomposing scheme for calculating all decomposing schemes should corresponding parameter, the parameter and the decomposing scheme
It corresponds, to can get the next-generation decomposing scheme of each decomposing scheme and be sent to the intersection and/or variation
Module；
Determining module, for the intersection and/or variation module and the computing module repeat number reach it is default repeatedly
After algebra, select optimal decomposing scheme as final decomposing scheme in the multiple decomposing schemes finally obtained；
Wherein, the computing module, for calculating the superiority-inferiority Z of each decomposing scheme according to following formula:
Wherein, pij∈ (0,1), i, j ∈ [0, n-1], alpha+beta+γ=1, α, beta, gamma ∈ (0,1)；
xij=0 or 1；
The smaller expression decomposing scheme of Z value is more excellent；
cijRefer to the ability of the unit Virtual base resource of the i-th row jth column；
pijRefer to the utilization rate of the ability of the unit Virtual base resource of the i-th row jth column；
tijRefer to the time cost of the unit Virtual base resource of the i-th row jth column；
eijRefer to the energy consumption cost of the unit Virtual base resource of the i-th row jth column.
6. the decomposing system of business network according to claim 5, which is characterized in that the computing module is used for basis
The next-generation decomposing scheme that following formula calculates each decomposing scheme should corresponding parameter l:
Wherein,
σ=d1+d2≥4；
R is current iteration number；
I refers to i-th of decomposing scheme；
t、d1、d2It is predetermined coefficient with θ；
ψ ∈ (0,1), θ ∈ (0,1)；
Refer to i-th of decomposing scheme in the parameter by decomposing scheme optimal under history number of iterations；
Refer to all decomposing schemes in the parameter by decomposing scheme optimal under history number of iterations.
7. the decomposing system of business network according to claim 5, which is characterized in that the intersection and/or variation module
For Cross module；
The Cross module, for being randomly assigned a crossover probability to each decomposing scheme；Crossover probability is selected to be greater than threshold value
The decomposing scheme；Crossover operation is carried out to the decomposing scheme of selection；Each of judge after crossover operation the decomposition side
Whether the superiority-inferiority of case is better than the average value of the superiority-inferiority of all decomposing schemes, if so, will be described in after crossover operation
Decomposing scheme is as next-generation decomposing scheme, if it is not, the preferably described decomposing scheme is as the next generation before then selecting crossover operation
Decomposing scheme.
8. the decomposing system of business network according to claim 5, which is characterized in that the intersection and/or variation module
For the module that makes a variation；
The variation module, for being randomly assigned a mutation probability to each decomposing scheme；Each decomposing scheme root
Mutation operation is carried out according to the corresponding mutation probability；Whether the superiority-inferiority of the decomposing scheme after judging mutation operation
Better than the superiority-inferiority before mutation operation, it is, then the next-generation decomposing scheme of decomposing scheme conduct after mutation operation, if it is not,
The preferably described decomposing scheme is as next-generation decomposing scheme before then selecting mutation operation.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610248418.3A CN105933247B (en) | 2016-04-20 | 2016-04-20 | The decomposition method and system of business network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610248418.3A CN105933247B (en) | 2016-04-20 | 2016-04-20 | The decomposition method and system of business network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105933247A CN105933247A (en) | 2016-09-07 |
| CN105933247B true CN105933247B (en) | 2019-01-08 |
Family
ID=56838696
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610248418.3A Active CN105933247B (en) | 2016-04-20 | 2016-04-20 | The decomposition method and system of business network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105933247B (en) |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103580922A (en) * | 2013-11-08 | 2014-02-12 | 国家电网公司 | Overload control method for electric power communication network application server based on hybrid optimization |
| CN105160580A (en) * | 2015-07-13 | 2015-12-16 | 西安电子科技大学 | Symbol network structure balance of multi-objective particle swarm optimization based on decomposition |
-
2016
- 2016-04-20 CN CN201610248418.3A patent/CN105933247B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103580922A (en) * | 2013-11-08 | 2014-02-12 | 国家电网公司 | Overload control method for electric power communication network application server based on hybrid optimization |
| CN105160580A (en) * | 2015-07-13 | 2015-12-16 | 西安电子科技大学 | Symbol network structure balance of multi-objective particle swarm optimization based on decomposition |
Non-Patent Citations (3)
| Title |
|---|
| "A Multiagent-Based Particle Swarm Optimization Approach for Optimal Reactive Power Dispatch";B.Zhao等;《IEEE TRANSACTIONS ON POWER SYSTEMS》;20050531;第3页左栏 * |
| "基于遗传算法的粒子群算法的参数分析";陈建明;《中国优秀硕士学位论文全文数据库 信息科技辑》;20121015;第1.1.2-2.2.3节 * |
| "改进粒子群算法的研究及其云计算资源调度的应用";仲伟彪;《中国优秀硕士学位论文全文数据库 信息科技辑》;20160215;第4.3.4节 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105933247A (en) | 2016-09-07 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Ozfatura et al. | Speeding up distributed gradient descent by utilizing non-persistent stragglers | |
| Levitin et al. | A genetic algorithm for robotic assembly line balancing | |
| Sindhya et al. | A local search based evolutionary multi-objective optimization approach for fast and accurate convergence | |
| CN103683284B (en) | A kind of power distribution network three-phase unbalanced load flow computational methods containing distributed power source | |
| CN105576648B (en) | Static security analysis double-layer parallel method based on GPU-CPU heterogeneous computing platform | |
| CN107632590B (en) | A kind of bottom event sort method priority-based | |
| Murugan | Modified particle swarm optimisation with a novel initialisation for finding optimal solution to the transmission expansion planning problem | |
| US11252077B2 (en) | Network service transmission method and system | |
| Mahdavi et al. | Evaluating the effect of load growth on annual network losses in TNEP considering bundle lines using DCGA | |
| Shayeghi et al. | Studying effect of bundle lines on TNEP considering network losses using decimal codification genetic algorithm | |
| CN110380903B (en) | Power communication network fault detection method, device and equipment | |
| CN110019622A (en) | A kind of real time mass map point polymerization and device | |
| Mi et al. | Embedding virtual infrastructure based on genetic algorithm | |
| CN106453285A (en) | Method and device for verifying secret data sharing | |
| CN109710542A (en) | A kind of completely N-ary tree construction method and device | |
| CN105955927B (en) | Constrained optimization method based on decomposition-paralleling genetic algorithm | |
| Shayeghi et al. | Studying the effect of losses coefficient on transmission expansion planning using decimal codification based GA | |
| CN105933247B (en) | The decomposition method and system of business network | |
| Pourdarvish et al. | Cold standby redundancy allocation in a multi-level series system by memetic algorithm | |
| CN107330201B (en) | Polarity searching method for fixed-polarity Reed-Muller logic circuit | |
| Amestoy et al. | A parallel matrix scaling algorithm | |
| CN105005501A (en) | Cloud data center oriented second-order task optimization scheduling method | |
| CN107180286A (en) | Manufacturing service supply chain optimization method and system based on modified pollen algorithm | |
| Mazalov et al. | Game-theoretic centrality measures for weighted graphs | |
| CN110110158A (en) | A kind of the memory space division methods and system of three-dimensional mesh data |
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 |