遺傳算法的c語言程序案例-資料下載頁
2025-08-05 17:13本頁面
【正文】 if ( ) {currentBest = bestIndividual。}}}//計算適應度///void calculateFitnessValue() {int i。long temp1, temp2。double x1, x2。for (i = 0。 i PopSize。 i++) {temp1 = dedeChromosome(population[i].chrom, 0, LENGHT1)。temp2 = dedeChromosome(population[i].chrom, LENGHT1, LENGHT2)。x1 = temp1 * temp1。x2 = temp2 * temp2。population[i].fitness = x1+x2。 //x1平方加上x2平方}}//計算目標值//目標函數為f(x) = x1* x1 + x2*x2void calculateObjectValue() {int i。long temp1, temp2。double x1, x2。for (i = 0。 i PopSize。 i++) {temp1 = dedeChromosome(population[i].chrom, 0, LENGHT1)。temp2 = dedeChromosome(population[i].chrom, LENGHT1, LENGHT2)。x1 = temp1 * temp1。x2 = temp2 * temp2。population[i].value = x1 + x2。}}//把二進制轉化為十進制long dedeChromosome(char* string, int point, int length) {int i。long decimal = 0L。char * pointer。for(i = 0, pointer=string+point。 i length。i++,pointer++){decimal += (*pointer 39。039。) (length 1 i)。}return decimal。}//進經同時把最壞個體用目前最好個體替代///void performEvolution() {if ( ) {currentBest = population[bestIndex]。} else {population[worstIndex] = currentBest。}}//打印當前樣本信息///void outputTextReport() {int i。double sum。double average。sum = 。for (i = 0。 i PopSize。 i++) {sum += population[i].value。}average = sum / PopSize。printf(gen=%d, avg=%f, best=%f,generation, average,)。printf( chromosome=)。for( i = 0。 i CHROMLENGTH。 i++){printf(%c, [i])。}printf(/n)。}
環(huán)評公示相關推薦
鄂ICP備17016276號-1