Next Article in Journal
Differential Cohomology and Gerbes: An Introduction to Higher Differential Geometry
Next Article in Special Issue
An Efficient Subspace Minimization Conjugate Gradient Method for Solving Nonlinear Monotone Equations with Convex Constraints
Previous Article in Journal
Parameter Conditions for Boundedness of Two Integral Operators in Weighted Lebsgue Space and Calculation of Operator Norms
Previous Article in Special Issue
Application of Gradient Optimization Methods in Defining Neural Dynamics
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Hyper-Heuristic Approach for Tuning Parameter Adaptation in Differential Evolution

by
Vladimir Stanovov
1,2,*,
Lev Kazakovtsev
1,2,* and
Eugene Semenkin
1,2
1
Laboratory “Hybrid Methods of Modelling and Optimization in Complex Systems”, Siberian Federal University, Krasnoyarsk 660074, Russia
2
Institute of Informatics and Telecommunication, Reshetnev Siberian State University of Science and Technology, Krasnoyarsk 660037, Russia
*
Authors to whom correspondence should be addressed.
Axioms 2024, 13(1), 59; https://doi.org/10.3390/axioms13010059
Submission received: 16 December 2023 / Revised: 8 January 2024 / Accepted: 16 January 2024 / Published: 19 January 2024
(This article belongs to the Special Issue Numerical Analysis and Optimization)

Abstract

Differential evolution (DE) is one of the most promising black-box numerical optimization methods. However, DE algorithms suffer from the problem of control parameter settings. Various adaptation methods have been proposed, with success history-based adaptation being the most popular. However, hand-crafted designs are known to suffer from human perception bias. In this study, our aim is to design automatically a parameter adaptation method for DE with the use of the hyper-heuristic approach. In particular, we consider the adaptation of scaling factor F, which is the most sensitive parameter of DE algorithms. In order to propose a flexible approach, a Taylor series expansion is used to represent the dependence between the success rate of the algorithm during its run and the scaling factor value. Moreover, two Taylor series are used for the mean of the random distribution for sampling F and its standard deviation. Unlike most studies, the Student’s t distribution is applied, and the number of degrees of freedom is also tuned. As a tuning method, another DE algorithm is used. The experiments performed on a recently proposed L-NTADE algorithm and two benchmark sets, CEC 2017 and CEC 2022, show that there is a relatively simple adaptation technique with the scaling factor changing between 0.4 and 0.6, which enables us to achieve high performance in most scenarios. It is shown that the automatically designed heuristic can be efficiently approximated by two simple equations, without a loss of efficiency.
Keywords: numerical optimization; differential evolution; parameter adaptation; hyper-heuristic numerical optimization; differential evolution; parameter adaptation; hyper-heuristic

Share and Cite

MDPI and ACS Style

Stanovov, V.; Kazakovtsev, L.; Semenkin, E. Hyper-Heuristic Approach for Tuning Parameter Adaptation in Differential Evolution. Axioms 2024, 13, 59. https://doi.org/10.3390/axioms13010059

AMA Style

Stanovov V, Kazakovtsev L, Semenkin E. Hyper-Heuristic Approach for Tuning Parameter Adaptation in Differential Evolution. Axioms. 2024; 13(1):59. https://doi.org/10.3390/axioms13010059

Chicago/Turabian Style

Stanovov, Vladimir, Lev Kazakovtsev, and Eugene Semenkin. 2024. "Hyper-Heuristic Approach for Tuning Parameter Adaptation in Differential Evolution" Axioms 13, no. 1: 59. https://doi.org/10.3390/axioms13010059

APA Style

Stanovov, V., Kazakovtsev, L., & Semenkin, E. (2024). Hyper-Heuristic Approach for Tuning Parameter Adaptation in Differential Evolution. Axioms, 13(1), 59. https://doi.org/10.3390/axioms13010059

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop