Global Optimization for Combination Test Suite by Cluster Searching Algorithm

摘要

The test suite generation is a key task for combinatorial testing of software.In order to generate high-quality testing data,a cluster searching driven global optimization mechanism is proposed.In this approach,a binary encoding mechanism is used to transform the combination test suite generating problem into a gene sequence optimization problem.Meanwhile,a novel global optimization algorithm,cluster searching algorithm (CSA),is developed to solve it.In this paper,the validity and rationality of problem transformation mechanism is verified,and the details of CSA are shown.The simulations illustrate the proposed mechanism is feasible.Moreover,it is a simpler and more efficient test suite generation approach for small-size combinatorial testing problems.

关键词