1 简介
随着现代居民居住地愈发集中,供水管网规模不断扩大,水资源供给面临着新的困难和挑战.其中包括水资源调度时的动态变化,管网的突发故障,水资源的不可控流失以及多目标和计算量庞大等问题.BP神经网络因拥有较强的自学习能力和泛化能力而被广泛应用于水资源预测问题中,但其也存在收敛速度慢,容易陷入局部极值的问题.群智能算法作为一种寻优算法,具有操作简单,收敛速度快,全局寻优能力强等优点.为提高BP神经网络在水资源预测方面的收敛速度和预测精度,提出一种基于鲸鱼算法优化的BP神经网络水资源需求预测模型,,再通过BP神经网络采用WOA算法输出的最优权值,阈值作为初始参数值训练模型.实验验证WOA-BP神经网络方法相比传统BP方法在预测精度方面有更优的表现.
具体模型参考底下文献。
2 部分代码
%_________________________________________________________________________% % Whale Optimization Algorithm (WOA) source codes demo 1.0 % % The Whale Optimization Algorithm function [Leader_score,Leader_pos,Convergence_curve]=WOA(SearchAgents_no,Max_iter,lb,ub,dim,fobj) % initialize position vector and score for the leader Leader_pos=zeros(1,dim); Leader_score=inf; %change this to -inf for maximization problems %Initialize the positions of search agents % Positions=initialization(SearchAgents_no,dim,ub,lb); Positions=ceil(rand(SearchAgents_no,dim).*(ub-lb)+lb); Convergence_curve=zeros(1,Max_iter); t=0;% Loop counter % Main loop while t<Max_iter for i=1:size(Positions,1) % Return back the search agents that go beyond the boundaries of the search space Flag4ub=Positions(i,:)>ub; Flag4lb=Positions(i,:)<lb; Positions(i,:)=(Positions(i,:).*(~(Flag4ub+Flag4lb)))+ub.*Flag4ub+lb.*Flag4lb; % Calculate objective function for each search agent fitness=fobj(Positions(i,:)); % Update the leader if fitness<Leader_score % Change this to > for maximization problem Leader_score=fitness; % Update alpha Leader_pos=Positions(i,:); end end a=2-t*((2)/Max_iter); % a decreases linearly fron 2 to 0 in Eq. (2.3) % a2 linearly dicreases from -1 to -2 to calculate t in Eq. (3.12) a2=-1+t*((-1)/Max_iter); % Update the Position of search agents for i=1:size(Positions,1) r1=rand(); % r1 is a random number in [0,1] r2=rand(); % r2 is a random number in [0,1] A=2*a*r1-a; % Eq. (2.3) in the paper C=2*r2; % Eq. (2.4) in the paper b=1; % parameters in Eq. (2.5) l=(a2-1)*rand+1; % parameters in Eq. (2.5) p = rand(); % p in Eq. (2.6) for j=1:size(Positions,2) if p<0.5 if abs(A)>=1 rand_leader_index = floor(SearchAgents_no*rand()+1); X_rand = Positions(rand_leader_index, :); D_X_rand=abs(C*X_rand(j)-Positions(i,j)); % Eq. (2.7) Positions(i,j)=X_rand(j)-A*D_X_rand; % Eq. (2.8) elseif abs(A)<1 D_Leader=abs(C*Leader_pos(j)-Positions(i,j)); % Eq. (2.1) Positions(i,j)=Leader_pos(j)-A*D_Leader; % Eq. (2.2) end elseif p>=0.5 distance2Leader=abs(Leader_pos(j)-Positions(i,j)); % Eq. (2.5) Positions(i,j)=distance2Leader*exp(b.*l).*cos(l.*2*pi)+Leader_pos(j); end end end t=t+1; Convergence_curve(t)=Leader_score; % [t Leader_score] end
3 仿真结果
4 参考文献
[1]马创, 周代棋, 张业. 基于改进鲸鱼算法的BP神经网络水资源需求预测方法[J]. 计算机科学, 2020, 47(S02):5.