On the Effectiveness of Using Elitist Genetic Algorithm in Mutation Testing

Abstract

Manual test case generation is an exhaustive and time-consuming process. However, automated test data generation may reduce the efforts and assist in creating an adequate test suite embracing predefined goals. The quality of a test suite depends on its fault-finding behavior. Mutants have been widely accepted for simulating the artificial faults that behave similarly to realistic ones for test data generation. In prior studies, the use of search-based techniques has been extensively reported to enhance the quality of test suites. Symmetry, however, can have a detrimental impact on the dynamics of a search-based algorithm, whose performance strongly depends on breaking the “symmetry” of search space by the evolving population. This study implements an elitist Genetic Algorithm (GA) with an improved fitness function to expose maximum faults while also minimizing the cost of testing by generating less complex and asymmetric test cases. It uses the selective mutation strategy to create low-cost artificial faults that result in a lesser number of redundant and equivalent mutants. For evolution, reproduction operator selection is repeatedly guided by the traces of test execution and mutant detection that decides whether to diversify or intensify the previous population of test cases. An iterative elimination of redundant test cases further minimizes the size of the test suite. This study uses 14 Java programs of significant sizes to validate the efficacy of the proposed approach in comparison to Initial Random tests and a widely used evolutionary framework in academia, namely Evosuite. Empirically, our approach is found to be more stable with significant improvement in the test case efficiency of the optimized test suite.

iGrow: A Smart Agriculture Solution to Autonomous Greenhouse Control

“…Elitist Genetic Algorithm: Classical heuristic algorithms, such as the genetic algorithm, simulate biological evolution to solve deterministic optimization problems [34]. In this paper, we apply an elitist genetic algorithm (EGA) [36], which can accelerate the convergence of the AGC strategy. Because the state space of each variable is different, we adopt multiple chromosomes to encode these variables.…”

Using Genetic Algorithms to Design an Optimized Keyboard Layout for Brazilian Portuguese

“…After a value is assigned for each keyboard model, following the ergonomic criteria, the population of the next generation is initiated. In this paper, the 20 fittest individuals, representing 10% of the total population [Rani et al 2019], were copied directly to the next generation, without changes. This is necessary, as the main stages of composing a new population, the crossover and mutation, which will be discussed later, both present random elements, which may modify individuals and, perhaps, generate worse individuals than the previous ones.…”

An SHO-based approach to timetable scheduling: a case study

“…Although many publications have documented their positive roles in finding optimal solutions to a wide range of optimization problems, one optimizer algorithm cannot be effective in solving all optimization problems because each optimization problem has different nature (Wolpert & Macready, 1997). For such a motivation, much research attention investigates introducing modified versions of the standard algorithms to improve their overall performance (Ebadifard & Babamir, 2018;Fu et al, 2018;Rani et al, 2019). Besides, other research focuses on proposing novel algorithms by taking into account the interaction of individuals of a swarm and their environment (Korayem et al, 2015;Odili & Mohmad Kahar, 2016).…”