[en] Large scale optimization ; Micro differential evolution ; Directional local search
[en] Over the years, many optimization algorithms have been developed to solve large-scale optimization problems accurately and efficiently. In this regard, Memetic Algorithms offer robust and efficient framework that hybridizes the Evolutionary Algorithms with a local heuristic search. In this work, we propose micro Differential Evolution with a Directional Local Search (µDSDE) algorithm using a small population size to solve large scale continuous optimization problems. In this technique, the best individual retains its position, the second best individual undergoes mutation and crossover processes of DE, and the rest are reinitialized on the search space. Exploration of the search is carried out with the dispersal of the worst individuals whereas exploitation is performed through DE operators and Directional Local Search (DLS). We conducted extensive empirical studies using two test suites on Large Scale Global Optimization benchmark with up to 5000 dimensions. The results show that µDSDE considerably outperforms existing solutions in terms of the convergence rate and solution quality.
[University of Luxembourg > Faculty of Science, Technology and Medicine (FSTM) > Department of Computer Science (DCS)]
