【优化求解-单目标求解】基于具有扰动机制和强化莱维飞行的蝗虫优化算法实现目标求解matlab代码

最新推荐文章于 2022-12-05 08:53:48 发布

天天Matlab科研工作室

最新推荐文章于 2022-12-05 08:53:48 发布

阅读量403

点赞数

分类专栏：优化求解文章标签： matlab 算法开发语言

本文链接：https://blog.csdn.net/qq_59747472/article/details/122470595

版权

优化求解专栏收录该内容

797 篇文章 273 订阅

订阅专栏

1 简介

针对蝗虫优化算法(Grasshopper Optimization Algorithm, GOA)存在求解精度低，收敛速度慢等问题，提出具有扰动机制和强化莱维飞行的蝗虫优化算法(DLGOA)，位置参数部分使用非线性曲线函数去平衡算法局部开发和全局探索；扰动因子引入位置更新公式，提高算法寻优精度、收敛速度；将莱维飞行的步长改进以避免陷入局部最优，并利用高斯分布的随机性增加种群多样性。通过对 7 个基准函数进行仿真实验以及使用 Wilcoxon 秩和检验来评价算法性能，实验结果表明DLGOA 算法具有较好的鲁棒性以及寻优精度，且明显提升了收敛速度。

蝗虫优化算法(Grasshopper Optimization Algorithm, GOA)在2017年被Saremi等人首次提出。GOA原理易懂、参数较少，易于实现。然而该算法收敛速度慢，容易收敛早熟，虽然具有强大的局部开发能力，但全局勘探的能力仍然有待提升。为了解决这些问题，在2019年文献[2]提出了一种基于动态权重机制和随机跳跃策略(DJGOA)的改进蝗虫优化算法，首先动态权重机制促进了算法迭代的利用，自适应调整蝗虫的搜索空间范围；随后使用随机跳跃策略有助于算法跳出局部最优。李洋洲等在2019年对参数c使用两种曲线自适应改进策略，这种基于曲线自适应和模拟退火的蝗虫优化算法(SA-CAGOA)，在求解精度方面有了明显改进。然而以上所引文献仍存在收敛速度慢、寻优精度有待优化的问题，本文提出一种具有扰动机制和双重搜索能力莱维飞行的蝗虫改进算法(DLGOA)。首先，提出动态自适应曲线的函数取代原本线性递减的参数c，使全局搜索和局部开发得到更好的平衡；其次，设置扰动因子改变位置更新步长，算法的寻优精度以及收敛速度均被有效提升；最后，引入带有双重搜索功能并具有高斯随机分布的约束因子动态步长的莱维飞行机制，不仅有效避免算法出现早熟收敛现象，并且增加了种群多样性，与此同时提高了寻优精度。

2 部分代码

%_________________________________________________________________________%
%  Grasshopper Optimization Algorithm (GOA) source codes demo V1.0        %
%                                                                         %
%_________________________________________________________________________%

% The Grasshopper Optimization Algorithm
function [TargetFitness,TargetPosition,Convergence_curve,Trajectories,fitness_history, position_history]=GOA(N, Max_iter, lb,ub, dim, fobj)

tic
disp('GOA is now estimating the global optimum for your problem....')

flag=0;
if size(ub,1)==1
    ub=ones(dim,1)*ub;
    lb=ones(dim,1)*lb;
end

if (rem(dim,2)~=0) % this algorithm should be run with a even number of variables. This line is to handle odd number of variables
    dim = dim+1;
    ub = [ub; 100];
    lb = [lb; -100];
    flag=1;
end

%Initialize the population of grasshoppers
GrassHopperPositions=initialization(N,dim,ub,lb);
GrassHopperFitness = zeros(1,N);

fitness_history=zeros(N,Max_iter);
position_history=zeros(N,Max_iter,dim);
Convergence_curve=zeros(1,Max_iter);
Trajectories=zeros(N,Max_iter);

cMax=1;
cMin=0.00004;
%Calculate the fitness of initial grasshoppers

for i=1:size(GrassHopperPositions,1)
    if flag == 1
        GrassHopperFitness(1,i)=fobj(GrassHopperPositions(i,1:end-1));
    else
        GrassHopperFitness(1,i)=fobj(GrassHopperPositions(i,:));
    end
    fitness_history(i,1)=GrassHopperFitness(1,i);
    position_history(i,1,:)=GrassHopperPositions(i,:);
    Trajectories(:,1)=GrassHopperPositions(:,1);
end

[sorted_fitness,sorted_indexes]=sort(GrassHopperFitness);

% Find the best grasshopper (target) in the first population 
for newindex=1:N
    Sorted_grasshopper(newindex,:)=GrassHopperPositions(sorted_indexes(newindex),:);
end

TargetPosition=Sorted_grasshopper(1,:);
TargetFitness=sorted_fitness(1);

% Main loop
l=2; % Start from the second iteration since the first iteration was dedicated to calculating the fitness of antlions
while l<Max_iter+1
    
    c=cMax-l*((cMax-cMin)/Max_iter); % Eq. (2.8) in the paper
    
     
     %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
      for i=1:size(GrassHopperPositions,1)
        temp= GrassHopperPositions';
       % for k=1:2:dim  
            S_i=zeros(dim,1);
            for j=1:N
                if i~=j
                    Dist=distance(temp(:,j), temp(:,i)); % Calculate the distance between two grasshoppers
                    
                    r_ij_vec=(temp(:,j)-temp(:,i))/(Dist+eps); % xj-xi/dij in Eq. (2.7)
                    xj_xi=2+rem(Dist,2); % |xjd - xid| in Eq. (2.7) 
                    
                    s_ij=((ub - lb)*c/2)*S_func(xj_xi).*r_ij_vec; % The first part inside the big bracket in Eq. (2.7)
                    S_i=S_i+s_ij;
                end
            end
            S_i_total = S_i;
            
      %  end
        
        X_new = c * S_i_total'+ (TargetPosition); % Eq. (2.7) in the paper      
        GrassHopperPositions_temp(i,:)=X_new'; 
      end
      
    %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
    % GrassHopperPositions
    GrassHopperPositions=GrassHopperPositions_temp;
    
    for i=1:size(GrassHopperPositions,1)
        % Relocate grasshoppers that go outside the search space 
        Tp=GrassHopperPositions(i,:)>ub';Tm=GrassHopperPositions(i,:)<lb';GrassHopperPositions(i,:)=(GrassHopperPositions(i,:).*(~(Tp+Tm)))+ub'.*Tp+lb'.*Tm;
        
        % Calculating the objective values for all grasshoppers
        if flag == 1
            GrassHopperFitness(1,i)=fobj(GrassHopperPositions(i,1:end-1));
        else
            GrassHopperFitness(1,i)=fobj(GrassHopperPositions(i,:));
        end
        fitness_history(i,l)=GrassHopperFitness(1,i);
        position_history(i,l,:)=GrassHopperPositions(i,:);
        
        Trajectories(:,l)=GrassHopperPositions(:,1);
        
        % Update the target
        if GrassHopperFitness(1,i)<TargetFitness
            TargetPosition=GrassHopperPositions(i,:);
            TargetFitness=GrassHopperFitness(1,i);
        end
    end
        
    Convergence_curve(l)=TargetFitness;
    disp(['In iteration #', num2str(l), ' , target''s objective = ', num2str(TargetFitness)])
    
    l = l + 1;
end


if (flag==1)
    TargetPosition = TargetPosition(1:dim-1);
end

time=toc