一、麻雀算法
二、基于 Sobol 序列和纵横交叉策略的麻雀搜索算法(SSASC)
针对麻雀搜索算法(SSA)容易陷入局部最优、收敛速度较慢等问题,本文提出一种基于Sobol序列和纵横交叉的麻雀搜索算法(SSASC)算法。首先,在初始化阶段引入类随机采样方法中的Sobol序列,增强种群的多样性和遍历性。其次,提出一种指数形式的非线性惯性权重,提高了算法的收敛效率。最后,应用纵横交叉策略对算法进行改进,利用横向交叉增强全局搜索能力,利用纵向交叉保持种群的多样性,防止算法陷入局部最优。选取了13个基准函数进行仿真实验,同时使用Wilcoxon检验和Friedman检验评价算法的性能。将基准函数从10维扩展到100维,与其他元启发式算法相比,SSASC在平均值和标准差处始终排名第一。实验结果表明,该算法在收敛速度和求解准确度方面均取得了实质性的优势。
三、部分代码
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; end Convergence_curve = zeros(1,Max_iter); %Initialize the positions of salps SalpPositions=initialization(N,dim,ub,lb); FoodPosition=zeros(1,dim); FoodFitness=inf; %calculate the fitness of initial salps for 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),:); end FoodPosition=Sorted_salps(1,:); FoodFitness=sorted_salps_fitness(1); %Main loop l=2; % start from the second iteration since the first iteration was dedicated to calculating the fitness of salps while 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
四、仿真结果
五、参考文献
[1]段玉先,刘昌云.基于Sobol序列和纵横交叉策略的麻雀搜索算法[J/OL].计算机应用,{3},{4}{5}:1-9[2021-07-14].