global optimization, boundary constrains, differential evolution, adaptation, self-adaptation, opposition-based optimization, experimental comparison

Seven up-to-date adaptive variants of differential evolution were compared in six benchmark problems of two levels of dimension. The opposition-based optimization was also implemented to each adaptive variant and compared in experiments. It was found that all the algorithms perform very reliably in the problems of $D=30$ while their reliability rate in the problems of $D=100$ differs substantially among the test problems. Only two algorithms (JADE and \textit{b6e6rl} variant of competitive DE) operate with acceptable reliability in all the problems. Considering the computational costs, the rank of the algorithms is different in various problems. When the average performance over all the problems is taken into account, JADE was the most efficient and \textit{b6e6rl} the most reliable. The implementation of opposition-based optimization into adaptive variants of differential evolution do not increase the reliability and its positive influence on the efficiency is rare.