Previous studies have shown that differential evolution is an efficient, effective and robust evolutionary optimization method. However, the convergence rate of differential evolution in optimizing a computationally expensive objective function still does not meet all our requirements, and attempting to speed up DE is considered necessary. In this paper, a new local search operation, trigonometric mutation, is proposed and embedded into the differential evolution algorithm. This modification enables the algorithm to get a better trade-off between the convergence rate and the robustness. Thus it can be possible to increase the convergence velocity of the differential evolution algorithm and thereby obtain an acceptable solution with a lower number of objective function evaluations. Such an improvement can be advantageous in many real-world problems where the evaluation of a candidate solution is a computationally expensive operation and consequently finding the global optimum or a good sub-optimal solution with the original differential evolution algorithm is too time-consuming, or even impossible within the time available. In this article, the mechanism of the trigonometric mutation operation is presented and analyzed. The modified differential evolution algorithm is demonstrated in cases of two well-known test functions, and is further examined with two practical training problems of neural networks. The obtained numerical simulation results are providing empirical evidences on the efficiency and effectiveness of the proposed modified differential evolution algorithm.
[1]
Rainer Storn,et al.
Minimizing the real functions of the ICEC'96 contest by differential evolution
,
1996,
Proceedings of IEEE International Conference on Evolutionary Computation.
[2]
R. Storn,et al.
On the usage of differential evolution for function optimization
,
1996,
Proceedings of North American Fuzzy Information Processing.
[3]
Thomas Bäck,et al.
Evolutionary algorithms in theory and practice - evolution strategies, evolutionary programming, genetic algorithms
,
1996
.
[4]
S. T. Buckland,et al.
An Introduction to the Bootstrap
,
1994
.
[5]
Heinz Mühlenbein,et al.
The parallel genetic algorithm as function optimizer
,
1991,
Parallel Comput..
[6]
Thomas Bäck,et al.
Evolutionary Algorithms in Theory and Practice
,
1996
.
[7]
M.H. Hassoun,et al.
Fundamentals of Artificial Neural Networks
,
1996,
Proceedings of the IEEE.
[8]
Rainer Storn,et al.
Differential Evolution – A Simple and Efficient Heuristic for global Optimization over Continuous Spaces
,
1997,
J. Glob. Optim..
[9]
Ivan Zelinka,et al.
Mechanical engineering design optimization by differential evolution
,
1999
.
[10]
Kay Hameyer,et al.
Optimization of radial active magnetic bearings using the finite element technique and the differential evolution algorithm
,
2000
.
[11]
Kenneth Alan De Jong,et al.
An analysis of the behavior of a class of genetic adaptive systems.
,
1975
.