【樽海鞘算法】基于疯狂自适应的樽海鞘算法求解单目标优化问题附matlab代码...

✅作者简介：热爱科研的Matlab仿真开发者，修心和技术同步精进。

🍎个人主页：​ ​Matlab科研工作室​​

🍊个人信条：格物致知。

更多Matlab仿真内容点击👇

​ ​智能优化算法​​​  ​ ​神经网络预测​​​ ​ ​雷达通信 ​​​ ​ ​无线传感器​​

​ ​信号处理​​​ ​ ​图像处理​​​ ​ ​路径规划​​​ ​ ​元胞自动机​​​ ​ ​无人机​​

⛄ 内容介绍

针对樽海鞘群算法求解精度不高和收敛速度慢等缺点,提出一种基于疯狂自适应的樽海鞘群算法.引入Tent混沌序列生成初始种群,以增加初始个体的多样性;在食物源位置上引入疯狂算子,增强种群的多样性;在追随者位置更新公式中引入自适应惯性权重,使算法的全局搜索和局部搜索能力得到更好的平衡.使用统计分析、收敛速度分析、Wilcoxon检验、经典基准函数和CEC2014函数的标准差评估改进樽海鞘群算法的效率.结果表明,改进算法具有更好的全局搜索能力和求解鲁棒性,同时,寻优精度和收敛速度也比原来算法有所增强,尤其在求解高维和多峰测试函数上,改进算法拥有更好的性能.

⛄ 部分代码

%_________________________________________________________________________________

%  Salp Swarm Algorithm (SSA) source codes version 1.0

%

%  Developed in MATLAB R2016a

%

%  Author and programmer: Seyedali Mirjalili

%

%         e-Mail: ali.mirjalili@gmail.com

%                 seyedali.mirjalili@griffithuni.edu.au

%

%       Homepage: http://www.alimirjalili.com

%

%   Main paper:

%   S. Mirjalili, A.H. Gandomi, S.Z. Mirjalili, S. Saremi, H. Faris, S.M. Mirjalili,

%   Salp Swarm Algorithm: A bio-inspired optimizer for engineering design problems

%   Advances in Engineering Software

%   DOI: http://dx.doi.org/10.1016/j.advengsoft.2017.07.002

%____________________________________________________________________________________

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]张达敏, 陈忠云, 辛梓芸,等. 基于疯狂自适应的樽海鞘群算法[J]. 控制与决策, 2020, 35(9):9.

❤️ 关注我领取海量matlab电子书和数学建模资料

❤️部分理论引用网络文献，若有侵权联系博主删除