Randomized post-optimization of covering arrays

Peyman Nayeri, Charles Colbourn, Goran Konjevod

Research output: Contribution to journalArticle

26 Scopus citations

Abstract

The construction of covering arrays with the fewest rows remains a challenging problem. Most computational and recursive constructions result in extensive repetition of coverage. While some is necessary, some is not. By reducing the repeated coverage, metaheuristic search techniques typically outperform simpler computational methods, but they have been applied in a limited set of cases. Time constraints often prevent them from finding an array of competitive size. We examine a different approach. Having used a simple computation or construction to find a covering array, we employ a post-optimization technique that repeatedly adjusts the array in an attempt to reduce its number of rows. At every stage the array retains full coverage. We demonstrate its value on a collection of previously best known arrays by eliminating, in some cases, 10% of their rows. In the well-studied case of strength two with twenty factors having ten values each, post-optimization produces a covering array with only 162 rows, improving on a wide variety of computational and combinatorial methods. We identify certain important features of covering arrays for which post-optimization is successful.

Original languageEnglish (US)
Pages (from-to)91-103
Number of pages13
JournalEuropean Journal of Combinatorics
Volume34
Issue number1
DOIs
StatePublished - Jan 1 2013

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics

Fingerprint Dive into the research topics of 'Randomized post-optimization of covering arrays'. Together they form a unique fingerprint.

  • Cite this