## 2 部分代码

%% 樽海鞘算法function [FoodFitness,FoodPosition,Convergence_curve]=SSA(N,Max_iter,lb,ub,dim,fobj)if size(ub,1)==1    ub=ones(dim,1)*ub;    lb=ones(dim,1)*lb;endConvergence_curve = zeros(1,Max_iter);%Initialize the positions of salpsSalpPositions=initialization(N,dim,ub,lb);FoodPosition=zeros(1,dim);FoodFitness=inf;%calculate the fitness of initial salpsfor i=1:size(SalpPositions,1)    SalpFitness(1,i)=fobj(SalpPositions(i,:));end[sorted_salps_fitness,sorted_indexes]=sort(SalpFitness);for newindex=1:N    Sorted_salps(newindex,:)=SalpPositions(sorted_indexes(newindex),:);endFoodPosition=Sorted_salps(1,:);FoodFitness=sorted_salps_fitness(1);Convergence_curve(1) = inf;%Main loopl=2; % start from the second iteration since the first iteration was dedicated to calculating the fitness of salpswhile l<Max_iter+1    c1 = 2*exp(-(4*l/Max_iter)^2); % Eq. (3.2) in the paper    for i=1:size(SalpPositions,1)        SalpPositions= SalpPositions';        if i<=N/2            for j=1:1:dim                c2=rand();                c3=rand();                %%%%%%%%%%%%% % Eq. (3.1) in the paper %%%%%%%%%%%%%%                if c3<0.5                     SalpPositions(j,i)=FoodPosition(j)+c1*((ub(j)-lb(j))*c2+lb(j));                else                    SalpPositions(j,i)=FoodPosition(j)-c1*((ub(j)-lb(j))*c2+lb(j));                end                %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%            end        elseif i>N/2 && i<N+1            point1=SalpPositions(:,i-1);            point2=SalpPositions(:,i);            SalpPositions(:,i)=(point2+point1)/2; % % Eq. (3.4) in the paper        end        SalpPositions= SalpPositions';    end    for i=1:size(SalpPositions,1)        Tp=SalpPositions(i,:)>ub';Tm=SalpPositions(i,:)<lb';SalpPositions(i,:)=(SalpPositions(i,:).*(~(Tp+Tm)))+ub'.*Tp+lb'.*Tm;        SalpFitness(1,i)=fobj(SalpPositions(i,:));        if SalpFitness(1,i)<FoodFitness            FoodPosition=SalpPositions(i,:);            FoodFitness=SalpFitness(1,i);        end    end    Convergence_curve(l)=FoodFitness;    l = l + 1;end

## 4 参考文献

[1]陈忠云, 张达敏, 辛梓芸. 多子群的共生非均匀高斯变异樽海鞘群算法[J]. 自动化学报, 2022, 48(5):1307-1317.