基于萤火虫算法改进的帝国竞争算法多目标优化，帝国竞争算法求解多目标函数组合最小值，代码有注释

function f=Sphere(x,ati1) w0 = 1000000; theta=0.5; n=12; cti = 0.003; x = abs(x)+mean(x); x1 = (x(1:12)/sum(x(1:12)))'; f11 = w0.*x1.*(1+0.25.*(4.*ati1(:,1)+ati1(:,3)-ati1(:,2))); f21 = w0.*x1.*(sum(3.*ati1(:,3)+ati1(:,2))).^2./(64.*sum(w0.*x1.*ati1(:,3))); at01 =sum( w0./n.*ones(n,1).*(ati1(:,1)-ati1(:,2))-cti.*abs(w0*x1-w0/n)); bt01 = sum( w0./n.*ones(n,1).*ati1(:,1)-cti.*abs(w0*x1-w0/n)); ct01 = sum( w0./n.*(ati1(:,1)+ati1(:,3))-cti.*abs(w0*x1-w0/n)); phi11 = max([sum(w0.*x1.*ati1(:,2)) sum(w0.*x1.*ati1(:,3))]); phi21 = min([sum(w0.*x1.*ati1(:,1)) sum(w0.*x1.*ati1(:,1))]); x2 = (x(13:24)/sum(x(13:24)))'; f12 = w0.*x1.*(1+0.25.*(4.*ati1(:,4)+ati1(:,6)-ati1(:,5))); f22 = w0.*x2.*(sum(3.*ati1(:,3)+ati1(:,2))).^2./(64.*sum(w0.*x2.*ati1(:,3))); at02 = sum( w0./n.*ones(n,1).*(ati1(:,1)-ati1(:,2))-cti.*abs(w0*x2-w0/n)); bt02 = sum( w0./n.*ones(n,1).*ati1(:,1)-cti.*abs(w0*x2-w0/n)); ct02 = sum( w0./n.*(ati1(:,1)+ati1(:,3))-cti.*abs(w0*x2-w0/n)); phi12 = max([sum(w0.*x2.*ati1(:,2)) sum(w0.*x2.*ati1(:,3))]); phi22 = min([sum(w0.*x2.*ati1(:,1)) sum(w0.*x2.*ati1(:,1))]); x3 = (x(25:36)/sum(x(25:36)))'; f13 = w0.*x1.*(1+0.25.*(4.*ati1(:,7)+ati1(:,9)-ati1(:,8))); f23 = w0.*x3.*(sum(3.*ati1(:,3)+ati1(:,2))).^2./(64.*sum(w0.*x3.*ati1(:,3))); at03 = sum( w0./n.*ones(n,1).*(ati1(:,1)-ati1(:,2))-cti.*abs(w0*x3-w0/n)); bt03 = sum( w0./n.*ones(n,1).*ati1(:,1)-cti.*abs(w0*x3-w0/n)); ct03 = sum( w0./n.*(ati1(:,1)+ati1(:,3))-cti.*abs(w0*x3-w0/n)); phi13 = max([sum(w0.*x3.*ati1(:,2)) sum(w0.*x3.*ati1(:,3))]); phi23 = min([sum(w0.*x3.*ati1(:,1)) sum(w0.*x3.*ati1(:,1))]); f1 = sum(f11+f12+f13); f2 = sum(f21+f22+f23)+w0; at = w0+at01+at02+at03; bt = w0+bt01+bt02+bt03; ct = w0+ct01+ct02+ct03; p = (2*bt+ct-3*at)./(8.*(bt-at)); t = (3.*ct-2.*bt-at)./(8.*(ct-bt)); if at<f1&&f1<bt f3=(bt-at).*p-(bt-at).*(p.^2.*log(p)-(1-p).^2.*log(1-p)); else f3 = (bt-at)/2+(ct-bt).*(t.^2.*log(t)-(1-t).^2.*log(1-t)); end fpan = [f1 f2 f3]; f1 = (3.5*10^6-f1)/(3.5*10^6-2.5*10^6); % f2 = (1.0001*10^6-f2)/(1.0001*10^6-9.9999*10^5); f2b= sum(f2)-w0; f2c = (30-f2b)/(30-8 ); f2 = f2c; f3 = (1.5*10^5-f3)/(1.5*10^5-1*10^5); if max([f1 f2 f3])>1 pause elseif min([f1 f2 f3])<0 pause end f = -0.33*f1+0.33*f2+0.34*f3+1; phi1 = phi11+phi12+phi13; phi2 = phi21+phi22+phi23; pan2 =0; xx = [x1; x2; x3]; for ii = 1:3 pan2=pan2+sum((4.*ati1(:,(ii-1)*3+1)-ati1(:,(ii-1)*3+2)+ati1(:,(ii-1)*3+3)).*... (w0.*xx((ii-1)*12+1:12*ii)+4*(w0.*(xx((ii-1)*12+1:12*ii))-w0/12))); end if 33*phi1.^3+21*phi1.^2*phi2+11*phi1.*phi2.^2-phi1.^3<=96.*phi1.*theta*... (2.*w0-(4.*bt+pan2).^2) end