Differential evolution with dynamic stochastic selection for constrained optimization

How much attention should be paid to the promising infeasible solutions during the evolution process is investigated in this paper. Stochastic ranking has been demonstrated as an effective technique for constrained optimization. In stochastic ranking, the comparison probability will affect the position of feasible solution after ranking, and the quality of the final solutions. In this paper, the dynamic stochastic selection (DSS) is put forward within the framework of multimember differential evolution. Firstly, a simple version named DSS-MDE is given, where the comparison probability decreases linearly. The algorithm DSS-MDE has been compared with two state-of-the-art evolution strategies and three competitive differential evolution algorithms for constrained optimization on 13 common benchmark functions. DSS-MDE is also evaluated on four well-studied engineering design examples, and the experimental results are significantly better than current available results. Secondly, other dynamic settings of the comparison probability for DSS-MDE are also designed and tested. From the experimental results, DSS-MDE is effective for constrained optimization. Finally, DSS-MDE with a square root adjusted comparison probability is evaluated on the 22 benchmark functions in CEC’06, and the experimental results on most functions are competitive.