The research of test-suite reduction technique

Ant colony algorithm is a bionic optimization algorithm, it can solve combinatorial problems effectively. For the problem of the test suite reduction, this algorithm could find the balance point between the speed and the accuracy of solution. Unlike other existing algorithms, this algorithm used test cost criteria, as well as the test coverage criteria. Finally, the paper presented the results, the results is given by the others classical algorithms compared with this algorithms. The results show that this algorithm can significantly reduce the size and the cost of the test-suite, and achieved higher effectiveness of test-suite minimization.