Covering array generation (CAG) is the key research problem in combinatorial testing and an NP-complete problem. With increasing complexity of software under test need for higher interaction covering strength t, techniques constructing high-strength arrays are expected. This paper presents a hybrid heuristic memetic algorithm named QSSMA CAG The sub-optimal solution acceptance rate introduced t...