【优化求解】基于混沌精英哈里斯鹰算法求解单目标优化问题CEHHO附matlab代码...

1 简介

针对哈里斯鹰优化(HHO)算法存在的收敛精度低,收敛速度慢,易于陷入局部最优的不足,提出了一种混沌精英哈里斯鹰优化(CEHHO)算法.首先,引入精英等级制度策略,以充分利用优势种群来增强种群多样性以及提升算法收敛速度和精度;其次,利用Tent混沌映射调整算法关键参数;然后,使用一种非线性能量因子调节策略来平衡算法的开发与探索;最后,使用高斯随机游走策略对最优个体施加扰动,并在算法停滞时,利用随机游走策略使算法有效跳出局部最优.通过对20个基准测试函数在不同维度下进行仿真实验,来评估算法的寻优能力.实验结果表明,改进算法的表现优于鲸鱼优化算法(WOA),灰狼优化(GWO)算法,粒子群优化(PSO)算法和生物地理优化(BBO)算法,性能较原始HHO算法有明显提升,验证了改进算法的有效性.

2 部分代码

%% %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

% Harris's hawk optimizer: In this algorithm, Harris' hawks try to catch the rabbit.

% T: maximum iterations, N: populatoin size, CNVG: Convergence curve

% To run HHO: [Rabbit_Energy,Rabbit_Location,CNVG]=HHO(N,T,lb,ub,dim,fobj)

function [Rabbit_Energy,Rabbit_Location,CNVG]=HHO(N,T,lb,ub,dim,fobj)

disp('HHO is now tackling your problem')

tic

% initialize the location and Energy of the rabbit

Rabbit_Location=zeros(1,dim);

Rabbit_Energy=inf;

%Initialize the locations of Harris' hawks

X=initialization(N,dim,ub,lb);

CNVG=zeros(1,T);

t=0; % Loop counter

while t<T

    for i=1:size(X,1)

        % Check boundries

        FU=X(i,:)>ub;FL=X(i,:)<lb;X(i,:)=(X(i,:).*(~(FU+FL)))+ub.*FU+lb.*FL;

        % fitness of locations

        fitness=fobj(X(i,:));

        % Update the location of Rabbit

        if fitness<Rabbit_Energy

            Rabbit_Energy=fitness;

            Rabbit_Location=X(i,:);

        end

    end

    E1=2*(1-(t/T)); % factor to show the decreaing energy of rabbit

    % Update the location of Harris' hawks

    for i=1:size(X,1)

        E0=2*rand()-1; %-1<E0<1

        Escaping_Energy=E1*(E0);  % escaping energy of rabbit

        if abs(Escaping_Energy)>=1

            %% Exploration:

            % Harris' hawks perch randomly based on 2 strategy:

            q=rand();

            rand_Hawk_index = floor(N*rand()+1);

            X_rand = X(rand_Hawk_index, :);

            if q<0.5

                % perch based on other family members

                X(i,:)=X_rand-rand()*abs(X_rand-2*rand()*X(i,:));

            elseif q>=0.5

                % perch on a random tall tree (random site inside group's home range)

                X(i,:)=(Rabbit_Location(1,:)-mean(X))-rand()*((ub-lb)*rand+lb);

            end

        elseif abs(Escaping_Energy)<1

            %% Exploitation:

            % Attacking the rabbit using 4 strategies regarding the behavior of the rabbit

            %% phase 1: surprise pounce (seven kills)

            % surprise pounce (seven kills): multiple, short rapid dives by different hawks

            r=rand(); % probablity of each event

            if r>=0.5 && abs(Escaping_Energy)<0.5 % Hard besiege

                X(i,:)=(Rabbit_Location)-Escaping_Energy*abs(Rabbit_Location-X(i,:));

            end

            if r>=0.5 && abs(Escaping_Energy)>=0.5  % Soft besiege

                Jump_strength=2*(1-rand()); % random jump strength of the rabbit

                X(i,:)=(Rabbit_Location-X(i,:))-Escaping_Energy*abs(Jump_strength*Rabbit_Location-X(i,:));

            end

            %% phase 2: performing team rapid dives (leapfrog movements)

            if r<0.5 && abs(Escaping_Energy)>=0.5, % Soft besiege % rabbit try to escape by many zigzag deceptive motions

                Jump_strength=2*(1-rand());

                X1=Rabbit_Location-Escaping_Energy*abs(Jump_strength*Rabbit_Location-X(i,:));

                if fobj(X1)<fobj(X(i,:)) % improved move?

                    X(i,:)=X1;

                else % hawks perform levy-based short rapid dives around the rabbit

                    X2=Rabbit_Location-Escaping_Energy*abs(Jump_strength*Rabbit_Location-X(i,:))+rand(1,dim).*Levy(dim);

                    if (fobj(X2)<fobj(X(i,:))), % improved move?

                        X(i,:)=X2;

                    end

                end

            end

            if r<0.5 && abs(Escaping_Energy)<0.5, % Hard besiege % rabbit try to escape by many zigzag deceptive motions

                % hawks try to decrease their average location with the rabbit

                Jump_strength=2*(1-rand());

                X1=Rabbit_Location-Escaping_Energy*abs(Jump_strength*Rabbit_Location-mean(X));

                if fobj(X1)<fobj(X(i,:)) % improved move?

                    X(i,:)=X1;

                else % Perform levy-based short rapid dives around the rabbit

                    X2=Rabbit_Location-Escaping_Energy*abs(Jump_strength*Rabbit_Location-mean(X))+rand(1,dim).*Levy(dim);

                    if (fobj(X2)<fobj(X(i,:))), % improved move?

                        X(i,:)=X2;

                    end

                end

            end

            %%

        end

    end

    t=t+1;

    CNVG(t)=Rabbit_Energy;

%    Print the progress every 100 iterations

%    if mod(t,100)==0

%        display(['At iteration ', num2str(t), ' the best fitness is ', num2str(Rabbit_Energy)]);

%    end

end

toc

end

% ___________________________________

function o=Levy(d)

beta=1.5;

sigma=(gamma(1+beta)*sin(pi*beta/2)/(gamma((1+beta)/2)*beta*2^((beta-1)/2)))^(1/beta);

u=randn(1,d)*sigma;v=randn(1,d);step=u./abs(v).^(1/beta);

o=step;

end

3 仿真结果

4 参考文献

[1]汤安迪, 韩统, 徐登武,等. 混沌精英哈里斯鹰优化算法[J]. 计算机应用, 2021, 41(8):8.

博主简介：擅长智能优化算法、神经网络预测、信号处理、元胞自动机、图像处理、路径规划、无人机等多种领域的Matlab仿真，相关matlab代码问题可私信交流。

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