A comparative analysis of ant colony optimization for its applications into software testing

Ant Colony Optimization are metaheuristic algorithms that uses the search based algorithms as their base. It applies the natural phenomenon of finding the best possible path by the Ants that is covering the minimum distance from the food source to the ant colony, which will be followed by the rest of the ants, resulting into the optimized path. This phenomenon can be applied to provide optimized solutions to solve some complex computational problems. In this paper, we have carried out a review for the applications of the Ant colony Optimization algorithms in context to various level of the Software Testing, thus proving their worth in providing solutions to the various aspects of the Software Testing.