The shuffled differential evolution (SDE) is a recently proposed version of differential evolution (DE). However the SDE employs several efforts to compensate limited amount of search moves in the original DE, but these efforts are performed by the same operator. To vary search moves of the SDE, this research proposes employing a secondary mutation operator beside of first mutation operator. This new mutation operator can generate some different offspring than those generated by the first one. Experiments demonstrate a better performance of the proposed algorithm than the SDE. In a later part of the comparative experiments, performance comparisons of the proposed algorithm with some modern DE and other evolutionary algorithms reported in the literature confirm a better or at least a competitive performance of our proposed algorithm. Also a real-world optimization problem, namely, Spread Spectrum Radar Polly phase Code Design, is solved to show the wide applicability of the DSDE.
A simple low rate turbo-like code design for spread spectrum systems