bpso.cpp

用C#编写的基本微粒群算法的源程序代码

//库文件
#include "stdafx.h"
#include"stdio.h"
#include"stdlib.h"
#include"time.h"
#include"math.h"
//随机数定义
#define rdint(i) (rand()%(int)(i))
#define rdft() (double)((double)rdint(16384)/(16383.0))
#define rnd(a,b) (rdint((int)(b)-(int)(a)+1)+(int)(a))
//宏定义
#define POPSIZE 20 //种群数
#define DIMENSION 2//维数
//全局变量定义
double W=1.0;
double C1=1.8;
double C2=1.8;
double VMAX=2.0;
double XMIN=-2.0;
double XMAX=2.0;
double P[DIMENSION];//种群最优微粒的每维数值
double PBEST;       //种群最优适应度

struct indi
{
	double number[DIMENSION];//第i个微粒位置的每维数值
	double best[DIMENSION];  //第i个微粒位置的每维数值的最优值
	double bestfitness;      //第i个微粒的最优适应度
	double fitness;          //第i个微粒的当前适应度
    double speed[DIMENSION]; //第i个微粒速度的每维数值
}individual[POPSIZE];

void initiate(void);
void calculation(int num);
void globalbest(int count);
void localbest(int num);

void initiate()
{
	int i,j;
	for (i=0;i<POPSIZE;i++)
		for (j=0;j<DIMENSION;j++)
			individual[i].number[j]=rdft()*(XMAX-XMIN)+XMIN;
	for (i=0;i<POPSIZE;i++)
		for (j=0;j<DIMENSION;j++)
			individual[i].speed[j]=VMAX*rdft();
	for (i=0;i<POPSIZE;i++)
		for (j=0;j<DIMENSION;j++)
			individual[i].best[j]=individual[i].number[j];
	for (i=0;i<POPSIZE;i++)
		calculation(i);
	for (i=0;i<POPSIZE;i++)
		individual[i].bestfitness=individual[i].fitness;
	globalbest(0);
}

//微粒群历史最优位置修改程序
void localbest(int num)//num表第num个微粒
{
	int i;
	if (individual[num].bestfitness>individual[num].fitness)
		for (i=0;i<DIMENSION;i++)
			individual[num].best[i]=individual[num].number[i];
	individual[num].bestfitness=individual[num].fitness;
}

//种群历史最优位置修改程序
void globalbest(int count)//count表第count代
{
	int i,j;
	double s=0;
	int flag=0;
	if (count==0)
	{
		s=individual[0].fitness;
		flag=0;
		for (i=1;i<POPSIZE;i++)
			if (individual[i].fitness<s)
			{
				s=individual[i].fitness;
				flag=i;
			}
		for (i=0;i<DIMENSION;i++)
			P[i]=individual[flag].number[i];
		PBEST=individual[flag].fitness;
	}
	else
	{
		for (i=0;i<POPSIZE;i++)
			if (individual[i].bestfitness<PBEST)
			{
				for (j=0;j<DIMENSION;j++)
					P[j]=individual[i].best[j];
				PBEST=individual[i].bestfitness;
			}
	}
}

//适应值函数计算程序
void calculation(int num)
{
	int i;
	double s=0.0,h=0.0;
	s=pow(individual[num].number[0]+individual[num].number[1]+1.0,2.0)*(19.0-14.0*individual[num].number[0]
	+3.0*pow(individual[num].number[0],2.0)-14.0*individual[num].number[1]+6.0*individual[num].number[0]
	*individual[num].number[1]+3.0*pow(individual[num].number[1],2.0))+1.0;
	h=30.0+pow(2.0*individual[num].number[0]-3.0*individual[num].number[1],2.0)*(18.0-32.0*individual[num].number[0]
	+12.0*pow(individual[num].number[0],2.0)+48.0*individual[num].number[1]-36.0*individual[num].number[0]*individual[num].number[1]
	+27.0*pow(individual[num].number[1],2.0));
	individual[num].fitness=s*h;
}

//主程序
void main()
{
	int i,j,k,t,total=0;
	double sum=0;
	for (j=0;j<50;j++)     //50次运行
	{
		initiate();
		for (i=0;i<500;i++)//500代运算
		{
			W=1.0-i*0.6/499;
			if ((PBEST-3.0)<0.0001)
			{
				total++;
				sum+=i;
				break;
			}
			else
			{
				for (k=0;k<POPSIZE;k++)
				{
					for (t=0;t<DIMENSION;t++)
					{
						individual[k].speed[t]=W*individual[k].speed[t]+C1*rdft()*(individual[k].best[t]-individual[k].number[t])
							+C2*rdft()*(P[t]-individual[k].number[t]);
						if (individual[k].speed[t]>VMAX)
							individual[k].speed[t]=VMAX;
						individual[k].number[t]=individual[k].number[t]+individual[k].speed[t];
						if (individual[k].number[t]<XMIN)
							individual[k].number[t]=2*XMIN-individual[k].number[t];
						if (individual[k].number[t]>XMAX)
							individual[k].number[t]=2*XMAX-individual[k].number[t];
					}
					calculation(k);
					localbest(k);
				}
				globalbest(1);
			}
		}
		printf("%d,%f\t",i,PBEST);
	}
	printf("Total number is %d\n",total);
	printf("Sum is %f\n",sum);
	printf("Average is %f\n",sum/total);
	int read;
	scanf("%d",&read);
}