Minimum G Aberration Design Construction and Design Tables for 24 Runs

Abstract

Tang and Deng (1999) proposed minimum G aberration as a generalized version of the usual minimum aberration criterion by Fries and Hunter (1980), thereby providing a criterion that can be applied to both regular and nonregular fractional factorial designs. This paper presents the excursion-at-target algorithm for the construction of minimum G aberration designs. A new criterion is introduced that is computationally simpler to apply than minimum G aberration, and it is put to use in the excursion-at-target algorithm as a time-saving surrogate. Although the algorithm cannot guarantee minimum G aberration, we have shown that excursion-at-target performs well and often results in the best designs. A complete table of minimum or near-minimum G aberration designs of 24 runs accommodating between three and 23 factors is given. Minimum or near-minimum G2 and G4 aberration designs are also tabulated.

• Confounding Frequency Vector
• Exchange Algorithm
• Fractional Factorial Design
• Hadamard Matrix
• Nonregular Design
• Regular Design

Additional information

Notes on contributors

Debra Ingram

Dr. Ingram is Assistant Professor in the Department of Mathematics and Statistics. Her email address is [email protected].

Boxin Tang

Dr. Tang is Associate Professor in the Department of Statistics and Actuarial Science. His email address is [email protected]