一个与powell算法相结合的改进微粒群算法(格式修改完2)

{

powell(p, xi, ndim, np, ftol, iter, fret); for(k=0; k

pb[k] = p[k+1];

}

for(k=0;k

for(t=0;t

individual[k].speed[t]=individual[k].weight[t]*individual[k].speed[t]+

c1*rdft()*(individual[k].best[t]-individual[k].number[t])

+c2*rdft()*(pb[t]-individual[k].number[t]);

if(individual[k].speed[t]>vmax)

individual[k].speed[t]=vmax;

if(individual[k].speed[t]<(-1.0)*vmax)

individual[k].speed[t]=(-1.0)*vmax;

individual[k].number[t]=individual[k].number[t]+individual[k].speed[t];

if(individual[k].number[t]>xmax)

individual[k].number[t]=2.0*xmax-individual[k].number[t];

if(individual[k].number[t]

individual[k].number[t]=2.0*xmin-individual[k].number[t];

}

calculation(k);

41

}

}

}

}

}

localbest(k);

globalbest(i);

for(k=0;k

for(t=0;t

individual[k].weight[t]=wmax-(t/2000)*(wmax-wmin);

printf(\迭代次数为:%d\\t最优值为:%.8f\\n\printf(\最优解为:\\n\for (l=0; l

printf(\

printf(\if ((l+1)%5 == 0)

printf(\

printf(\达优率：%f\\n平均迭代次数：%f\\t\

42

43