yichuanbianyi.txt

一个遗传变异算法的具体实现

#include<iostream>
#include<vector>
using namespace std;
class sea
{
public:
	int N,number,varnumb;
	float Pc,Pm;
	vector<int> jilu;
	sea(int N1,int number1,int varnumb1,float Pc1,float Pm1);
	void chushi(void);
	void select(vector<float>&fitof);
	void jiaocha(void);
	void bianyi(void);

};
sea::sea(int N1,int number1,int varnumb1,float Pc1,float Pm1)
{
	N=N1;
	number=number1;
	varnumb=varnumb1;
	Pc=Pc1;
	Pm=Pm1;
}
void sea::chushi(void)
{
	int i,j;
	for(i=0;i<N;i++)
	{
		for(j=0;j<number*varnumb;j++)
		{
			jilu.push_back(rand()%2);
		}
	}
}
void sea::select(vector<float>& fitof)
{
	int i,k,j,l,m;
	l=number*varnumb;
	vector<int> fx;
	fx.clear();
	fx.push_back(0);
	for(i=0;i<fitof.size()-1;i++)
		fx.push_back(fitof[i]*100+fx[fx.size()-1]);
    vector<int> jilu2;
	jilu2.clear();
	for(i=0;i<N;i++)
	{
		k=rand()%100;
		for(m=0;m<N;m++)
		{
			if(m==0)
			{
				if(k>=0&&k<fx[m+1])
				{
					for(j=0;j<l;j++)
					{
						jilu2.push_back(jilu[m*l+j]);
					}
				}
			}
			if(m==(N-1))
			{
				if(k>=fx[m])
				{
					for(j=0;j<l;j++)
					{
						jilu2.push_back(jilu[m*l+j]);
					}
				}
			}
			if(m>0&&m<N-1)
			{
				if((k>=fx[m])&&(k<fx[m+1]))
				{
					for(j=0;j<l;j++)
					{
						jilu2.push_back(jilu[m*l+j]);
					}
				}
			}
		}
	}
	jilu.clear();
	for(i=0;i<jilu2.size();i++)
		jilu.push_back(jilu2[i]);
}
void sea::jiaocha(void)
{
	int i,k,t,j,l;
	k=number*varnumb;
	for(i=0;i<N;i=i+2)
	{
		if((rand()%100)<(Pc*100))
		{
			j=rand()%k;
			for(l=j;l<k;l++)
			{
				t=jilu[i*2*k+l];
				jilu[i*2*k+l]=jilu[(i*2+1)*k+l];
                jilu[(i*2+1)*k+l]=t;
			}
		}
	}
}
void sea::bianyi(void)
{
	int i,k,j;
	k=number*varnumb;
	for(i=0;i<N;i++)
	{
		if((rand()%100)<(Pm*100))
		{
			j=rand()%k;
			if(jilu[i*k+j]==1)
				jilu[i*k+j]=0;
			else
				jilu[i*k+j]=1;
		}
	}
}
int exp(int i)
{
	int k;
	int jieguo=1;
	if(i==0)
		return 1;
	for(k=0;k<i;k++)
	{
		jieguo=jieguo*2;
	}
	return jieguo;
}
void main()
{
   srand(100);
   vector<float> fitof;
   vector<int> fi;
   int var[2];
   float fito;
   vector<int> jieguo;
   int jieguosun=0;
   int sun=0,i,j,k,T=0,tt,sunn,kk;
   sea wei(4,3,2,0.45,0.4);
   wei.chushi();
   do
   {
	   fi.clear();
	   for(i=0;i<wei.N;i++)
	   {
		   for(j=0;j<wei.varnumb;j++)
		   {
			   var[j]=0;
			   for(k=0;k<wei.number;k++)
               {
				   tt=i*wei.number*wei.varnumb+j*wei.number+k;
				   var[j]=var[j]+wei.jilu[tt]*exp(wei.number-k-1);
			   }
		   }
		   sun=0;
		   sun=var[0]*var[0]+var[1]*var[1];
		   fi.push_back(sun);
	   }
	   sunn=fi[0];
	   kk=0;
	   sun=0;
	   for(i=0;i<fi.size();i++)
	   {
		   if(fi[i]>sunn)
		   {
			   sunn=fi[i];
			   kk=i;
		   }
		   sun=sun+fi[i];
	   }
	   int ii;
	   ii=wei.number*wei.varnumb;
	   if(sunn>jieguosun)
	   {
	       jieguo.clear();
		   jieguosun=sunn;
           for(i=0;i<ii;i++)
		   {
		      jieguo.push_back(wei.jilu[ii*kk+i]);
		   }
	   }
	   for(i=0;i<fi.size();i++)
	   {
		   sunn=fi[i]*100/sun;
		   fito=sunn/float(100);
		   fitof.push_back(fito);
	   }
	   wei.select(fitof);
	   wei.jiaocha();
	   wei.bianyi();
	   T++;
//	   for(i=0;i<wei.jilu.size();i++)
//		   cout<<wei.jilu[i];
//	   cout<<"\n";
	   fitof.clear();
   }while(T<30);
   for(i=0;i<jieguo.size();i++)
	   cout<<jieguo[i];
   cout<<"\n";
   wei.jilu.clear();
   cout<<jieguosun<<"\n";
}

www.gamedev.net

www.flipcode.comwww.gametutorials.com
Q19902803208