Differential Evolution with Fitness Diversity Self-adaptation

Author(s):  
Ville Tirronen ◽  
Ferrante Neri
2018 ◽  
Vol 8 (1) ◽  
pp. 395-402
Author(s):  
Mika Hanhila ◽  
Timo Mantere ◽  
Jarmo T. Alander

Abstract We will describe an FPGA implementation of PID-controller that uses differential evolution to optimize the coefficients of the PID controller, which has been implemented in VHDL. The original differential evolution algorithm was improved by ranking based mutation operation and self-adaptation of mutation and crossover parameters. Ranking-based mutation operation improves the quality of solution, convergence rate and success of optimization. Due to the self-adaptive control parameters, the user does not have to estimate the mutation and crossover rates. Optimization have been performed by calculating for each generation fitness value by means of trial parameters. The final optimal parameters are selected based on the minimum fitness.


Author(s):  
Janez Brest

Many practical engineering applications can be formulated as a global optimization problem, in which objective function has many local minima, and derivatives of the objective function are unavailable. Differential Evolution (DE) is a floating-point encoding evolutionary algorithm for global optimization over continuous spaces (Storn & Price, 1997) (Liu & Lampinen, 2005) (Price, Storn & Lampinen, 2005) (Feoktistov, 2006). Nowadays it is used as a powerful global optimization method within a wide range of research areas. Recent researches indicate that self-adaptive DE algorithms are considerably better than the original DE algorithm. The necessity of changing control parameters during the optimization process is also confirmed based on the experiments in (Brest, Greiner, Boškovic, Mernik, Žumer, 2006a). DE with self-adaptive control parameters has already been presented in (Brest et al., 2006a). This chapter presents self-adaptive approaches that were recently proposed for control parameters in DE algorithm.


2014 ◽  
Vol 2014 ◽  
pp. 1-11 ◽  
Author(s):  
Zhongbo Hu ◽  
Shengwu Xiong ◽  
Zhixiang Fang ◽  
Qinghua Su

Many improved differential Evolution (DE) algorithms have emerged as a very competitive class of evolutionary computation more than a decade ago. However, few improved DE algorithms guarantee global convergence in theory. This paper developed a convergent DE algorithm in theory, which employs a self-adaptation scheme for the parameters and two operators, that is, uniform mutation and hidden adaptation selection (haS) operators. The parameter self-adaptation and uniform mutation operator enhance the diversity of populations and guarantee ergodicity. The haS can automatically remove some inferior individuals in the process of the enhancing population diversity. The haS controls the proposed algorithm to break the loop of current generation with a small probability. The breaking probability is a hidden adaptation and proportional to the changes of the number of inferior individuals. The proposed algorithm is tested on ten engineering optimization problems taken from IEEE CEC2011.


Sign in / Sign up

Export Citation Format

Share Document