You are required to read and agree to the below before accessing a full-text version of an article in the IDE article repository.

The full-text document you are about to access is subject to national and international copyright laws. In most cases (but not necessarily all) the consequence is that personal use is allowed given that the copyright owner is duly acknowledged and respected. All other use (typically) require an explicit permission (often in writing) by the copyright owner.

For the reports in this repository we specifically note that

  • the use of articles under IEEE copyright is governed by the IEEE copyright policy (available at
  • the use of articles under ACM copyright is governed by the ACM copyright policy (available at
  • technical reports and other articles issued by M‰lardalen University is free for personal use. For other use, the explicit consent of the authors is required
  • in other cases, please contact the copyright owner for detailed information

By accepting I agree to acknowledge and respect the rights of the copyright owner of the document I am about to access.

If you are in doubt, feel free to contact

Enhancing Differential Evolution Algorithm for Solving continuous Optimization Problems

Publication Type:

Licentiate Thesis


Differential Evolution (DE) has become one of the most important metaheuristics during the recent years, obtaining attractive results in solving many engineering optimization problems. However, the performance of DE is not always strong when seeking optimal solutions. It has two major problems in real world applications. First, it can easily get stuck in a local optimum or fail to generate better solutions before the population has converged. Secondly, its performance is significantly influenced by the control parameters, which are problem dependent and which vary in different regions of space under exploration. It usually entails a time consuming trial-and-error procedure to set suitable parameters for DE in a specific problem, particularly for those practioners with limited knowledge and experience of using this technique. This thesis aims to develop new DE algorithms to address the two aforementioned problems. To mitigate the first problem, we studied the hybridization of DE with local search techniques to enhance the efficiency of search. The main idea is to apply a local search mechanism to the best individual in each generation of DE to exploit the most promising regions during the evolutionary processs so as to speed up the convergence or increase the chance to scape from local optima. Four local search strategies have been integrated and tested in the global DE framework, leading to variants of the memetic DE algorithms with different properties concerning diversification and intensification. For tackling the second problem, we propose a greedy adaptation method for dynamic adjustment of the control parameters in DE. It is implemented by conducting greedy search repeatedly during the run of DE to reach better parameter assignments in the neighborhood of a current candidate. The candidates are assessed by considering both, the success rate and also fitness improvement of trial solutions against the target ones. The incorporation of this greedy parameter adaptation method into standard DE has led to a new adaptive DE algorithm, referred to as Greedy Adaptive Differential Evolution (GADE). The methods proposed in this thesis have been tested in different benchmark problems and compared with the state of the art algorithms, obtaining competitive results. Furthermore, the proposed GADE algorithm has been applied in an industrial scenario achieving more accurate results than those obtained by a standard DE algorithm.


@misc{Leon Ortiz4622,
author = {Miguel Leon Ortiz},
title = {Enhancing Differential Evolution Algorithm for Solving continuous Optimization Problems},
month = {December},
year = {2016},
url = {}