英語翻譯
英語翻譯
3.PROPOSED ALGORITHM
The proposed dynamic evolutionary algorithm exploits evolutionary progress history to adapt the current population to the new environment.The algorithm introduces shifts in the decision space,the so-called relocations,which try to account for the estimated amount of change in the objective space.A complete description of the proposed algorithm is presented in detail next.represents the DOP we want to optimize; represents the -dimensional decision vector,and denotes the th-dimension decision variable.A nomenclature table is given in Appendix A for quick reference.For the discussion of this paper,the DOP is assumed to be a maximization problem.Note that a minimization problem can be converted into a maximization problem by multiplying with .denotes the child’s evolutionary progress in the th-dimension of the decision variable with respect to its parents.It is measured as the difference between the th-dimension decision variable of a child and that of the centroid of its parents.This can be mathematically expressed as (2) The evolutionary fitness progress,,of a child with respect to its parents is measured as the difference between the fitness,,of a child and the interpolated fitness of its parents.The interpolation is based on the distance between a child and its parents .The farther a parent is from its child,the lesser is its contribution to the interpolated fitness,as shown in (3a)–(4) at the bottom of the page.The average evolutionary progress in the th-dimension decision variable of a child can be obtained as the weighted sum of the child’s and the average evolutionary progress in the th-dimension decision variable of its parents.The same is true for the child’s average evolutionary fitness progress ,except that we use the interpolated value of its parents’ average fitness progress,as shown in (5) and (6) at the bottom of the next page,where denotes the total number of generations either from the start of an evolutionary process or the last occurrence of change,whichever was more recent,up to the current generation.On the other hand,represents the weight given to previous evolutionary progresses relative to the current one.Using ,the weighted average is equivalent to taking a simple average of all the individual progresses (total sum divided by number of generation).This means that the effect of all the previous and values starting from the recent occurrence of change is accumulated and does not diminish through time.
3.PROPOSED ALGORITHM
The proposed dynamic evolutionary algorithm exploits evolutionary progress history to adapt the current population to the new environment.The algorithm introduces shifts in the decision space,the so-called relocations,which try to account for the estimated amount of change in the objective space.A complete description of the proposed algorithm is presented in detail next.represents the DOP we want to optimize; represents the -dimensional decision vector,and denotes the th-dimension decision variable.A nomenclature table is given in Appendix A for quick reference.For the discussion of this paper,the DOP is assumed to be a maximization problem.Note that a minimization problem can be converted into a maximization problem by multiplying with .denotes the child’s evolutionary progress in the th-dimension of the decision variable with respect to its parents.It is measured as the difference between the th-dimension decision variable of a child and that of the centroid of its parents.This can be mathematically expressed as (2) The evolutionary fitness progress,,of a child with respect to its parents is measured as the difference between the fitness,,of a child and the interpolated fitness of its parents.The interpolation is based on the distance between a child and its parents .The farther a parent is from its child,the lesser is its contribution to the interpolated fitness,as shown in (3a)–(4) at the bottom of the page.The average evolutionary progress in the th-dimension decision variable of a child can be obtained as the weighted sum of the child’s and the average evolutionary progress in the th-dimension decision variable of its parents.The same is true for the child’s average evolutionary fitness progress ,except that we use the interpolated value of its parents’ average fitness progress,as shown in (5) and (6) at the bottom of the next page,where denotes the total number of generations either from the start of an evolutionary process or the last occurrence of change,whichever was more recent,up to the current generation.On the other hand,represents the weight given to previous evolutionary progresses relative to the current one.Using ,the weighted average is equivalent to taking a simple average of all the individual progresses (total sum divided by number of generation).This means that the effect of all the previous and values starting from the recent occurrence of change is accumulated and does not diminish through time.
英語人氣:985 ℃時間:2020-06-23 13:15:09
優(yōu)質(zhì)解答
3.算法提出利用動態(tài)進(jìn)化算法演化過程的歷史上適應(yīng)當(dāng)前人口向新的環(huán)境.該算法制決定了空間,所謂的重定位,試著去說明預(yù)算金額的改變的目的空間.的完整描述了該算法的詳細(xì)介紹了next. DOP我們想優(yōu)化決策;代表維向量,...
我來回答
類似推薦
猜你喜歡
- 1氧化鐵還原成四氧化三鐵,為什么是還原反應(yīng)
- 22010至2011六年級下冊數(shù)學(xué)期中試卷蘇教版
- 3開卷有益的名人讀書故事
- 4函數(shù)圖象關(guān)于點(diǎn)M(a,0)和點(diǎn)N(b,0)對稱,則函數(shù)y=f(x)是周期函數(shù)嗎
- 5過濾除菌操作時,將菌液注入濾器過濾,時間不宜過長,壓力控制在多少為宜?
- 6“5、5、5、1”四個數(shù)字,利用加減乘除括號,計算出24
- 7鄭人買履80字感想 急
- 8兩道數(shù)學(xué)必修5等差數(shù)列的題
- 9先化簡,再求值:(X的平方-4x+4/x+8-2-x/1)÷x的平方-2x/x+3 其中x的平方-4=0
- 10在標(biāo)況下,如果1.6L氧氣含n個氧分子,則阿伏加德羅常數(shù)的數(shù)值為?
- 11已知數(shù)列an的通項公式an=1/(4n²-1),若數(shù)列an的前n項和Sn=7/15則n為多少
- 12如果三點(diǎn)A(a,2)、B(5,1)、C(-4,2a)在同一條直線上,求常數(shù)a的值.怎么做啊