【BP分类】基于matlab雾凇算法优化BP神经网络RIME-BP数据分类预测【含Matlab源码 4908期】.zip

%--------------------------------------------------------------------------------------------------------------------------- % RIME % RIME: A physics-based optimization % Website and codes of RIME:http://www.aliasgharheidari.com/RIME.html % Hang Su, Dong Zhao, Ali Asghar Heidari, Lei Liu, Xiaoqin Zhang, Majdi Mafarja, Huiling Chen % Last update: Feb 11 2023 % e-Mail: [email protected], [email protected], [email protected] % %--------------------------------------------------------------------------------------------------------------------------- % Authors: Ali Asghar Heidari([email protected], [email protected]),Huiling Chen([email protected]) %--------------------------------------------------------------------------------------------------------------------------- % After use of code, please users cite to the main paper on RIME: % Hang Su, Dong Zhao, Ali Asghar Heidari, Lei Liu, Xiaoqin Zhang, Majdi Mafarja, Huiling Chen % RIME: A physics-based optimization %Neurocomputing,ELSEVIER- 2023 %--------------------------------------------------------------------------------------------------------------------------- % You can also follow the paper for related updates in researchgate: % https://www.researchgate.net/profile/Ali_Asghar_Heidari. % Website and codes of RIME:% http://www.aliasgharheidari.com/RIME.html % You can also use and compare with our other new optimization methods: %(RIME)-2023-http://www.aliasgharheidari.com/RIME.html %(INFO)-2022- http://www.aliasgharheidari.com/INFO.html %(RUN)-2021- http://www.aliasgharheidari.com/RUN.html %(HGS)-2021- http://www.aliasgharheidari.com/HGS.html %(SMA)-2020- http://www.aliasgharheidari.com/SMA.html %(HHO)-2019- http://www.aliasgharheidari.com/HHO.html %--------------------------------------------------------------------------------------------------------------------------- function [Best_rime_rate,Best_rime,Convergence_curve]=RIME(N,Max_iter,lb,ub,dim,fobj) disp('RIME is now tackling your problem') % initialize position Best_rime=zeros(1,dim); Best_rime_rate=inf;%change this to -inf for maximization problems Rimepop=initialization(N,dim,ub,lb);%Initialize the set of random solutions Lb=lb.*ones(1,dim);% lower boundary Ub=ub.*ones(1,dim);% upper boundary it=1;%Number of iterations Convergence_curve=zeros(1,Max_iter); Rime_rates=zeros(1,N);%Initialize the fitness value newRime_rates=zeros(1,N); W = 5;%Soft-rime parameters, discussed in subsection 4.3.1 of the paper %Calculate the fitness value of the initial position for i=1:N Rime_rates(1,i)=fobj(Rimepop(i,:));%Calculate the fitness value for each search agent %Make greedy selections if Rime_rates(1,i)<Best_rime_rate Best_rime_rate=Rime_rates(1,i); Best_rime=Rimepop(i,:); end end % Main loop while it <= Max_iter RimeFactor = (rand-0.5)*2*cos((pi*it/(Max_iter/10)))*(1-round(it*W/Max_iter)/W);%Parameters of Eq.(3),(4),(5) E =sqrt(it/Max_iter);%Eq.(6) newRimepop = Rimepop;%Recording new populations normalized_rime_rates=normr(Rime_rates);%Parameters of Eq.(7) for i=1:N for j=1:dim %Soft-rime search strategy r1=rand(); if r1< E newRimepop(i,j)=Best_rime(1,j)+RimeFactor*((Ub(j)-Lb(j))*rand+Lb(j));%Eq.(3) end %Hard-rime puncture mechanism r2=rand(); if r2<normalized_rime_rates(i) newRimepop(i,j)=Best_rime(1,j);%Eq.(7) end end end for i=1:N %Boundary absorption Flag4ub=newRimepop(i,:)>ub; Flag4lb=newRimepop(i,:)<lb; newRimepop(i,:)=(newRimepop(i,:).*(~(Flag4ub+Flag4lb)))+ub.*Flag4ub+lb.*Flag4lb; newRime_rates(1,i)=fobj(newRimepop(i,:)); %Positive greedy selection mechanism if newRime_rates(1,i)<Rime_rates(1,i) Rime_rates(1,i) = newRime_rates(1,i); Rimepop(i,:) = newRimepop(i,:); if newRime_rates(1,i)< Best_rime_rate Best_rime_rate=Rime_rates(1,i); Best_rime=Rimepop(i,:); end end end Convergence_curve(it)=Best_rime_rate; it=it+1; end