Genetic algorithm which repairs infeasible solutions by moving them into the closest part of the feasible solution area in solution space at each iteration

摘要

A computer implemented method for optimising an internal combustion engine operation using a genetic algorithm (GA) having an initial parent population contained within a search space the method comprising the steps of: determining an initial feasible solution space within the search space of the GA; creating a new child population from the initial parent population; determining for a child/individual in the child population if the child is within the feasible solution space, and if the child/individual is outside of the feasible solution space move/bring the child within the feasible solution space.