Randomized post-optimization of covering arrays

Peyman Nayeri, Charles Colbourn, Goran Konjevod

Research output: Contribution to journalArticle

26 Citations (Scopus)

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 - 2013

Fingerprint

Covering Array
Coverage
Optimization
Computational methods
Metaheuristics
Computational Methods
Optimization Techniques
Necessary
Demonstrate

ASJC Scopus subject areas

  • Geometry and Topology
  • Theoretical Computer Science
  • Computational Theory and Mathematics

Cite this

Randomized post-optimization of covering arrays. / Nayeri, Peyman; Colbourn, Charles; Konjevod, Goran.

In: European Journal of Combinatorics, Vol. 34, No. 1, 2013, p. 91-103.

Research output: Contribution to journalArticle

Nayeri, Peyman ; Colbourn, Charles ; Konjevod, Goran. / Randomized post-optimization of covering arrays. In: European Journal of Combinatorics. 2013 ; Vol. 34, No. 1. pp. 91-103.
@article{b3a55d8a8e3540f6bfe9d2fd70119c07,
title = "Randomized post-optimization of covering arrays",
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.",
author = "Peyman Nayeri and Charles Colbourn and Goran Konjevod",
year = "2013",
doi = "10.1016/j.ejc.2012.07.017",
language = "English (US)",
volume = "34",
pages = "91--103",
journal = "European Journal of Combinatorics",
issn = "0195-6698",
publisher = "Academic Press Inc.",
number = "1",

}

TY - JOUR

T1 - Randomized post-optimization of covering arrays

AU - Nayeri, Peyman

AU - Colbourn, Charles

AU - Konjevod, Goran

PY - 2013

Y1 - 2013

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84867003131&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84867003131&partnerID=8YFLogxK

U2 - 10.1016/j.ejc.2012.07.017

DO - 10.1016/j.ejc.2012.07.017

M3 - Article

AN - SCOPUS:84867003131

VL - 34

SP - 91

EP - 103

JO - European Journal of Combinatorics

JF - European Journal of Combinatorics

SN - 0195-6698

IS - 1

ER -