ABC algorithm for combinatorial testing problem

Computer software is in high demand everywhere in the world. the high dependence on software makes software requirements more complicated. as a result,software testing tasks get costlier and challenging due to a large number of test cases,coupled with the vast number of the system requirements. this challenge presents the need for reduction of the system redundant test cases. a combinatorial testing approach gives an intended result from the optimization of the system test cases. hence,this study implements a combinatorial testing strategy called artificial bee colony test generation (abc- tg) that helps to get rid of some of the current combinatorial testing strategies. results obtained from the abc- tg were benchmarked with the results obtained from existing strategies in order to determine the efficiency of the abc- tg. finally,abc- tg shows the efficiency and effectiveness in terms of generating optimum test cases size of some of the case studies and a comparable result with the existing combinatorial testing strategies.