A Hybrid solution for Software testing to minimum test suite generation using hill climbing and bat search algorithms

Nowadays using meta-heuristic algorithms besides T-way testing strategy is increasing to generate minimum test suites automatically. Genetic Algorithm, Ant Colony, Simulated Annealing, and Tabu Search play an important role in this regard. However, most of these algorithms cannot generate test suits efficiently for T>3 due to their complex structure and complicated computations. In this paper, we propose a hybrid approach using hill climbing and bat search algorithms to minimum test suit generation. Our proposed solution uses T-way strategy to test suit generation for different configuration of the system. The proposed solution can generate test suits up to T=10. Since one of the most important criterions for the evaluation of test suits is the array size, hence we compare our results with other existing approaches in terms of this criterion. Our results show that our proposed solution outperforms other approaches.