Integrating the Simplified Interpolation into the Genetic Algorithm for Constrained Optimization Problems

摘要

In this paper, a hybrid genetic algorithm for solving constrained optimization problems is addressed. First, a real-coded genetic algorithm is presented. The simplified quadratic interpolation method is then integrated into the genetic algorithm to improve its local search ability and the accuracy of the minimum function value. Simulation results on 13 benchmark problems show that the proposed hybrid algorithm is able to avoid the premature convergence and find much better solutions with high speed compared to other existing algorithms.