蜣螂优化算法完整代码（DBO）
参考文献：Dung beetle optimizer: a new meta‑heuristic algorithm for global optimization
有关算法的介绍可参考其他博客！该博客主要分享DBO算法的代码，并带有中文注释！
分享不易，喜欢的请大家点赞加收藏，谢谢！
（1）标准测试函数
function [lb,ub,dim,fobj] = Get_Functions_details(F)
switch F
case 'F1'
fobj = @F1;
lb=-100;
ub=100;
dim=30;
case 'F2'
fobj = @F2;
lb=-10;
ub=10;
dim=30;
case 'F3'
fobj = @F3;
lb=-100;
ub=100;
dim=30;
case 'F4'
fobj = @F4;
lb=-100;
ub=100;
dim=30;
case 'F5'
fobj = @F5;
lb=-30;
ub=30;
dim=30;
case 'F6'
fobj = @F6;
lb=-100;
ub=100;
dim=30;
case 'F7'
fobj = @F7;
lb=-1.28;
ub=1.28;
dim=30;
case 'F8'
fobj = @F8;
lb=-500;
ub=500;
dim=30;
case 'F9'
fobj = @F9;
lb=-5.12;
ub=5.12;
dim=30;
case 'F10'
fobj = @F10;
lb=-32;
ub=32;
dim=30;
case 'F11'
fobj = @F11;
lb=-600;
ub=600;
dim=30;
case 'F12'
fobj = @F12;
lb=-50;
ub=50;
dim=30;
case 'F13'
fobj = @F13;
lb=-50;
ub=50;
dim=30;
case 'F14'
fobj = @F14;
lb=-65.536;
ub=65.536;
dim=2;
case 'F15'
fobj = @F15;
lb=-5;
ub=5;
dim=4;
case 'F16'
fobj = @F16;
lb=-5;
ub=5;
dim=2;
case 'F17'
fobj = @F17;
lb=[-5,0];
ub=[10,15];
dim=2;
case 'F18'
fobj = @F18;
lb=-2;
ub=2;
dim=2;
case 'F19'
fobj = @F19;
lb=0;
ub=1;
dim=3;
case 'F20'
fobj = @F20;
lb=0;
ub=1;
dim=6;
case 'F21'
fobj = @F21;
lb=0;
ub=10;
dim=4;
case 'F22'
fobj = @F22;
lb=0;
ub=10;
dim=4;
case 'F23'
fobj = @F23;
lb=0;
ub=10;
dim=4;
end
end
% F1
function o = F1(x)
o=sum(x.^2);
end
% F2
function o = F2(x)
o=sum(abs(x))+prod(abs(x));
end
% F3
function o = F3(x)
dim=size(x,2);
o=0;
for i=1:dim
o=o+sum(x(1:i))^2;
end
end
% F4
function o = F4(x)
o=max(abs(x));
end
% F5
function o = F5(x)
dim=size(x,2);
o=sum(100*(x(2:dim)-(x(1:dim-1).^2)).^2+(x(1:dim-1)-1).^2);
end
% F6
function o = F6(x)
o=sum(abs((x+.5)).^2);
end
% F7
function o = F7(x)
dim=size(x,2);
o=sum([1:dim].*(x.^4))+rand;
end
% F8
function o = F8(x)
o=sum(-x.*sin(sqrt(abs(x))));
end
% F9
function o = F9(x)
dim=size(x,2);
o=sum(x.^2-10*cos(2*pi.*x))+10*dim;
end
% F10
function o = F10(x)
dim=size(x,2);
o=-20*exp(-.2*sqrt(sum(x.^2)/dim))-exp(sum(cos(2*pi.*x))/dim)+20+exp(1);
end
% F11
function o = F11(x)
dim=size(x,2);
o=sum(x.^2)/4000-prod(cos(x./sqrt([1:dim])))+1;
end
% F12
function o = F12(x)
dim=size(x,2);
o=(pi/dim)*(10*((sin(pi*(1+(x(1)+1)/4)))^2)+sum((((x(1:dim-1)+1)./4).^2).*...
(1+10.*((sin(pi.*(1+(x(2:dim)+1)./4)))).^2))+((x(dim)+1)/4)^2)+sum(Ufun(x,10,100,4));
end
% F13
function o = F13(x)
dim=size(x,2);
o=.1*((sin(3*pi*x(1)))^2+sum((x(1:dim-1)-1).^2.*(1+(sin(3.*pi.*x(2:dim))).^2))+...
((x(dim)-1)^2)*(1+(sin(2*pi*x(dim)))^2))+sum(Ufun(x,5,100,4));
end
% F14
function o = F14(x)
aS=[-32 -16 0 16 32 -32 -16 0 16 32 -32 -16 0 16 32 -32 -16 0 16 32 -32 -16 0 16 32;,...
-32 -32 -32 -32 -32 -16 -16 -16 -16 -16 0 0 0 0 0 16 16 16 16 16 32 32 32 32 32];
for j=1:25
bS(j)=sum((x'-aS(:,j)).^6);
end
o=(1/500+sum(1./([1:25]+bS))).^(-1);
end
% F15
function o = F15(x)
aK=[.1957 .1947 .1735 .16 .0844 .0627 .0456 .0342 .0323 .0235 .0246];
bK=[.25 .5 1 2 4 6 8 10 12 14 16];bK=1./bK;
o=sum((aK-((x(1).*(bK.^2+x(2).*bK))./(bK.^2+x(3).*bK+x(4)))).^2);
end
% F16
function o = F16(x)
o=4*(x(1)^2)-2.1*(x(1)^4)+(x(1)^6)/3+x(1)*x(2)-4*(x(2)^2)+4*(x(2)^4);
end
% F17
function o = F17(x)
o=(x(2)-(x(1)^2)*5.1/(4*(pi^2))+5/pi*x(1)-6)^2+10*(1-1/(8*pi))*cos(x(1))+10;
end
% F18
function o = F18(x)
o=(1+(x(1)+x(2)+1)^2*(19-14*x(1)+3*(x(1)^2)-14*x(2)+6*x(1)*x(2)+3*x(2)^2))*...
(30+(2*x(1)-3*x(2))^2*(18-32*x(1)+12*(x(1)^2)+48*x(2)-36*x(1)*x(2)+27*(x(2)^2)));
end
% F19
function o = F19(x)
aH=[3 10 30;.1 10 35;3 10 30;.1 10 35];cH=[1 1.2 3 3.2];
pH=[.3689 .117 .2673;.4699 .4387 .747;.1091 .8732 .5547;.03815 .5743 .8828];
o=0;
for i=1:4
o=o-cH(i)*exp(-(sum(aH(i,:).*((x-pH(i,:)).^2))));
end
end
% F20
function o = F20(x)
aH=[10 3 17 3.5 1.7 8;.05 10 17 .1 8 14;3 3.5 1.7 10 17 8;17 8 .05 10 .1 14];
cH=[1 1.2 3 3.2];
pH=[.1312 .1696 .5569 .0124 .8283 .5886;.2329 .4135 .8307 .3736 .1004 .9991;...
.2348 .1415 .3522 .2883 .3047 .6650;.4047 .8828 .8732 .5743 .1091 .0381];
o=0;
for i=1:4
o=o-cH(i)*exp(-(sum(aH(i,:).*((x-pH(i,:)).^2))));
end
end
% F21
function o = F21(x)
aSH=[4 4 4 4;1 1 1 1;8 8 8 8;6 6 6 6;3 7 3 7;2 9 2 9;5 5 3 3;8 1 8 1;6 2 6 2;7 3.6 7 3.6];
cSH=[.1 .2 .2 .4 .4 .6 .3 .7 .5 .5];
o=0;
for i=1:5
o=o-((x-aSH(i,:))*(x-aSH(i,:))'+cSH(i))^(-1);
end
end
% F22
function o = F22(x)
aSH=[4 4 4 4;1 1 1 1;8 8 8 8;6 6 6 6;3 7 3 7;2 9 2 9;5 5 3 3;8 1 8 1;6 2 6 2;7 3.6 7 3.6];
cSH=[.1 .2 .2 .4 .4 .6 .3 .7 .5 .5];
o=0;
for i=1:7
o=o-((x-aSH(i,:))*(x-aSH(i,:))'+cSH(i))^(-1);
end
end
% F23
function o = F23(x)
aSH=[4 4 4 4;1 1 1 1;8 8 8 8;6 6 6 6;3 7 3 7;2 9 2 9;5 5 3 3;8 1 8 1;6 2 6 2;7 3.6 7 3.6];
cSH=[.1 .2 .2 .4 .4 .6 .3 .7 .5 .5];
o=0;
for i=1:10
o=o-((x-aSH(i,:))*(x-aSH(i,:))'+cSH(i))^(-1);
end
end
function o=Ufun(x,a,k,m)
o=k.*((x-a).^m).*(x>a)+k.*((-x-a).^m).*(x<(-a));
end
（2）DBO算法的主程序
% Code by Luzhenhui Yangtze University
% 参考文献：Dung beetle optimizer: a new meta‑heuristic algorithm for global optimization
% 输入参数
% pop：种群个体数量（需要注意的是种群的大小以及各个小种群的大小都是可以根据实际问题自行调整的）
% M：算法的迭代次数
% fobj：用来计算适应度的函数
% c：变量的取值下界（1*1）
% d：变量的取值上界（1*1）
function [fMin,bestX,Convergence_curve]=DBO(pop,M,c,d,dim,fobj)
P_percent=0.2; % 滚球蜣螂所占整个种群的比例
pNum = round(pop*P_percent); %滚球蜣螂的数量
lb=c.*ones(1,dim); %下边界 a vector
ub=d.*ones(1,dim); % 上边界 a vector
%Initialization 初始化种群
for i =1:pop
x(i,:)=lb+(ub-lb).*rand(1,dim);
fit(i)=fobj(x(i,:));
end
pFit=fit;
pX=x;
XX=pX;
[fMin,bestI]=min(fit); % fMin denotes the global optimum fitness value 全局最优值及其个体位置信息
bestX=x(bestI,:); % bestX denotes the global optimum position corresponding to fMin 最优值所所对应的最优个体
% Start updating the solutions.
for t=1:M
[~,B]=max(fit);
worse= x(B,:); % 全局最差位置
r2=rand(1);
%%%%%%%%%%%%%%%%%%%这一部位为滚球蜣螂的位置更新%%%%%%%%%%%%%%%%%%%%%%%%%
for i = 1 : pNum
if(r2<0.9)
a=rand(1,1);
if (a>0.1)
a=1;
else
a=-1;
end
x(i,:)=pX(i,:)+0.3*abs(pX(i,:)-worse)+a*0.1*(XX(i,:)); % Equation (1) 公式1
else
%%%%%%%%%%对应论文中的公式2，可参考原文研读%%%%%%%%%%%%%%%%%%%%
aaa=randperm(180,1);
if (aaa==0||aaa==90||aaa==180)
x(i,:)=pX(i,:);
end
theta= aaa*pi/180;
x(i,:)=pX(i,:)+tan(theta).*abs(pX(i,:)-XX(i,:)); % Equation (2) 公式2
end
x(i,:)=Bounds(x(i,:),lb,ub); % 边界处理，对超过边界的变量进行去除
fit(i)=fobj(x(i,:));% 计算新的适应度值
end
[~,bestII]=min(fit); % 当前最优值及其个体位置信息
bestXX=x(bestII,:); % 当前最优解（及最优个体）
R=1-t/M;
%%%%%%%%%%%%%%%%%%% 对应论文中的公式3，可参考原文研读 %%%%%%%%%%%%%%%%%%%
Xnew1=bestXX.*(1-R);
Xnew2=bestXX.*(1+R); % Equation (3)
Xnew1=Bounds(Xnew1,lb,ub); % 对超过边界的变量进行去除
Xnew2=Bounds(Xnew2,lb,ub); % 对超过边界的变量进行去除
%%%%%%%%%%%%%%%%%%% 对应论文中的公式5，可参考原文研读 %%%%%%%%%%%%%%%%%%%
Xnew11=bestX.*(1-R);
Xnew22=bestX.*(1+R); % Equation (5)
Xnew11=Bounds(Xnew11,lb,ub); % 对超过边界的变量进行去除
Xnew22=Bounds(Xnew22,lb,ub); % 对超过边界的变量进行去除
%%%%%%%%%%%%%%%%%%% 对应论文中的公式4，可参考原文研读 %%%%%%%%%%%%%%%%%%%
for i=(pNum+1):12 % Equation (4)
x(i,:)=bestXX+((rand(1,dim)).*(pX(i,:)-Xnew1)+(rand(1,dim)).*(pX(i,:)-Xnew2));
x(i,:)=Bounds(x(i,:),Xnew1,Xnew2); % 对超过边界的变量进行去除，注意此时上下界变为Xnew1 和Xnew2
fit(i) = fobj(x(i,:)); % 计算新的适应度值
end
%%%%%%%%%%%%%%%%%% 对应论文中的公式6，可参考原文研读 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
for i=13:19 % Equation (6)
x(i,:)=pX(i,:)+((randn(1)).*(pX(i,:)-Xnew11)+((rand(1,dim)).*(pX(i,:)-Xnew22)));
x(i,:)=Bounds(x(i,:),lb,ub);% 对超过边界的变量进行去除
fit(i)=fobj(x(i,:)); % 计算新的适应度值
end
%%%%%%%%%%%%%%%%%%% 对应论文中的公式7，可参考原文研读 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
for j=20:pop % Equation (7)
x(j,:)=bestX+randn(1,dim).*((abs((pX(j,:)-bestXX)))+(abs((pX(j,:)-bestX))))./2;
x(j,:)=Bounds(x(j,:),lb,ub);% 对超过边界的变量进行去除
fit(j)=fobj(x(j,:)); % 计算新的适应度值
end
% Update the individual's best fitness vlaue and the global best fitness value
XX=pX;
for i=1:pop
if (fit(i)<pFit(i))
pFit(i)=fit(i);
pX(i,:)=x(i,:);
end
if(pFit(i)<fMin)
fMin=pFit(i);
bestX=pX(i,:);
end
end
Convergence_curve(t)=fMin;
end
end
% Application of simple limits/bounds 边界条件处理
function s = Bounds( s, Lb, Ub)
temp = s;
I = temp < Lb;
temp(I) = Lb(I);
J = temp > Ub;
temp(J) = Ub(J);
s = temp;
end
（3）调用程序
clc
clear
SearchAgents_no=30; % 种群的大小
Function_name='F1'; % 调用函数名
Max_iteration=500; % 最大迭代数
[lb,ub,dim,fobj]=Get_Functions_details(Function_name);
[fMin,bestX,DBO_curve]=DBO(SearchAgents_no,Max_iteration,lb,ub,dim,fobj); %调用蜣螂优化算法
%画图
semilogy(DBO_curve,'Color','g')
title('Objective space')
xlabel('Iteration');
ylabel('Best score obtained so far');
%axis tight
grid on
box on
legend('DBO')
display(['The best solution obtained by DBO is :',num2str(bestX)]);
display(['The best optimal value of the objective funciton found by DBO is :',num2str(fMin)]);
85
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
