Automatic selection of the most appropriate algorithms for complex optimization problems has emerged as a cutting-edge trend in artificial intelligence. This approach circumvents the interpretability challenges posed ...
详细信息
ISBN:
(纸本)9798350349184;9798350349191
Automatic selection of the most appropriate algorithms for complex optimization problems has emerged as a cutting-edge trend in artificial intelligence. This approach circumvents the interpretability challenges posed through trial and error. A hyperheuristic and reinforcement learning-guided meta-heuristic algorithm recommendation (HHRL-MAR) is proposed to facilitate the adaptive selection of a diverse array of meta-heuristic algorithms tailored to the unique characteristics of various problems in this paper. To this end, four meta-heuristics with distinct advantages are integrated to form the action space within the reinforcement learning, serving as the low-level heuristic for hyperheuristic. The incorporated reward mechanism based on the real-time state of the population enhances both the flexibility and accuracy of the algorithm. Three selection strategies in light of simulated annealing and epsilon - greedy are designed to avoid premature convergence associated with a singular selection approach. The experimental results show the efficacy of HHRL-MAR for large-scale complex continuous optimization in terms of accuracy, stability, and convergence speed.
Test case prioritization (TCP), which aims to find the optimal test case execution sequences for specific testing objects, has been widely used in regression testing. A wide variety of search methodologies and algorit...
详细信息
Test case prioritization (TCP), which aims to find the optimal test case execution sequences for specific testing objects, has been widely used in regression testing. A wide variety of search methodologies and algorithms have been proposed to optimize test case execution sequences, namely, search-based TCP. However, different algorithms perform differently and have different implementation costs and specific situations where an algorithm usually performs with high effectiveness and efficiency. When facing a new testing scenario, it is actually difficult to decide which algorithm is suitable. In this paper, to address the algorithm selection problem for different test scenarios, a more generally applicable algorithm based on a hyperheuristic strategy is proposed for search-based TCP. This includes a range of multiobjective algorithms with a variety of crossover strategies and a learning agent strategy to evaluate and select the appropriate algorithm execution sequence dynamically for different scenarios. The concrete hyperheuristic framework for multiobjective TCP is presented with an algorithm's repository in the low level and the learning agent strategy in the higher level. Experiments show that the proposed learning agent strategy can accurately evaluate algorithms in multiobjective problems and select the appropriate algorithm in each iteration.
暂无评论