函数优化之 基本粒子群算法

完整程序下载http://download.csdn.net/source/2428504

 

#include <iostream>#include <fstream>#include <math.h>#include <time.h>using namespace std;// Search domain: ?5.12 ≤ xi ≤ 5.12, i = 1, 2, . . . , n.// Number of local minima: no local minimum except the global one.// The global minima: x* = (0, …, 0), f(x*) = 0double sphere(double* x,int n){double result=0;for(int i=0;i<n;i++){result+=x[i]*x[i];}return result;}//fitness function pointertypedef double (*HFitFunc)(double*,int );int main(){fstream fout("result.txt",ios::out);//parametersdouble c1=1.496;//learning factor 1double c2=1.496;//learning factor 2double w=0.7298;//inertia weight int iterationMax=500;//number of biggest iterationint D=10;//number of unknown numberint sizeSwarm=40;//size of swarmdouble eps=pow(double(10),double(-6));double** x=new double*[sizeSwarm];//position of individualsdouble** v=new double*[sizeSwarm];//speed of individualsdouble* priority=new double[sizeSwarm];//fitness of individualsdouble** x_p=new double*[sizeSwarm];//best partial individualsdouble* x_g=new double[D];//global best positiondouble priority_g=2<<10;//best globalfor (int i=0;i<sizeSwarm;i++){x[i]=new double[D];v[i]=new double[D];x_p[i]=new double[D];}srand((unsigned )time(NULL));//fitness functionHFitFunc pFitFunct=sphere;//initialize speed and position [0,1]for (int i=0;i<sizeSwarm;i++){priority[i]=2<<10;for (int j=0;j<D;j++){x[i][j]=rand()/RAND_MAX*2-1;v[i][j]=rand()/RAND_MAX*2-1;x_p[i][j]=x[i][j];}}//main loopwhile(iterationMax-->0){//calculate fitnessdouble best_p=2<<10;double* prior=new double[sizeSwarm];int index=0;for (int i=0;i<sizeSwarm;i++){prior[i]=(*pFitFunct)(x[i],D);//update partial priorityif (prior[i]<priority[i]){memcpy(x_p[i],x[i],sizeof(double)*D);priority[i]=prior[i];}if (best_p>prior[i]){best_p=prior[i];index=i;}}//update global bestif (priority_g>prior[index]){memcpy(x_g,x_p[index],sizeof(double)*D);priority_g=prior[index];}//display result of this generationfout<<"global best value:"<<priority_g<<endl<<"partial best value:"<<priority[index]<<endl;//updatefor (int i=0;i<sizeSwarm;i++){for (int j=0;j<D;j++){v[i][j]=w*v[i][j]+c1*rand()/RAND_MAX*(x_p[i][j]-x[i][j])+c2*rand()/RAND_MAX*(x_g[j]-x[i][j]);x[i][j]+=v[i][j];}}//free memorydelete[] prior;}//free memoryfout.close();for (int i=0;i<sizeSwarm;i++){delete[] x[i];delete[] v[i];delete[] x_p[i];}delete[] x;delete[] v;delete[] x_p;delete[] priority;delete[] x_g;return 0;}