Разработка и исследование метода компараторной идентификации модели многофакторного оценивания
Дипломная работа - Компьютеры, программирование
Другие дипломы по предмету Компьютеры, программирование
j < 8; j++) {[j] = populNorm[i][j];
=30){.out.println("");.out.println(Arrays.toString(a));;">}b1 = 0.02*a[0]+0.37*a[1]-0.01*a[2]-0.18*a[3]+0.11*a[4]-0.18*a[5]-0.8*a[6]+0.09*a[7];b2 = -0.06*a[0]+0.59*a[1]-0.01*a[2]-0.26*a[3]+0.02*a[4]-0.26*a[5]-0.15*a[6]+0.15*a[7];b3 =-0.07*a[0]-0.23*a[1]+0.8*a[3]+0.1*a[4]+0.08*a[5]-0.65*a[6]-0.06*a[7];b4 = -0.3*a[0]-0.03*a[1]+0.26*a[2]-0.2*a[3]-0.4*a[4]-0.28*a[5]+0.45*a[6]+0.06*a[7];b5 = 0.23*a[0]-0.34*a[1]-0.53*a[2]-0.2*a[3]+0.13*a[4]+0.05*a[5]-0.1*a[6]-0.31*a[7];b6 = 0.12*a[0]-0.23*a[1]-0.38*a[2]-0.18*a[3]+0.16*a[4]+0.07*a[5]+0.3*a[6]-0.18*a[7];b7 = 0.12*a[0]-0.23*a[1]-0.38*a[2]-0.18*a[3]+0.16*a[4]+0.07*a[5]+0.3*a[6]-0.18*a[7];b8 = 0.23*a[0]-0.53*a[2]-0.06*a[3]+0.3*a[4]+0.2*a[5]-0.3*a[6]-0.13*a[7];b9 = 0.1*a[0]-0.25*a[1]-0.4*a[2]-0.2*a[3]+0.15*a[4]+0.06*a[5]-0.15*a[6]-0.2*a[7];b10 = 0.12*a[0]-0.12*a[1]-0.15*a[2]-0.02*a[3]-0.02*a[4]-0.02*a[5]-0.4*a[6]-0.13*a[7];b11 = 0.01*a[0]-0.34*a[1]-0.14*a[3]-0.17*a[4]-0.15*a[5]+0.2*a[6]-0.18*a[7];b12 = 0.13*a[0]-0.09*a[1]-0.13*a[2]+0.05*a[6]-0.11*a[7];b13 = -0.15*a[0]+0.07*a[1]-0.02*a[3]-0.02*a[4]-0.02*a[5]+0.04*a[7];b14 = -0.14*a[0]-0.2*a[1]-0.47*a[2]-0.16*a[3]-0.2*a[4]-0.16*a[5]+0.3*a[6]-0.45*a[7];b15 = -0.02*a[0]-0.03*a[1]-0.02*a[3]-0.02*a[4]-0.07*a[5]-0.2*a[6]-0.01*a[7];b16 = -0.12*a[0]-0.18*a[1]-0.47*a[2]-0.14*a[3]-0.17*a[4]-0.09*a[5]+0.5*a[6]-0.43*a[7];b17 = -0.02*a[0]-0.03*a[1]+0.4*a[2]-0.02*a[3]-0.02*a[4]-0.02*a[5]-0.4*a[6]+0.27*a[7];b18 = 0.05*a[0]-0.13*a[1]-0.1*a[2]-0.1*a[3]-0.12*a[4]-0.1*a[5]-0.25*a[6]-0.17*a[7];b19 = -0.02*a[0]-0.03*a[1]-0.02*a[2]+0.06*a[3]-0.02*a[4]-0.02*a[5]-0.03*a[7];b20 = -0.05*a[0]-0.08*a[1]-0.19*a[2]-0.06*a[3]-0.07*a[4]+0.06*a[5]-0.05*a[6]-0.2*a[7];b21 = 0.07*a[0]-0.1*a[1]-0.8*a[2]-0.16*a[3]-0.1*a[4]-0.09*a[5]-0.25*a[6]-0.14*a[7];b22 = 0.11*a[0]-0.05*a[1]+0.09*a[2]-0.04*a[3]-0.05*a[4]-0.17*a[5]-0.2*a[6]+0.04*a[7];b23 = 0.02*a[0]-0.04*a[1]-0.09*a[2]-0.1*a[3]+0.05*a[4]+0.17*a[5]-0.05*a[6]-0.11*a[7];b24 = -0.7*a[0]+0.25*a[1]-0.06*a[2]-0.2*a[3]+0.03*a[4]-0.46*a[5]-0.15*a[6]+0.16*a[7];b25 = -0.22*a[0]-0.04*a[1]+0.03*a[2]+0.04*a[3]-0.38*a[4]-0.22*a[5]+0.1*a[6];b26 = -0.26*a[0]-0.09*a[1]-0.01*a[2]-0.03*a[3]-0.13*a[4]-0.26*a[5]-0.08*a[7];b27 = -0.47*a[0]-0.09*a[1]-0.02*a[2]-0.03*a[3]-0.06*a[4]-0.27*a[5]+0.15*a[6]-0.09*a[7];b28 = -0.48*a[0]+0.28*a[1]-0.09*a[2]-0.24*a[3]+0.4*a[4]-0.24*a[5]-0.25*a[6]+0.16*a[7];b29 = -0.45*a[0]+0.33*a[1]-0.05*a[2]-0.17*a[3]-0.16*a[4]-0.2*a[5]-0.15*a[6]+0.23*a[7];b30 = -0.23*a[0]+0.33*a[1]-0.04*a[2]-0.17*a[3]+0.09*a[4]-0.19*a[5]-0.3*a[6]+0.24*a[7];(b1 = 30) {.out.println("Оптимальное решение найдено");.out.println(Arrays.toString(a));;
}[count] = counter;++;
}
();.out.println(Arrays.toString(c));
}
void krossengover() {= 0;[] s = new int[64];(int i =0; i=27){[counter]=i;++;
}
}arr1;arr2;(int i=0;i<50;i++){z = r.nextInt(63);(int j=0;j<z;j++){(counter!=0){= population[s[counter]][j];= population[s[counter-1]][j];[s[counter-1]][j]=arr1;[s[counter]][j]=arr2;
counter --;}}