Applications of Mathematics

, Volume 62, Issue 2, pp 197–208 | Cite as

The classic differential evolution algorithm and its convergence properties

  • Roman KnoblochEmail author
  • Jaroslav Mlýnek
  • Radek Srb


Differential evolution algorithms represent an up to date and efficient way of solving complicated optimization tasks. In this article we concentrate on the ability of the differential evolution algorithms to attain the global minimum of the cost function. We demonstrate that although often declared as a global optimizer the classic differential evolution algorithm does not in general guarantee the convergence to the global minimum. To improve this weakness we design a simple modification of the classic differential evolution algorithm. This modification limits the possible premature convergence to local minima and ensures the asymptotic global convergence. We also introduce concepts that are necessary for the subsequent proof of the asymptotic global convergence of the modified algorithm. We test the classic and modified algorithm by numerical experiments and compare the efficiency of finding the global minimum for both algorithms. The tests confirm that the modified algorithm is significantly more efficient with respect to the global convergence than the classic algorithm.


optimization cost function global minimum global convergence local convergence differential evolution algorithm optimal solution set convergence in probability numerical testing 

MSC 2010

60G20 65K05 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Z. Hu, S. Xiong, Q. Su, X. Zhang: Sufficient conditions for global convergence of differential evolution algorithm. J. Appl. Math. 2013 (2013), Article ID 139196, 14 pages.MathSciNetGoogle Scholar
  2. [2]
    J. Mlýnek, R. Knobloch, R. Srb: Mathematical model of the metal mould surface temperature optimization. AIP Conference Proceedings 1690. AIP Publishing, Melville, 2015, Article No. 020018, 8 pages.Google Scholar
  3. [3]
    J. Mlýnek, R. Knobloch, R. Srb: Optimization of a heat radiation intensity and temperature field on the mould surface. ECMS 2016 Proceedings, 30th European Conference on Modelling and Simulation. Regensburg, Germany, 2016, pp. 425–431.Google Scholar
  4. [4]
    K. V. Price: Differential evolution: a fast and simple numerical optimizer. Proceedings of North American Fuzzy Information Processing. Berkeley, 1996, pp. 524–527.CrossRefGoogle Scholar
  5. [5]
    K. V. Price, R. M. Storn, J. A. Lampien: Differential Evolution. A Practical Approach to Global Optimization. Natural Computing Series. Springer, Berlin, 2005.Google Scholar
  6. [6]
    D. Simon: Evolutionary Optimization Algorithms. Biologically Inspired and PopulationBased Approaches to Computer Intelligence. John Wiley & Sons, Hoboken, 2013.zbMATHGoogle Scholar
  7. [7]
    R. M. Storn, K. V. Price: Differential evolution—a simple and efficient heuristics for global optimization over continuous spaces. J. Glob. Optim. 11 (1997), 341–359.MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Institute of Mathematics of the Academy of Sciences of the Czech Republic, Praha, Czech Republic 2017

Authors and Affiliations

  1. 1.Technical University of LiberecLiberecCzech Republic

Personalised recommendations