In this paper a new optimization algorithm based on Differential Evolution, non-dominated sorting strategy and neighborhood exploration strategy for guaranteeing convergence and diversity through the generation of neighborhoods of different sizes to potential candidates in the population is presented. The performance of the algorithm proposed is validated by using standard test functions and metrics commonly adopted in the specialized literature. The sensitivity analysis of some relevant parameters of the algorithm is performed and compared with the classical DE algorithm without the strategy of neighborhood exploration and with other state-of-the-art evolutionary algorithms.
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.