Improvement Analysis and Application of Real-Coded Genetic Algorithm for Solving Constrained Optimization Problems

Abstract EN

An improved real-coded genetic algorithm (IRCGA) is proposed to solve constrained optimization problems.

First, a sorting grouping selection method is given with the advantage of easy realization and not needing to calculate the fitness value.

Secondly, a heuristic normal distribution crossover (HNDX) operator is proposed.

It can guarantee the cross-generated offsprings to locate closer to the better one among the two parents and the crossover direction to be very close to the optimal crossover direction or to be consistent with the optimal crossover direction.

In this way, HNDX can ensure that there is a great chance of generating better offsprings.

Thirdly, since the GA in the existing literature has many iterations, the same individuals are likely to appear in the population, thereby making the diversity of the population worse.

In IRCGA, substitution operation is added after the crossover operation so that the population does not have the same individuals, and the diversity of the population is rich, thereby helping avoid premature convergence.

Finally, aiming at the shortcoming of a single mutation operator which cannot simultaneously take into account local search and global search, this paper proposes a combinational mutation method, which makes the mutation operation take into account both local search and global search.

The computational results with nine examples show that the IRCGA has fast convergence speed.

As an example application, the optimization model of the steering mechanism of vehicles is formulated and the IRCGA is used to optimize the parameters of the steering trapezoidal mechanism of three vehicle types, with better results than the other methods used.