Research Article
Appling the Roulette Wheel Selection Approach to Address the Issues of Premature Convergence and Stagnation in the Discrete Differential Evolution Algorithm
Table 12
Comparison between the DDE and EDDE algorithms and the illustration of the stagnation situation for DDE and how EDDE avoids it.
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
πBest: the πBest (bold) is the best solution in the population of the DDE and EDDE algorithms. Cost: the best value of the objective function obtained by DDE and EDDE algorithms by using equation (1). Nonmatching is the number of different facility locations between two solutions and calculated by using Algorithm 1. Group: a set of individuals with the same nonmatching degree as the best individual in EDDE algorithm. Gap: the best value obtained by equation (12). Solution stagnation start: the number of iterations that the solution has not changed (not improved) in the DDE algorithm, where max iteration is 1000. Waiting for solution improvement: the number of trials the EDDE algorithm waits for before considering the solution is stagnated and should be regenerated randomly (italic) the default value is 10 trials. |