Supersaturated experimental designs. New approaches to building and using it

Abstract A new procedure for the building and selection of supersaturated design matrices is presented. The procedure is useful in generating screening experimental designs in the range 8–22 runs. An evolutionary algorithm is used to select between all possible candidate columns, which in turn, are a function of the selected run number, those producing the optimal matrix. Optimality, as defined by three sequentially applied common criteria (Es 2 , n0 , m0 ), is used as fitness functions in the evolution algorithm. The problem in the construction of an optimal design matrix as a particular subset of a much larger universal set of potential solutions needs specially problem-adapted genetic operators. Several have been tested and applied. To make the procedure practical, a toolkit has been developed which allows, in a reasonable computation time, to build and select well characterised experimental supersaturated designs for a given run and factor numbers.

[1]  F. E. Satterthwaite.  Random Balance Experimentation , 1959 .

[2]  H. Chipman,et al.  Some risks in the construction and analysis of supersaturated designs , 1999 .

[3]  Alan J. Miller,et al.  Subset Selection in Regression , 1991 .

[4]  K. H. Booth,et al.  Some Systematic Supersaturated Designs , 1962 .

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

[6]  Dennis K. J. Lin.  Generating Systematic Supersaturated Designs , 1995 .

[7]  Nicholas J. Radcliffe,et al.  Genetic Set Recombination , 1992, FOGA.

[8]  Patrick D. Surry,et al.  Fitness Variance of Formae and Performance Prediction , 1994, FOGA.

[9]  J. S. Hunter,et al.  Statistics for experimenters : an introduction to design, data analysis, and model building , 1979 .

[10]  Felicity A. W. George,et al.  A Study in Set Recombination , 1993, ICGA.

[11]  Gary S. Wasserman,et al.  Genetic subsets regression , 1996 .

[12]  Nostrand Reinhold,et al.  the utility of using the genetic algorithm approach on the problem of Davis, L. (1991), Handbook of Genetic Algorithms. Van Nostrand Reinhold, New York. , 1991 .

[13]  Nicholas J. Radcliffe,et al.  Forma Analysis and Random Respectful Recombination , 1991, ICGA.

[14]  Boxin Tang,et al.  A method for constructing supersaturated designs and its Es2 optimality , 1997 .

[15]  Changbao Wu,et al.  Construction of supersaturated designs through partially aliased interactions , 1993 .

[16]  Dennis K. J. Lin,et al.  FORWARD SELECTION ERROR CONTROL IN THE ANALYSIS OF SUPERSATURATED DESIGNS , 1998 .

[17]  R. Daniel Meyer,et al.  An Analysis for Unreplicated Fractional Factorials , 1986 .

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

[19]  G. Syswerda,et al.  Schedule Optimization Using Genetic Algorithms , 1991 .

[20]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[21]  Dennis K. J. Lin,et al.  A new class of supersaturated designs , 1993 .