This paper proposes an enhanced modified Differential Evolution algorithm (MI-EDDE) to solve global constrained optimization problems that consist of mixed/non-linear integer variables. The MI-EDDE algorithm, which is based on the constraints violation, introduces a new mutation rule that sort all individuals ascendingly due to their constraint violations (cv) value and then the population is divided into three clusters (best, better and worst) with sizes 100p%, (NP-2) * 100p% and 100p% respectively. Where p is the proportion of the partition with respect to the total number of individuals in the population (NP). MI-EDDE selects three random individuals, one of each partition to implement the mutation process. This new mutation scheme shown to enhance the global and local search capabilities and increases the convergence speed. Eighteen test problems with different features are tested to evaluate the performance of MI-EDDE, and a comparison is made with four state-of-the-art evolutionary algorithms. The results show superiority of MI-EDDE to the four algorithms in terms of the quality, efficiency and robustness of the final solutions. Moreover, MI-EDDE shows a superior performance in solving two high dimensional problems and finding better solutions than the known optimal solution.

%Z n/a %8 2019 %@ 978-3-030-02357-7