{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T04:47:14Z","timestamp":1773118034906,"version":"3.50.1"},"reference-count":47,"publisher":"MDPI AG","issue":"1","license":[{"start":{"date-parts":[[2024,1,19]],"date-time":"2024-01-19T00:00:00Z","timestamp":1705622400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Ministry of Science and Higher Education of the Russian Federation","award":["075-15-2022-1121"],"award-info":[{"award-number":["075-15-2022-1121"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Axioms"],"abstract":"<jats:p>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\u2019s 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.<\/jats:p>","DOI":"10.3390\/axioms13010059","type":"journal-article","created":{"date-parts":[[2024,1,19]],"date-time":"2024-01-19T03:33:41Z","timestamp":1705635221000},"page":"59","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Hyper-Heuristic Approach for Tuning Parameter Adaptation in Differential Evolution"],"prefix":"10.3390","volume":"13","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1695-5798","authenticated-orcid":false,"given":"Vladimir","family":"Stanovov","sequence":"first","affiliation":[{"name":"Laboratory \u201cHybrid Methods of Modelling and Optimization in Complex Systems\u201d, Siberian Federal University, Krasnoyarsk 660074, Russia"},{"name":"Institute of Informatics and Telecommunication, Reshetnev Siberian State University of Science and Technology, Krasnoyarsk 660037, Russia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0667-4001","authenticated-orcid":false,"given":"Lev","family":"Kazakovtsev","sequence":"additional","affiliation":[{"name":"Laboratory \u201cHybrid Methods of Modelling and Optimization in Complex Systems\u201d, Siberian Federal University, Krasnoyarsk 660074, Russia"},{"name":"Institute of Informatics and Telecommunication, Reshetnev Siberian State University of Science and Technology, Krasnoyarsk 660037, Russia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3776-5707","authenticated-orcid":false,"given":"Eugene","family":"Semenkin","sequence":"additional","affiliation":[{"name":"Laboratory \u201cHybrid Methods of Modelling and Optimization in Complex Systems\u201d, Siberian Federal University, Krasnoyarsk 660074, Russia"},{"name":"Institute of Informatics and Telecommunication, Reshetnev Siberian State University of Science and Technology, Krasnoyarsk 660037, Russia"}]}],"member":"1968","published-online":{"date-parts":[[2024,1,19]]},"reference":[{"key":"ref_1","unstructured":"Eshelman, L.J., and Schaffer, J.D. (1992). Foundations of Genetic Algorithms, Elsevier."},{"key":"ref_2","first-page":"115","article-title":"Simulated Binary Crossover for Continuous Search Space","volume":"9","author":"Deb","year":"1995","journal-title":"Complex Syst."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/s11721-007-0002-0","article-title":"Particle swarm optimization","volume":"1","author":"Poli","year":"1995","journal-title":"Swarm Intell."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1023\/A:1008202821328","article-title":"Differential evolution \u2013 a simple and efficient heuristic for global optimization over continuous spaces","volume":"11","author":"Storn","year":"1997","journal-title":"J. Glob. Optim."},{"key":"ref_5","unstructured":"Feoktistov, V. (2006). Differential Evolution in Search of Solutions, Springer."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1109\/TEVC.2010.2059031","article-title":"Differential evolution: A survey of the state-of-the-art","volume":"15","author":"Das","year":"2011","journal-title":"IEEE Trans. Evol. Comput."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.swevo.2016.01.004","article-title":"Recent advances in differential evolution\u2014An updated survey","volume":"27","author":"Das","year":"2016","journal-title":"Swarm Evol. Comput."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1016\/j.swevo.2018.03.008","article-title":"Algorithmic design issues in adaptive differential evolution schemes: Review and taxonomy","volume":"43","author":"Neri","year":"2018","journal-title":"Swarm Evol. Comput."},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Tanabe, R., and Fukunaga, A. (2013, January 20\u201323). Success-history based parameter adaptation for differential evolution. Proceedings of the IEEE Congress on Evolutionary Computation, Cancun, Mexico.","DOI":"10.1109\/CEC.2013.6557555"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1016\/j.swevo.2018.03.007","article-title":"Step-by-step improvement of JADE and SHADE-based algorithms: Success or failure?","volume":"43","author":"Piotrowski","year":"2018","journal-title":"Swarm Evol. Comput."},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Stanovov, V., and Semenkin, E. (2023). Surrogate-Assisted Automatic Parameter Adaptation Design for Differential Evolution. Mathematics, 11.","DOI":"10.3390\/math11132937"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1023\/A:1008306431147","article-title":"Efficient Global Optimization of Expensive Black-Box Functions","volume":"13","author":"Jones","year":"1998","journal-title":"J. Glob. Optim."},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Stanovov, V., Akhmedova, S., and Semenkin, E. (2022). Dual-Population Adaptive Differential Evolution Algorithm L-NTADE. Mathematics, 10.","DOI":"10.3390\/math10244666"},{"key":"ref_14","unstructured":"Awad, N., Ali, M., Liang, J., Qu, B., and Suganthan, P. (2016). Problem Definitions and Evaluation Criteria for the CEC 2017 Special Session and Competition on Single Objective Bound Constrained Real-Parameter Numerical Optimization, Nanyang Technological University. Technical Report."},{"key":"ref_15","unstructured":"Kumar, A., Price, K., Mohamed, A.K., and Suganthan, P.N. (2021). Problem Definitions and Evaluation Criteria for the CEC 2022 Special Session and Competition on Single Objective Bound Constrained Numerical Optimization, Nanyang Technological University. Technical Report."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"646","DOI":"10.1109\/TEVC.2006.872133","article-title":"Self-adapting control parameters in differential evolution: A comparative study on numerical benchmark problems","volume":"10","author":"Brest","year":"2006","journal-title":"IEEE Trans. Evol. Comput."},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Brest, J., Maucec, M., and Bovskovi\u0107, B. (2019, January 10\u201313). The 100-Digit Challenge: Algorithm jDE100. Proceedings of the 2019 IEEE Congress on Evolutionary Computation (CEC), Wellington, New Zealand.","DOI":"10.1109\/CEC.2019.8789904"},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Brest, J., Maucec, M., and Boskovi\u0107, B. (2020, January 19\u201324). Differential Evolution Algorithm for Single Objective Bound-Constrained Optimization: Algorithm j2020. Proceedings of the 2020 IEEE Congress on Evolutionary Computation (CEC), Glasgow, UK.","DOI":"10.1109\/CEC48606.2020.9185551"},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"945","DOI":"10.1109\/TEVC.2009.2014613","article-title":"JADE: Adaptive Differential Evolution with Optional External Archive","volume":"13","author":"Zhang","year":"2009","journal-title":"IEEE Trans. Evol. Comput."},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Tanabe, R., and Fukunaga, A. (2014, January 6\u201311). Improving the search performance of SHADE using linear population size reduction. Proceedings of the IEEE Congress on Evolutionary Computation, CEC, Beijing, China.","DOI":"10.1109\/CEC.2014.6900380"},{"key":"ref_21","unstructured":"Price, K.V., Awad, N.H., Ali, M.Z., and Suganthan, P.N. (2019). The 2019 100-Digit Challenge on Real-Parameter, Single Objective Optimization: Analysis of Results, Nanyang Technological University. Technical Report."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"100463","DOI":"10.1016\/j.swevo.2018.10.014","article-title":"Selective Pressure Strategy in differential evolution: Exploitation improvement in solving global optimization problems","volume":"50","author":"Stanovov","year":"2019","journal-title":"Swarm Evol. Comput."},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Brest, J., Mau\u010dec, M., and Bo\u0161kovic, B. (2017, January 5\u20138). Single objective real-parameter optimization algorithm jSO. Proceedings of the IEEE Congress on Evolutionary Computation, Donostia, Spain.","DOI":"10.1109\/CEC.2017.7969456"},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Stanovov, V., Akhmedova, S., and Semenkin, E. (2018, January 8\u201313). LSHADE Algorithm with Rank-Based Selective Pressure Strategy for Solving CEC 2017 Benchmark Problems. Proceedings of the 2018 IEEE Congress on Evolutionary Computation (CEC), Rio de Janeiro, Brazil.","DOI":"10.1109\/CEC.2018.8477977"},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"100462","DOI":"10.1016\/j.swevo.2018.10.013","article-title":"Distance based parameter adaptation for Success-History based Differential Evolution","volume":"50","author":"Viktorin","year":"2019","journal-title":"Swarm Evol. Comput."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"108070","DOI":"10.1016\/j.knosys.2021.108070","article-title":"The automatic design of parameter adaptation techniques for differential evolution with genetic programming","volume":"239","author":"Stanovov","year":"2022","journal-title":"Knowl. Based Syst."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"11769","DOI":"10.1007\/s00521-022-07068-w","article-title":"Self-adaptive differential evolution with Gaussian\u2013Cauchy mutation for large-scale CHP economic dispatch problem","volume":"34","author":"Chen","year":"2022","journal-title":"Neural Comput. Appl."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"114938","DOI":"10.1016\/j.eswa.2021.114938","article-title":"An improved memetic algebraic differential evolution for solving the multidimensional two-way number partitioning problem","volume":"178","author":"Santucci","year":"2021","journal-title":"Expert Syst. Appl."},{"key":"ref_29","doi-asserted-by":"crossref","unstructured":"Yang, M., Cai, Z., Li, C., and Guan, J. (2013, January 6\u201310). An improved adaptive differential evolution algorithm with population adaptation. Proceedings of the Annual Conference on Genetic and Evolutionary Computation, Amsterdam, The Netherlands.","DOI":"10.1145\/2463372.2463374"},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"100994","DOI":"10.1016\/j.swevo.2021.100994","article-title":"Adaptive differential evolution with ensembling operators for continuous optimization problems","volume":"69","author":"Yi","year":"2021","journal-title":"Swarm Evol. Comput."},{"key":"ref_31","unstructured":"Burke, E., Hyde, M., Kendall, G., Ochoa, G., \u00d6zcan, E., and Woodward, J. (2019). Handbook of Metaheuristics, Springer International Publishing."},{"key":"ref_32","doi-asserted-by":"crossref","unstructured":"Haraldsson, S.O., and Woodward, J. (2014, January 12\u201316). Automated design of algorithms and genetic improvement: Contrast and commonalities. Proceedings of the Companion Publication of the 2014 Annual Conference on Genetic and Evolutionary Computation, Vancouver, BC, Canada.","DOI":"10.1145\/2598394.2609874"},{"key":"ref_33","doi-asserted-by":"crossref","unstructured":"Mohamed, A., Hadi, A.A., Fattouh, A., and Jambi, K. (2017, January 5\u20138). LSHADE with semi-parameter adaptation hybrid with CMA-ES for solving CEC 2017 benchmark problems. Proceedings of the 2017 IEEE Congress on Evolutionary Computation (CEC), Donostia, Spain.","DOI":"10.1109\/CEC.2017.7969307"},{"key":"ref_34","doi-asserted-by":"crossref","unstructured":"Stanovov, V., and Semenkin, E. (2023, January 15\u201319). Genetic Programming for Automatic Design of Parameter Adaptation in Dual-Population Differential Evolution. Proceedings of the Companion Conference on Genetic and Evolutionary Computation, Lisbon, Portugal.","DOI":"10.1145\/3583133.3596310"},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"101287","DOI":"10.1016\/j.swevo.2023.101287","article-title":"Trial-based dominance for comparing both the speed and accuracy of stochastic optimizers with standard non-parametric tests","volume":"78","author":"Price","year":"2023","journal-title":"Swarm Evol. Comput."},{"key":"ref_36","unstructured":"Price, K., Storn, R., and Lampinen, J. (2005). Differential Evolution: A Practical Approach to Global Optimization, Springer."},{"key":"ref_37","first-page":"293","article-title":"A Parameter Study for Differential Evolution","volume":"10","author":"Gamperle","year":"2002","journal-title":"Adv. Intell. Syst. Fuzzy Syst. Evol. Comput."},{"key":"ref_38","first-page":"62","article-title":"Critical values for the control parameters of differential evolution algorithms","volume":"2","author":"Zaharie","year":"2002","journal-title":"Crit. Values Control Parameters Differ. Evol. Algorithmss"},{"key":"ref_39","unstructured":"Ali, M., and T\u00f6rn, A. (2000). Optimization in Computational Chemistry and Molecular Biology: Local and Global Approaches, Springer."},{"key":"ref_40","doi-asserted-by":"crossref","unstructured":"Kumar, A., Misra, R.K., and Singh, D. (2017, January 5\u20138). Improving the local search capability of Effective Butterfly Optimizer using Covariance Matrix Adapted Retreat Phase. Proceedings of the 2017 IEEE Congress on Evolutionary Computation (CEC), Donostia, Spain.","DOI":"10.1109\/CEC.2017.7969524"},{"key":"ref_41","doi-asserted-by":"crossref","unstructured":"Stanovov, V., Akhmedova, S., and Semenkin, E. (July, January 28). NL-SHADE-RSP Algorithm with Adaptive Archive and Selective Pressure for CEC 2021 Numerical Optimization. Proceedings of the 2021 IEEE Congress on Evolutionary Computation (CEC), Krak\u00f3w, Poland.","DOI":"10.1109\/CEC45853.2021.9504959"},{"key":"ref_42","doi-asserted-by":"crossref","unstructured":"Stanovov, V., Akhmedova, S., and Semenkin, E. (2022, January 18\u201323). NL-SHADE-LBC algorithm with linear parameter adaptation bias change for CEC 2022 Numerical Optimization. Proceedings of the 2022 IEEE Congress on Evolutionary Computation (CEC), Padua, Italy.","DOI":"10.1109\/CEC55065.2022.9870295"},{"key":"ref_43","doi-asserted-by":"crossref","unstructured":"Mohamed, A.W., Hadi, A.A., Agrawal, P., Sallam, K.M., and Mohamed, A.K. (July, January 28). Gaining-Sharing Knowledge Based Algorithm with Adaptive Parameters Hybrid with IMODE Algorithm for Solving CEC 2021 Benchmark Problems. Proceedings of the 2021 IEEE Congress on Evolutionary Computation (CEC), Krak\u00f3w, Poland.","DOI":"10.1109\/CEC45853.2021.9504814"},{"key":"ref_44","unstructured":"Cuong, L.V., Bao, N.N., and Binh, H.T.T. (2021). Technical Report: A Multi-Start Local Search Algorithm with L-SHADE for Single Objective Bound Constrained Optimization, SoICT, Hanoi University of Science and Technology. Technical Report."},{"key":"ref_45","doi-asserted-by":"crossref","unstructured":"Biswas, S., Saha, D., De, S., Cobb, A.D., Das, S., and Jalaian, B. (July, January 28). Improving Differential Evolution through Bayesian Hyperparameter Optimization. Proceedings of the 2021 IEEE Congress on Evolutionary Computation (CEC), Krak\u00f3w, Poland.","DOI":"10.1109\/CEC45853.2021.9504792"},{"key":"ref_46","doi-asserted-by":"crossref","unstructured":"Bujok, P., and Kolenovsky, P. (2022, January 18\u201323). Eigen Crossover in Cooperative Model of Evolutionary Algorithms Applied to CEC 2022 Single Objective Numerical Optimisation. Proceedings of the 2022 IEEE Congress on Evolutionary Computation (CEC), Padua, Italy.","DOI":"10.1109\/CEC55065.2022.9870433"},{"key":"ref_47","doi-asserted-by":"crossref","unstructured":"Biedrzycki, R., Arabas, J., and Warchulski, E. (2022, January 18\u201323). A Version of NL-SHADE-RSP Algorithm with Midpoint for CEC 2022 Single Objective Bound Constrained Problems. Proceedings of the 2022 IEEE Congress on Evolutionary Computation (CEC), Padua, Italy.","DOI":"10.1109\/CEC55065.2022.9870220"}],"container-title":["Axioms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2075-1680\/13\/1\/59\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T13:45:37Z","timestamp":1760103937000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2075-1680\/13\/1\/59"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,1,19]]},"references-count":47,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2024,1]]}},"alternative-id":["axioms13010059"],"URL":"https:\/\/doi.org\/10.3390\/axioms13010059","relation":{},"ISSN":["2075-1680"],"issn-type":[{"value":"2075-1680","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,1,19]]}}}