完整的粒子群优化神经网络代码psobp.zip

clear all close all clc x=xlsread('SSA-PM2.5.csv'); y=xlsread('RAW-PM2.5.csv'); Q=1031; p=zeros(4,Q); p(1,2:Q)=x(1:Q-1); p(2,3:Q)=x(1:Q-2); p(3,4:Q)=x(1:Q-3); p(4,5:Q)=x(1:Q-4); p(5,6:Q)=x(1:Q-5); p(6,7:Q)=x(1:Q-6); p(7,8:Q)=x(1:Q-7); p(8,9:Q)=x(1:Q-8); p(9,10:Q)=x(1:Q-9); p(10,11:Q)=x(1:Q-10); p(11,12:Q)=x(1:Q-11); data=p';%1031x11 %训练数据和预测数据 input_train=data(1:1000,:)';%11x1021 input_test=data(1001:1031,:)';%11x10 output_train=x(1:1000)';%1x1021 output_test=x(1001:1031)';%1x10 output_test1=y(1001:1031)'; global minAllSamOut; global maxAllSamOut; [AllSamInn,minAllSamIn,maxAllSamIn,AllSamOutn,minAllSamOut,maxAllSamOut]=premnmx(input_train,output_train); % Evaluating Sample EvaSamIn=input_test; EvaSamInn=tramnmx(EvaSamIn,minAllSamIn,maxAllSamIn); % 将测试数据处理的格式与训练数据一样 % TargetOfTestSam=output_test; % add reall output of testing samples global Ptrain; Ptrain = input_train; global Ttrain; Ttrain = output_train; % Initialize BPN parameters global indim; indim=11; global hiddennum; hiddennum=7; global outdim; outdim=1; % Initialize PSO parameters vmax=0.5; % Maximum velocity minerr=0.001; % Minimum error wmax=0.90; wmin=0.30; global itmax; %Maximum iteration number itmax=60; c1=2; c2=2; for iter=1:itmax W(iter)=wmax-((wmax-wmin)/itmax)*iter; % 对后面没有作用weight declining linearly end % particles are initialized between (a,b) randomly a=-1; b=1; %Between (m,n), (which can also be started from zero) m=-1; n=1; global N; % number of particles N=40; global D; % length of particle D=(indim+1)*hiddennum+(hiddennum+1)*outdim; % Initialize positions of particles rand('state',sum(100*clock)); X=a+(b-a)*rand(N,D,1); %因为神经网络函数的取值范围[-1,1]，选取个体最优值以及局部最优值用到神经网络函数 %所以保证粒子的速度，位置均在[-1,1]之间，rand * 2 - 1 ,rand 产生[0,1]之间的随机数 %Initialize velocities of particles V=m+(n-m)*rand(N,D,1); global fvrec; MinFit=[]; BestFit=[]; %Function to be minimized, performance function,i.e.,mse of net work 神经网络建立 global net; net=newff(minmax(Ptrain),[hiddennum,outdim],{'tansig','purelin'}); fitness=fitcal(X,net,indim,hiddennum,outdim,D,Ptrain,Ttrain,minAllSamOut,maxAllSamOut); fvrec(:,1,1)=fitness(:,1,1);%40x1 [C,I]=min(fitness(:,1,1));%最小拟合值以及对应的索引 MinFit=[MinFit C];%最小拟合值 BestFit=[BestFit C];%最小拟合值 L(:,1,1)=fitness(:,1,1); %record the fitness of particle of every iterations B(1,1,1)=C;%record the minimum fitness of particle gbest(1,:,1)=X(I,:,1); %the global best x in population,最小适应值对应的一个粒子 %以上是在没有循环的情况下，粒子的空间位置随机产生一次，并通过适应度值，找出最小适应度值对应的粒子 %Matrix composed of gbest vector for p=1:N G(p,:,1)=gbest(1,:,1); end %最初所有粒子的极小值对应的就是局部最优值 for i=1:N pbest(i,:,1)=X(i,:,1); end %粒子的最初位置对应的就是粒子的最初极优值 V(:,:,2)=W(1)*V(:,:,1)+c1*rand*(pbest(:,:,1)-X(:,:,1))+c2*rand*(G(:,:,1)-X(:,:,1)); %V(:,:,2)=cf*(W(1)*V(:,:,1)+c1*rand*(pbest(:,:,1)-X(:,:,1))+c2*rand*(G(:,:,1)-X(:,:,1))); %V(:,:,2)=cf*(V(:,:,1)+c1*rand*(pbest(:,:,1)-X(:,:,1))+c2*rand*(G(:,:,1)-X(:,:,1))); % limits velocity of particles by vmax for ni=1:N for di=1:D if V(ni,di,2)>vmax V(ni,di,2)=vmax; elseif V(ni,di,2)<-vmax V(ni,di,2)=-vmax; else V(ni,di,2)=V(ni,di,2); end end end X(:,:,2)=X(:,:,1)+V(:,:,2) %****************************************************** for j=2:itmax disp('Iteration and Current Best Fitness') disp(j-1) disp(B(1,1,j-1)) % Calculation of new positions fitness=fitcal(X,net,indim,hiddennum,outdim,D,Ptrain,Ttrain,minAllSamOut,maxAllSamOut); fvrec(:,1,j)=fitness(:,1,j); %[maxC,maxI]=max(fitness(:,1,j)); %MaxFit=[MaxFit maxC]; %MeanFit=[MeanFit mean(fitness(:,1,j))]; [C,I]=min(fitness(:,1,j)); MinFit=[MinFit C]; BestFit=[BestFit min(MinFit)]; L(:,1,j)=fitness(:,1,j); B(1,1,j)=C; gbest(1,:,j)=X(I,:,j); [C,I]=min(B(1,1,:)); % keep gbest is the best particle of all have occured if B(1,1,j)<=C gbest(1,:,j)=gbest(1,:,j); else gbest(1,:,j)=gbest(1,:,I); end if C<=minerr, break, end %Matrix composed of gbest vector if j>=itmax, break, end for p=1:N G(p,:,j)=gbest(1,:,j); end for i=1:N; [C,I]=min(L(i,1,:)); if L(i,1,j)<=C pbest(i,:,j)=X(i,:,j); else pbest(i,:,j)=X(i,:,I); end end V(:,:,j+1)=W(j)*V(:,:,j)+c1*rand*(pbest(:,:,j)-X(:,:,j))+c2*rand*(G(:,:,j)-X(:,:,j)); %V(:,:,j+1)=cf*(W(j)*V(:,:,j)+c1*rand*(pbest(:,:,j)-X(:,:,j))+c2*rand*(G(:,:,j)-X(:,:,j))); %V(:,:,j+1)=cf*(V(:,:,j)+c1*rand*(pbest(:,:,j)-X(:,:,j))+c2*rand*(G(:,:,j)-X(:,:,j))); for ni=1:N for di=1:D if V(ni,di,j+1)>vmax V(ni,di,j+1)=vmax; elseif V(ni,di,j+1)<-vmax V(ni,di,j+1)=-vmax; else V(ni,di,j+1)=V(ni,di,j+1); end end end X(:,:,j+1)=X(:,:,j)+V(:,:,j+1); end disp('Iteration and Current Best Fitness') disp(j) disp(B(1,1,j)) disp('Global Best Fitness and Occurred Iteration') [C,I]=min(B(1,1,:)) % simulation network 网络拟合 for t=1:hiddennum x2iw(t,:)=gbest(1,((t-1)*indim+1):t*indim,j); end for r=1:outdim x2lw(r,:)=gbest(1,(indim*hiddennum+1):(indim*hiddennum+hiddennum),j); end x2b=gbest(1,((indim+1)*hiddennum+1):D,j); x2b1=x2b(1:hiddennum).'; x2b2=x2b(hiddennum+1:hiddennum+outdim).'; net.IW{1,1}=x2iw; net.LW{2,1}=x2lw; net.b{1}=x2b1; net.b{2}=x2b2; %% BP网络训练 %网络进化参数 net.trainParam.epochs=100; net.trainParam.lr=0.1; net.trainParam.goal=0.00001; net.trainParam.show=100; net.trainParam.showWindow=0; %网络训练 [net,per2]=train(net,AllSamInn,AllSamOutn); % nettesterr=mse(sim(net,Ptest)-Ttest); % testsamout = postmnmx(sim(net,Ptest),minAllSamOut,maxAllSamOut); % realtesterr=mse(testsamout-TargetOfTestSam) EvaSamOutn = sim(net,EvaSamInn); EvaSamOut = postmnmx(EvaSamOutn,minAllSamOut,maxAllSamOut);%反归一化 error=EvaSamOut-output_test; ACC=1-sum(abs((EvaSamOut-output_test1)./output_test1))/10 grid hold on plot(log(BestFit),'r'); title(['PSO适应度曲线 ' '最优代数＝' I]); xlabel('进化代数');ylabel('适应度'); legend('平均适应度','最佳适应度'); disp('适应度 变量'); figure(2) grid plot(EvaSamOut,'-+');%预测值 hold on plot(output_test1,'-*');%原始值 hold on legend('预测输出','期望输出') title('PSO-BP网络预测输出','fontsize',12) ylabel('函数输出','fontsize',12) xlabel('样本','fontsize',12)