Algorithms for finding generalized minimum aberration designs
From MaRDI portal
Abstract: Statistical design of experiments is widely used in scientific and industrial investigations. A generalized minimum aberration (GMA) orthogonal array is optimum under the well-established, so-called GMA criterion, and such an array can extract as much information as possible at a fixed cost. Finding GMA arrays is an open (yet fundamental) problem in design of experiments because constructing such arrays becomes intractable as the number of runs and factors increase. We develop two directed enumeration algorithms that call the integer programming with isomorphism pruning algorithm of Margot (2007) for the purpose of finding GMA arrays. Our results include 16 GMA arrays that were not previously in the literature, along with documentation of the efficiencies that made the required calculations possible within a reasonable budget of computer time. We also validate heuristic algorithms against a GMA array catalog, by showing that they quickly output near GMA arrays, and then use the heuristics to find near GMA arrays when enumeration is computationally burdensome.
Recommendations
- An algorithmic approach to finding factorial designs with generalized minimum aberration
- Generalized minimum aberration mixed-level orthogonal arrays: a general approach based on sequential integer quadratically constrained quadratic programming
- An algorithm for generating good mixed level factorial designs
- Generalised minimum aberration construction results for symmetrical orthogonal arrays
- An effective algorithm for generation of factorial designs with generalized minimum aberration
Cites work
- scientific article; zbMATH DE number 1464593 (Why is no real title available?)
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
- An algorithmic approach to finding factorial designs with generalized minimum aberration
- An effective algorithm for generation of factorial designs with generalized minimum aberration
- Classification of orthogonal arrays by integer programming
- Complete enumeration of pure-level and mixed-level orthogonal arrays
- Complete enumeration of two-level orthogonal arrays of strength \(d\) with \(d+2\) constraints
- Exact solutions to linear programming problems
- Exploiting orbits in symmetric ILP
- Generalized minimum aberration for asymmetrical fractional factorial designs.
- Improved WLP and GWP lower bounds based on exact integer programming
- Minimum G₂-aberration for nonregular fractional factorial designs
- Minimum \(G_{2}\)-aberration properties of two-level foldover designs
- Minimum aberration construction results for nonregular two-level fractional factorial designs
- Orthogonal arrays with variable numbers of symbols
- Practical graph isomorphism. II.
- Pruning by isomorphism in branch-and-cut
- Small covering designs by branch-and-cut
- Some nonregular designs from the Nordstrom–Robinson code and their statistical properties
- Symmetric ILP: Coloring and small integers
- Universal Optimality of Fractional Factorial Plans Derivable Through Orthogonal Arrays
Cited in
(10)- Construction of generalized minimum aberration three-level orthogonal arrays with three, four and five columns
- Uniform semi-Latin squares and their pairwise-variance aberrations
- Construction of minimum generalized aberration two-level orthogonal arrays
- An algorithm for generating good mixed level factorial designs
- An algorithmic approach to finding factorial designs with generalized minimum aberration
- Search for minimum aberration designs with uniformity
- Design catalog based on minimum G-aberration
- On Construction of Nonregular Two-Level Factorial Designs With Maximum Generalized Resolutions
- A Simple Method for Obtaining Minimum Aberration Designs
- scientific article; zbMATH DE number 5711161 (Why is no real title available?)
This page was built for publication: Algorithms for finding generalized minimum aberration designs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2349095)
