Решение задачи повышения надежности резервирования
Дипломная работа - Математика и статистика
Другие дипломы по предмету Математика и статистика
on);i, index: integer;i:= 0 to L-1 doSumTxX (TempPop. Individs[i]) > 1/Tavg do:= random (N);TempPop. Individs[i] [index] = 3 then dec (TempPop. Individs[i] [index], random(2)+1)if TempPop. Individs[i] [index] = 1 then inc (TempPop. Individs[i] [index]);;InitTavg;j: integer;: real;:= 0;j:= 0 to N-1 do:= temp + 1/T[j];:= 1/temp;;InitRecord;i: integer;i:= 1 to RecQuantity do[i].S:= -9999999;[i].P:= -9999999;[i].Quantity:= 0;;;VectorIsHere (var RecEl: TRecElement; var Indivs: TIndivid): boolean;i, j, k: integer;: boolean;:= false; /// вектора нетi:= 0 to RecEl. Quantity -1 do:= false;j:= 0 to N-1 doRecEl. Solutions[i] [j] =1) and (TempPop. Rank[i] < 2) then // в рекорд идут недоминируемые решения
Begin // если вектор доминирует
if ((TempPop. Fitness[i].S >= Rec[k].S) and (TempPop. Fitness[i].P > Rec[k].P))((TempPop. Fitness[i].S > Rec[k].S) and (TempPop. Fitness[i].P >= Rec[k].P)) then[k].S:= TempPop. Fitness[i].S;[k].P:= TempPop. Fitness[i].P;(rec[k].Solutions, 1);[k].Quantity:= 1; // остальные подтереть(rec[k].Solutions[0], N);j:= 0 to N-1 do[k].Solutions[0] [j]:= TempPop. Individs[i] [j];:= 0;
// подтираниеg:= k+1 to RecQuantity do((TempPop. Fitness[i].S >= Rec[g].S) and (TempPop. Fitness[i].P > Rec[g].P))((TempPop. Fitness[g].S > Rec[k].S) and (TempPop. Fitness[i].P >= Rec[g].P)) then[g].S:= -9999999;[g].P:= -9999999;[g].Quantity:= 0;;;
end// если вектор равен. то добавляем еще одно возможное решение
if (TempPop. Fitness[i].S = Rec[k].S) and (TempPop. Fitness[i].P = Rec[k].P) thennot VectorIsHere (Rec[k], TempPop. Individs[i]) then(rec[k].Quantity);(rec[k].Solutions, rec[k].Quantity);(rec[k].Solutions [rec[k].Quantity-1], N);j:= 0 to N-1 do[k].Solutions [rec[k].Quantity-1] [j]:= TempPop. Individs[i] [j];:= 0;;;if (TempPop. Fitness[i].S <= Rec[k].S) and (TempPop. Fitness[i].P <= Rec[k].P) then;;;CopyPopulation (var PopFrom: TPopulation; var PopInto: TPopulation);i, j: integer;i:= 0 to L-1 do. Rank[i]:= PopFrom. Rank[i];. Fitness[i].S:= PopFrom. Fitness[i].S;. Fitness[i].P:= PopFrom. Fitness[i].P;j:= 0 to N-1 do. Individs[i] [j]:= PopFrom. Individs[i] [j];;;;InitRec;(Rec, RecQuantity + 1);;EraseRec;:= nil;;InitInputArrays;(P, N);(T, N);(S, N);(G, N);;EraseInputArrays;:= nil;:= nil;:= nil;:= nil;;
END.