Algorithmic Construction of Efficient Fractional Factorial Designs With Large Run Sizes

Abstract

Fractional factorial (FF) designs are widely used in practice and typically are chosen according to the minimum aberration criterion. A sequential algorithm is developed for constructing efficient FF designs. A construction procedure is proposed that allows a design to be constructed only from its minimum aberration projection in the sequential buildup process. To efficiently identify nonisomorphic designs, designs are categorized according to moment projection pattern. A fast isomorphism checking procedure is developed by matching the factors using their delete-one-factor projections. This algorithm is used to completely enumerate all 128-run designs of resolution 4, all 256-run designs of resolution 4 up to 17 factors, all 512-run designs of resolution 5, all 1024-run designs of resolution 6, and all 2048- and 4,096-run designs of resolution 7. A method is proposed for constructing minimum aberration (MA) designs using only a partial catalog of some good designs. Three approaches to constructing good designs with a large number of factors are suggested. Efficient designs, often with MA, are tabulated up to 40, 80, 160, 45, 47, and 65 factors for 128, 256, 512, 1024, 2048, and 4,096 runs, respectively.

Keywords:  :

• Fractional factorial design
• Isomorphism
• Linear code
• MacWilliams identity
• Minimum aberration
• Resolution