main.m

来自「粒子群优化算法(PSO)是一种进化计算技术(evolutionary compu」· M 代码 · 共 32 行

function main

 
 [p ,q ] = feval('fuhe');
 
 h = 3 ;
 
 loss = [];
 
 best11 = [];  best22 = [];  bestfd = [];
 
 for i = 1 :h;
     p1 = p(i,:)';  q1 = q(i,:)'; 
     [best1,best2,fd,loss1,t] =  IPSO1( p1, q1);
     best11 = [best11, best1];
     best22 = [best22, best2];
     bestfd = [bestfd, fd];
     loss   = [loss, loss1];
 end
 
 best22
 
 change1 = 0;
 
 for  i = 1: h-1;
     change = (best22(:,i)~=best22(:,i+1) );
     change1 = change1+ change ;
 end
 
 change1
 
 return