An Algorithm for Constructing Orthogonal and Nearly-Orthogonal Arrays With Mixed Levels and Small Runs

Orthogonal arrays are used widely in manufacturing and high-technology industries for quality and productivity improvement experiments. For reasons of run size economy or flexibility, nearly-orthogonal arrays are also used. The construction of orthogonal or nearly-orthogonal arrays can be quite challenging. Most existing methods are complex and produce limited types of arrays. This article describes a simple and effective algorithm for constructing mixed-level orthogonal and nearly-orthogonal arrays that can construct a variety of small-run designs with good statistical properties efficiently.

[1]  Alan J. Miller,et al.  A review of some exchange algorithms for constructing discrete D-optimal designs , 1992 .

[2]  Kai-Tai Fang,et al.  A new approach in constructing orthogonal and nearly orthogonal arrays , 2000 .

[3]  William Li,et al.  Columnwise-pairwise algorithms with applications to the construction of supersaturated designs , 1997 .

[4]  H. Chipman,et al.  A Bayesian variable-selection approach for analyzing designed experiments with complex aliasing , 1997 .

[5]  Changbao Wu,et al.  Fractional Factorial Designs , 2022 .

[6]  R. H. Myers,et al.  Response Surface Methodology: Process and Product Optimization Using Designed Experiments , 1995 .

[7]  D. E. Goldberg,et al.  Genetic Algorithms in Search , 1989 .

[8]  Yong Zhang,et al.  Uniform Design: Theory and Application , 2000, Technometrics.

[9]  Lih-Yuan Deng,et al.  GENERALIZED RESOLUTION AND MINIMUM ABERRATION CRITERIA FOR PLACKETT-BURMAN AND OTHER NONREGULAR FACTORIAL DESIGNS , 1999 .

[10]  G. Box,et al.  Projective properties of certain orthogonal arrays , 1996 .

[11]  Ching-Shui Cheng,et al.  Some Projection Properties of Orthogonal Arrays , 1995 .

[12]  C. R. Rao,et al.  Factorial Experiments Derivable from Combinatorial Arrangements of Arrays , 1947 .

[13]  J. Kiefer,et al.  Time- and Space-Saving Computer Methods, Related to Mitchell's DETMAX, for Finding D-Optimum Designs , 1980 .

[14]  Changbao Wu,et al.  FACTOR SCREENING AND RESPONSE SURFACE EXPLORATION , 2001 .

[15]  Nam-Ky Nguyen,et al.  Theory & Methods: Cutting Experimental Designs into Blocks , 2001 .

[16]  Ching-Shui Cheng,et al.  Orthogonal Arrays with Variable Numbers of Symbols , 1980 .

[17]  Vladimir D. Tonchev,et al.  Classification of affine resolvable 2-(27, 9, 4) designs , 1996 .

[18]  Dennis K. J. Lin,et al.  Projection properties of Plackett and Burman designs , 1992 .

[19]  Karen A. F. Copeland.  Experiments: Planning, Analysis, and Parameter Design Optimization , 2002 .

[20]  John Stufken,et al.  On finding mixed orthogonal arrays of strength 2 with many 2-level factors , 2000 .

[21]  Changbao Wu,et al.  Analysis of Designed Experiments with Complex Aliasing , 1992 .

[22]  J. C. Wang,et al.  Nearly orthogonal arrays with mixed levels and small runs , 1992 .

[23]  Nam-Ky Nguyen.  A note on the construction of near-orthogonal arrays with mixed levels and economic run size , 1996 .

[24]  Nam-Ky Nguyen.  An algorithmic approach to constructing supersaturated designs , 1996 .

[25]  Lih-Yuan Deng,et al.  Orthogonal Arrays: Theory and Applications , 1999, Technometrics.

[26]  Marina Vannucci,et al.  Gene selection: a Bayesian variable selection approach , 2003, Bioinform..

[27]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[28]  J. A. Eccleston,et al.  On the Theory of Connected Designs I. Characterization , 1972 .

[29]  Lih-Yuan Deng,et al.  Minimum $G_2$-aberration for nonregular fractional factorial designs , 1999 .

[30]  A. S. Hedayat,et al.  On the Theory of Connected Designs: Characterization and Optimality , 1974 .

[31]  R. D. Cook,et al.  A Comparison of Algorithms for Constructing Exact D-Optimal Designs , 1980 .

[32]  Douglas C. Montgomery,et al.  Response Surface Methodology: Process and Product Optimization Using Designed Experiments , 1995 .

[33]  Gerhard W. Dueck,et al.  Threshold accepting: a general purpose optimization algorithm appearing superior to simulated anneal , 1990 .

[34]  Dennis K. J. Lin.  Another Look at First-Order Saturated Designs: The p-efficient Designs , 1993 .

[35]  Alan J. Miller,et al.  A Fedorov Exchange Algorithm for D-optimal Design , 1994 .

[36]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .