An enhanced dynamic differential annealed algorithm for global optimization and feature selection

Dynamic differential annealed optimization (DDAO) is a recently developed physics-based metaheuristic technique that mimics the classical simulated annealing mechanism. However, DDAO has limited search abilities, especially when solving complicated and complex problems. A unique variation of DDAO, dubbed as mDDAO, is developed in this study, in which opposition-based learning technique and a novel updating equation are combined with DDAO. mDDAO is tested on 10 different functions from CEC2020 and compared with the original DDAO and nine other algorithms. The proposed mDDAO algorithm performance is evaluated using 10 numerical constrained functions from the recently released CEC 2020 benchmark suite, which includes a variety of dimensionally challenging optimisation tasks. Furthermore, to measure its viability, mDDAO is employed to solve feature selection problems using fourteen UCI datasets and a real-life Lymphoma diagnosis problem. Results prove that mDDAO has a superior performance and consistently outperforms counterparts across benchmarks, achieving fitness improvements ranging from 1% to 99.99%. In feature selection, mDDAO excels by reducing feature count by 23% to 79% compared to other methods, enhancing computational efficiency and maintaining classification accuracy. Moreover, in lymphoma diagnosis, mDDAO demonstrates up to 54% higher average fitness, 18% accuracy improvement, and 86% faster computation times. Graphical Abstract