Tabu Search and Perturbation Methods in the Construction of Supersaturated Designs

SYNOPTIC ABSTRACT We adapt the columnwise-pairwise algorithm (CP) of Li and Wu (1997) to the construction of multi- and mixed-level supersaturated designs. One inherent difficulty associated with the use of many heuristic algorithms is premature convergence to a local optima. Meyer and Nachtsheim (1988) discussed the use of simulated annealing method for constructing D-optimal designs. As an extension to their work, this research proposes two modified CP algorithms: tabu-enhanced CP and CP with perturbation. The performance of the two methods is evaluated in the construction of multi-level supersaturated designs. Using these algorithms yields a class of supersaturated designs that is more efficient than existing designs in terms of the optimality criteria. Results are also compared with Fang, Lin, and Ma (2000). The application of the CP algorithms to mixed-level supersaturated designs is examined as well.

[1]  F. Glover.  HEURISTICS FOR INTEGER PROGRAMMING USING SURROGATE CONSTRAINTS , 1977 .

[2]  Dennis K. J. Lin,et al.  Three-level supersaturated designs , 1999 .

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

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

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

[6]  Yizhou Sun,et al.  SUPERSATURATED DESIGN WITH MORE THAN TWO LEVELS , 2001 .

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

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

[9]  Toby J. Mitchell,et al.  An Algorithm for the Construction of “D-Optimal” Experimental Designs , 2000, Technometrics.

[10]  Miguel A. Lejeune.  A “Coordinate-Columnwise” Exchange Algorithm for the Construction of Supersaturated, Saturated, and Non-Saturated Experimental Designs , 2003 .

[11]  Dennis K. J. Lin,et al.  Construction of mixed-level supersaturated design , 2002 .

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

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

[14]  S. Addelman.  Orthogonal Main-Effect Plans for Asymmetrical Factorial Experiments , 1962 .

[15]  Dennis K. J. Lin,et al.  On the construction of multi-level supersaturated designs , 2000 .

[16]  Fred W. Glover,et al.  A user's guide to tabu search , 1993, Ann. Oper. Res..

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

[18]  S. Yamada,et al.  Optimality of mixed-level supersaturated designs , 2002 .

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

[20]  Xuan Lu,et al.  A new method in the construction of two-level supersaturated designs , 2000 .

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