DefinePK

Abstract

Combinatorial interaction testing is a practical approach aims to detect defects due to unwanted and faulty interactions. Here, a set of sampled test cases is generated based on t-way covering problem (where t indicates the interaction strength). Often, the generation process is based on a particular t-way strategy ensuring that each t-way interaction is covered at least once. Much useful progress has been achieved as plethora of t-way strategies have been developed in the literature in the last 30 years. Recently, in line with the upcoming field called Search based Software Enginering (SBSE), many newly strategies have been developed adopting specific optimization algorithm (e.g. Genetic Algorithm (GA), Ant Colony (AC), Simulated Annealling (SA), Particle Swarm Optimization, and Harmony Search Algorithm (HS) as their basis in an effort to generate the most optimal solution. Although useful, strategies based on the aforementioned optimization algorithms are not without limitation. Specifically, these algorithms require extensive tuning before optimal solution can be obtained. In many cases, improper tuning of specific parameters undesirably yields sub-optimal solution. Addressing this issue, this paper proposes the adoption of parameter free optimization algorithms as the basis of future t-way strategies. In doing so, this paper reviews two existing parameter free optimization algorithms involving Teaching Learning Based Optimization (TLBO) and Fruitfly Optimization Algorithm (FOA) in an effort to promote their adoption for CIT.