差分进化算法代码.pdfVIP

[plain]viewplaincopy

1.functionDE(Gm,F0)

2.

3.

t0=cputime;

4.%差分进化算法程序

5.%F0是变异率%Gm最大迭代次数

6.Gm=10000;

7.F0=0.5;

8.

Np=100;

9.CR=0.9;%交叉概率

10.G=1;%初始化代数

11.D=10;%所求问题的维数

12.Gmin=zeros(1,Gm);%各代的最优值

13.best_x=zeros(Gm,D);%各代的最优解

14.value=zeros(1,Np);

15.

16.%产生初始种群

17.%xmin=-10;xmax=100;%带负数的下界

18.xmin=-5.12;

19.xmax=5.12;

20.functiony=f(v)

21.%Rastrigr函数

22.y=sum(v.^2-10.*cos(2.*pi.*v)+10);

23.end

24.

25.X0=(xmax-xmin)*rand(Np,D)+xmin;%产生Np个D维向量

26.XG=X0;

27.

28.%%%%%%%%%%%%%这里未做评价，不判断终止条件%%%%%%%%%%%%%%%%%%%%%%%%

29.

30.XG_next_1=zeros(Np,D);%初始化

31.XG_next_2=zeros(Np,D);

32.XG_next=zeros(Np,D);

33.

34.whileG=Gm

35.G

36.%%%%%%%%%%%%%%%%%%%%%%%%变异操作%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

37.

fori=1:Np

38.%产生j,k,p三个不同的数

39.a=1;

40.b=Np;

41.dx=randperm(b-a+1)+a-1;

42.j=dx(1);

43.k=dx(2);

44.p=dx(3);

45.%要保证与i不同

46.

ifj==i

47.j=dx(4);

48.elseifk==i

49.k=dx(4);

50.elseifp==i

51.p=dx(4);

52.end

53.end

54.end

55.

56.%变异算子

57.suanzi=exp(1-Gm/(Gm+1-G));

58.F=F0*2.^suanzi;

59.%变异的个体来自三个随机父代

60.

61.son=XG(p,:)+F*(XG(j,:)-XG(k,:));

62.

forj=1:D

63.ifson(1,j)xminson(1,j)xmax%防止变异超出边界

64.XG_next_1(i,j)=son(1,j);

65.else

66.XG_next_1(i,j)=(xmax-xmin)*rand(1)+xmin;

67.end

68.end

69.end

70.