A mixed-coding scheme of evolutionary algorithms to solve mixed-integer nonlinear programming problems

In this paper, mixed-integer hybrid differential evolution (MIHDE) is developed to deal with the mixed-integer optimization problems. This hybrid algorithm contains the migration operation to avoid candidate individuals clustering together. We introduce the population diversity measure to inspect when the migration operation should be performed so that the user can use a smaller population size to obtain a global solution. A mixed coding representation and a rounding operation are introduced in MIHDE so that the hybrid algorithm is not only used to solve the mixed-integer nonlinear optimization problems, but also used to solve the real and integer nonlinear optimization problems. Some numerical examples are tested to illustrate the performance of the proposed algorithm. Numerical examples show that the proposed algorithm converges to better solutions than the conventional genetic algorithms.