ÒÅ´«Ëã·¨Çóº¯Êý¼«Öµ

.

}

// hwj_N_M(cro,temp,num_cross,NUMBER); srand(time(NULL));

abe[0]=rand()%NUMBER; temp[abe[0]]=1; i=1;

while(i!=num_aberrance){

}

for( i=0;i

for( j=0;j

if(i==abe[j]){

k=rand()%num; for( p=0;p

if(p==k){

if(Unit[i][p]==1){ }

Unit[i][p]==0;

abe[i]=rand()%NUMBER; if(temp[abe[i]]==0){ }

temp[abe[i]]=1; i++;

.

}

}

}

}

}

}

else{ }

Unit[i][p]==1;

void hwj_max(int num){

hwj_fitness(num);

// float max=0.0;

int i;

int temp=1;

float sum=0.0; int k;

for(i=0;i

cout<f_max){ }

f_max=Fitness[i]; k=i;

//

.

}

}

for(int j=num-1;j>=0;j--){ }

sum+=Unit[k][j]*temp; temp*=2.0;

f_x=sum*3/(temp-1.0)-1.0;