Abstract:
Combinatorial Input Interaction Testing (CIIT) can either be sequence based or sequence less for
either uniform or non-uniform values. It is an NP-hard problem, because there is no exact solution
for this problem that has the best result. Thus, there are many solutions for this problem. Some of
the solutions are based on Integrated T-way Test Suite Generator (ITTSG), Generalized T-way
Test Suite Generator (GTWay), Particle Swarm Algorithm, Harmony Search Algorithm, Hill
Climbing Algorithm, Ant Colony Algorithm, High-level Hyper Heuristic (HHH) Algorithm,
Meta-Heuristic Algorithm, Bat-inspired Algorithm etc. Few solutions are based on T-way test case
generation strategy. The methodology of this research is a T-way tuple tree generation algorithm
for T-way test case generation strategies. This algorithm is named “Enhanced T-way Tuple Tree
Generator”. This algorithm accomplishes a faster and more efficient tuple tree generation process;
faster because it takes less time to generate tuple trees and efficient because it eliminates all kind
of redundancy and allows more inputs to work with.
