An Evaluation of Monte Carlo-Based Hyper-Heuristic for Interaction Testing of Industrial Embedded Software Applications
Not on the map. Why?
Abstract (arXiv)
Hyper-heuristic is a new methodology for the adaptive hybridization of meta-heuristic algorithms to derive a general algorithm for solving optimization problems. This work focuses on the selection type of hyper-heuristic, called the Exponential Monte Carlo with Counter (EMCQ). Current implementations rely on the memory-less selection that can be counterproductive as the selected search operator may not (historically) be the best performing operator for the current search instance. Addressing this issue, we propose to integrate the memory into EMCQ for combinatorial t-wise test suite generation using reinforcement learning based on the Q-learning mechanism, called Q-EMCQ. The limited application of combinatorial test generation on industrial programs can impact the use of such techniques as Q-EMCQ. Thus, there is a need to evaluate this kind of approach against relevant industrial software, with a purpose to show the degree of interaction required to cover the code as well as finding faults. We applied Q-EMCQ on 37 real-world industrial programs written in Function Block Diagram (FBD) language, which is used for developing a train control management system at Bombardier Transportation Sweden AB. The results of this study show that Q-EMCQ is an efficient technique for test case generation. Additionally, unlike the t-wise test suite generation, which deals with the minimization problem, we have also subjected Q-EMCQ to a maximization problem involving the general module clustering to demonstrate the effectiveness of our approach.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). First posted on arXiv 18 Feb 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 3.
3 papers.
- 2021Learning How to Search: Generating Effective Test Cases Through Adaptive Fitness Function Selectioncited by 4
- 2021Hybrid Henry Gas Solubility Optimization Algorithm with Dynamic Cluster-to-Algorithm Mapping for Search-based Software Engineering Problemscited by 0
- 2021Mapping the Structure and Evolution of Software Testing Research Over the Past Three Decadescited by 0
- 2021Mapping the Structure and Evolution of Software Testing Research Over the Past Three Decades9 Sep 2021
- 2021Hybrid Henry Gas Solubility Optimization Algorithm with Dynamic Cluster-to-Algorithm Mapping for Search-based Software Engineering Problems31 May 2021
- 2021Learning How to Search: Generating Effective Test Cases Through Adaptive Fitness Function Selection9 Feb 2021