資源簡介
這是基本的果蠅優(yōu)化算法,簡單高效,非常適合初學者使用。
代碼片段和文件信息
function?result=fitt(xN)
%f1???[-100100]
%{
sum=0;
for?j=1:N
????sum=sum+x(j)^2;
end
result=sum;
%}
%f2???[-1010]
%{
sum1=0;
sum2=1;
for?j=1:N
????sum1=sum1+?abs(x(j));
????sum2=sum2*?abs(x(j));
end
result=sum1+sum2;
%}
%f3???[-100100]
%{
sum1=0;
?sum2=0;
?for?i=1:N
?for?j=1:i
????sum1=sum1+x(j);
?end
?sum2=sum2+sum1^2;
?end
result=sum2;
%}
%f4??[-100100]
%result=max(abs(x));
%f5??[-100100]
%
sum=0;
for?j=1:N
????sum=sum+(floor(x(j)+0.5))^2;
end
????result=sum;
?%}??
????
????
%f6??[-1.281.28]
%{
sum=0;
for?j=1:N
????sum=sum+j*x(j)^4;
end
result=sum+rand;
%}
?
%f7???[-100100]
%{
su=0;
for?j=1:N
????su=su+(x(j)-pi)^2;
end
sum=1;
for?i=1:N
sum=sum*cos(x(i));
end
result=-(sum*exp(-su));
%}
?
%f8???[
?屬性????????????大小?????日期????時間???名稱
-----------?---------??----------?-----??----
?????文件???????1638??2014-10-09?22:54??FOA\fitt.m
?????文件???????2250??2014-10-09?22:54??FOA\FOA_first.m
?????目錄??????????0??2014-10-09?22:54??FOA
-----------?---------??----------?-----??----
?????????????????3888????????????????????3
評論
共有 條評論