Improved Ant Algorithms for Software Testing Cases Generation

Abstract EN

Existing ant colony optimization (ACO) for software testing cases generation is a very popular domain in software testing engineering.

However, the traditional ACO has flaws, as early search pheromone is relatively scarce, search efficiency is low, search model is too simple, positive feedback mechanism is easy to porduce the phenomenon of stagnation and precocity.

This paper introduces improved ACO for software testing cases generation: improved local pheromone update strategy for ant colony optimization, improved pheromone volatilization coefficient for ant colony optimization (IPVACO), and improved the global path pheromone update strategy for ant colony optimization (IGPACO).

At last, we put forward a comprehensive improved ant colony optimization (ACIACO), which is based on all the above three methods.

The proposed technique will be compared with random algorithm (RND) and genetic algorithm (GA) in terms of both efficiency and coverage.

The results indicate that the improved method can effectively improve the search efficiency, restrain precocity, promote case coverage, and reduce the number of iterations.