currentbest; } }
void selectoperator() //比例选择算法 { int i,index; double p,sum=0.0; double cfitness[POPSIZE]; struct individual newpopulation[POPSIZE]; for(i=0;i
cfitness[index]) { index++; } newpopulation[i]=population[index]; } for(i=0;i for (i=0;i for (i=0;i for (i=0;i