[转帖]求完全图哈密尔顿圈的遗传模拟退火算法matlab通用源程序

kkkttt

1. % maxpop 给定群体规模
   
2. % pop 群体
   
3. % newpop 种群
   
4. %t0 初始温度
   
5. function [codmin,finmin]=fc0(cc,v0,t0)
   
6. N=length(cc(1,:));
   
7. %定群体规模
   
8. if N>50
   
9. maxpop=2*N-20;
   
10. end
    
11. if N<=40
    
12. maxpop=2*N;
    
13. end
    
14. %产生初始群体
    
15. pop=zeros(maxpop,N);
    
16. pop(:,1)=v0;
    
17. finmin=inf;
    
18. codmin=0;
    
19. for i=1:maxpop
    
20. Ra=randperm(N);
    
21. Ra(find(Ra==v0))=Ra(1);
    
22. Ra(1)=v0;
    
23. pop(i,:)=Ra;
    
24. end
    
25. t=t0;
    
26. while t>0
    
27. %用模拟退火产生新的群体
    
28. pop=fc1(maxpop,pop,N,cc,v0,t);
    
29. %转轮赌选择种群
    
30. f=zeros(1,maxpop);
    
31. for i=1:maxpop
    
32. for j=1:N-1
    
33. x=pop(i,j);
    
34. y=pop(i,j+1);
    
35. fo1=cc(pop(i,j),pop(i,j+1));
    
36. f(i)=f(i)+fo1;
    
37. end
    
38. f(i)=f(i)+cc(pop(i,1),pop(i,N));
    
39. end
    
40. fmin=min(f);
    
41. for i=1:maxpop
    
42. if fmin==inf&f(i)==inf
    
43. dd=inf;
    
44. end
    
45. if fmin~=inf|f(i)~=inf
    
46. dd=fmin-f(i);
    
47. end
    
48. ftk(i)=exp(dd/t);
    
49. end
    
50. [fin1,cod]=sort(-ftk);
    
51. fin=abs(fin1);
    
52. %f(cod(1))
    
53. if f(cod(1))<finmin %记录当代最优解
    
54. finmin=f(cod(1));
    
55. codmin=pop(cod(1),:);
    
56. end
    
57. for i=1:maxpop
    
58. RR=rand(1);
    
59. cod2=find(fin>=RR);
    
60. % cod
    
61. newpop(i,:)=pop(cod(cod2(end)),:);
    
62. end
    
63. %单亲繁殖
    
64. if N>32
    
65. jmax=round(N/9);
    
66. end
    
67. if N<=32
    
68. jmax=2;
    
69. end
    
70. if mod(jmax,2)
    
71. jmax=jmax-1;
    
72. end
    
73. for i=1:maxpop
    
74. for j=1:2:jmax
    
75. nn=randperm(N);
    
76. x=nn(j);
    
77. y=nn(j+1);
    
78. if newpop(i,x)==v0|newpop(i,y)==v0
    
79. continue;
    
80. end
    
81. box1=newpop(i,x);
    
82. newpop(i,x)=newpop(i,y);
    
83. newpop(i,y)=box1;
    
84. end
    
85. end
    
86. %变异 Pc
    
87. Pc=0.02;
    
88. for i=1:maxpop
    
89. R1=rand(1);
    
90. if Pc>R1
    
91. for j=1:2:jmax+2
    
92. nn=randperm(N);
    
93. x=nn(j);
    
94. y=nn(j+1);
    
95. if newpop(i,x)==v0|newpop(i,y)==v0
    
96. pop(i,:)=newpop(i,:);
    
97. continue;
    
98. end
    
99. box1=newpop(i,x);
    
100. newpop(i,x)=newpop(i,y);
     
101. newpop(i,y)=box1;
     
102. pop(i,:)=newpop(i,:);
     
103. end
     
104. end
     
105. end
     
106. %温度下降
     
107. t=t-0.1;
     
108. end
     
109. 
     
110. function pop=fc1(maxpop,pop,N,cc,v0,t)
     
111. ff(N-1)=0;
     
112. f=0;
     
113. pop1=zeros(maxpop,N);
     
114. for i=1:maxpop
     
115. for j=1:N-1
     
116. x=pop(i,j);
     
117. y=pop(i,j+1);
     
118. ff(j)=cc(pop(i,j),pop(i,j+1));
     
119. pop1(i,:)=pop(i,:);
     
120. nn=randperm(N);
     
121. x=nn(1);
     
122. y=nn(2);
     
123. pop1=pop;
     
124. if pop(i,x)==v0|pop(i,x)==v0
     
125. continue
     
126. box1=pop(i,x);
     
127. pop1(i,x)=pop1(i,y);
     
128. pop1(i,y)=box1;
     
129. end
     
130. ff1(j)=cc(pop1(i,j),pop1(i,j+1));
     
131. end
     
132. f=sum(ff);
     
133. f1=sum(ff1);
     
134. 
     
135. if f==inf&f1==inf
     
136. dd=inf;
     
137. end
     
138. if f~=inf|f1~=inf
     
139. dd=f-f1;
     
140. end
     
141. 
     
142. Aij=min(1,exp(dd/t));
     
143. Pacept=rand(1);
     
144. if Aij>Pacept
     
145. pop(i,:)=pop1(i,:);
     
146. end
     
147. end

复制代码

jackone

赞楼主

woshiliumang

一个好的程序是要有好的注解的啊 这里的注解太少  我看这一点以后值得注意啊!!!:handshake

qinle

给你程序就不错了,如果有能力自己去写啊,就烦这种得了便宜还说三道四的主儿.

暴风雨后的宁静

谢谢了,很感谢

jinbin

感谢分享！