论文信息 - Columnwise-pairwise algorithms with applications to the construction of supersaturated designs

Columnwise-pairwise algorithms with applications to the construction of supersaturated designs

Motivated by the construction of supersaturated designs, we develop a class of algorithms called columnwise-pairwise exchange algorithms. They differ from the k-exchange algorithms in two respects: (1) They exchange columns instead of rows of the design matrix, and (2) they employ a pairwise adjustment in the search for a “better” column. The proposed algorithms perform very well in the construction of supersaturated designs both for a single criterion and for multiple criteria. They are also applicable to the construction of designs that are not supersaturated.

William Li | C. F. J. Wu | W. Li

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

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

[3] Van Schalkwyk,et al. On the design of mixture experiments , 1971 .

[4] W. J. Studden,et al. Theory Of Optimal Experiments , 1972 .

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

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

[7] M. E. Johnson,et al. Some Guidelines for Constructing Exact D-Optimal Designs on Convex Design Spaces , 1983 .

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

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

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

[11] T. J. Mitchell,et al. Exploratory designs for computational experiments , 1995 .

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