Abstract
The construction of covering arrays, the combinatorial structures underlying combinatorial test suites, is a highly researched topic. In previous works, various metaheuristic algorithms, such as Simulated Annealing and Tabu Search, were used to successfully construct covering arrays with a small number of rows. In this paper, we propose for the first time a quantum-inspired evolutionary algorithm for covering array generation. For this purpose, we introduce a simpler and more natural qubit representation as well as new rotation and mutation operators. We implemented different versions of our algorithm employing the different operators. We evaluate the different implementations against selected (optimal) covering array instances.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
