Constructing strength three covering arrays with augmented annealing

摘要: A covering arrayCA(N;t,k,v) is an Nxk array such that every Nxt sub-array contains all t-tuples from v symbols at least once, where t the strength of array. One application these objects to generate software test suites cover t-sets component interactions. Methods for construction arrays testing have focused on two main areas. The first finding new algebraic and combinatorial constructions produce smaller arrays. second refining computational search algorithms find more quickly. In this paper, we examine some cut-and-paste techniques three combine recursive with search; when simulated annealing base method, augmented annealing. This method leverages efficiency optimality size obtained through while benefiting generality a heuristic search. We present few examples specific provide bounds