Self-Configuring Genetic Programming Algorithms with Success History-Based Adaptation

In this work, a novel method for self-tuning genetic programming (GP) algorithms is pre-sented, based on the ideas of the Success History based Parameter Adaptation (SHA) method, originally developed for the Differential Evolution (DE) algorithm. The main idea of the method is to perform a dy-namic analysis of the history of successful solutions to adapt the algorithm's parameters during the search process. To implement this concept, the operation scheme of classical GP was modified to mimic the DE scheme, allowing the integration of the success history mechanism into GP. The resulting algorithm, de-noted as SHAGP (Success-History based Adaptive Genetic Programming), demonstrates new capabilities for parameter adaptation, such as the adjustment of crossover and mutation probabilities. The work also includes a detailed review of existing self-tuning methods for GP algorithms, which allowed for the identi-fication of their key advantages and limitations and the application of this knowledge in the development of SHAGP. Additionally, new crossover operators are proposed that enable dynamic adjustment of the crossover probability, account for the selective pressure at the current stage, and implement a multi-parent approach. This modification allows for more flexible control over the process of genotype recombination, thereby enhancing the algorithm's adaptability to the problem at hand. To adjust the probabilities of applying various operators (selection, crossover, mutation), self-configuring evolutionary algorithm methods are employed, in particular, the Self-Configuring Evolutionary Algorithm and the Population-Level Dynamic Probabilities Evolutionary Algorithm. Within the framework of this work, two variants of the algorithm were implemented – SelfCSHAGP and PDPSHAGP. The efficiency of the proposed algorithms was tested on problem sets from the Feynman Symbolic Regression Database. Each algorithm was run multiple times on each problem to obtain a reliable statistical sample, and the results were compared using the Mann–Whitney statistical test. The experimental data showed that the proposed algorithms achieve a higher reliability metric compared to existing GP self-tuning methods, with the PDPSHAGP method demonstrating the best efficiency in more than 90 % of the cases. Such a universal self-tuning mechanism can find applications in a wide range of fields, such as automated machine learning, big data processing, engineering design, and medicine, as well as in space applications – for example, in the design of navigation systems for spacecraft and the development of control systems for aerial vehicles. In these areas, the high reliability of algorithms and their ability to find optimal solutions in complex multidimensional spaces are critically important.