An Improved Differential Evolution for Constrained Optimization Problems
Liechao Zhang, Lin Shang · Proceedings of the 2018 International Conference on Computer Science, Electronics and Communication Engineering (CSECE 2018) · 2018
A fast and robust differential evolution based on orthogonal design (ODE) is proposed, and then it is used to solve constrained optimization problems.The ODE combines the conventional DE (CDE), which is simple and efficient, with the orthogonal design, which can exploit the optimum offspring.The ODE has some features.1) It uses a robust crossover based on orthogonal design and an optimal offspring is generated with the constrained statistical optimal method.2) To decrease the number of the orthogonal design and make the algorithm converge faster, decision variable fraction strategy is applied here.3) It uses simple diversity rules to handle the constraints and maintain the diversity of the population; 4) A multi-parent hybrid adaptive-crossover-mutation operator based on the nonconvex theory is proposed, which can enhance the non-convex search ability.5) The ODE simplifies the scaling factor F of the CDE, which can reduce the parameters of the algorithm and make it easy to use for engineers.We execute the proposed algorithm to solve 13 benchmark functions with linear or/and nonlinear constraints.Through comparison with some state-ofthe-art evolutionary algorithms, the experimental results demonstrate that the performance of the ODE outperforms other evolutionary algorithms in terms of the quality of the final solution and the stability; and its computational cost (measured by the average number of fitness function evaluations) is lower than the cost required by the other techniques compared.