Appling the Roulette Wheel Selection Approach to Address the Issues of Premature Convergence and Stagnation in the Discrete Differential Evolution Algorithm

Abstract

Te discrete diferential evolution (DDE) algorithm is an evolutionary algorithm (EA) that has efectively solved challenging optimization problems. However, like many other EAs, it still faces problems such as premature convergence and stagnation during the iterative process. To address these concerns in the DDE algorithm, this work aims to achieve the following objectives: (i) investigate the causes of premature convergence and stagnation in the DDE algorithm; (ii) propose techniques to prevent premature convergence and stagnation in DDE, including a quantitative measurement of premature convergence based on the level of mismatching between the population solutions and then divide the population into individual groups based on the level of mismatching between the population solutions and the best solution; and applying the roulette wheel selection (RWS) approach to determine whether a higher degree of nonmatching is more suitable for choosing a population of separate groups to be able to produce a new solution with more options to prevent the occurrence of premature convergence; (iii) evaluate the efectiveness of the proposed techniques through employing the DDE algorithm to solve the quadratic assignment problem (QAP) as a standard to evaluate our results and their efect on avoiding premature convergence and stagnation issues, which led to the enhancement of the algorithm’s accuracy. Our comparative study based on the statistical analysis shows that the DDE algorithm that uses the proposed techniques is more efcient than the traditional DDE algorithm and the state-of-the-art methods.