Memetic Algorithms For Combinatorial Optimization Problems In The Calibration Of Modern Combustion Engines

begin for j := 1 to do i := Local-Search(generateSolution()); add individual i to P ; endfor; repeat for i := 1 to ncross select two parents ia; ib 2 P randomly; ic := Local-Search(Recombine(ia; ib)); add individual ic to P ; endfor; for i := 1 to nmut select an individual i 2 P randomly; im := Local-Search(Mutate(i)); add individual im to P ; end repeat; P := select(P ); if P converged then P := mutateAndLS(P ); until terminate=true; end;