A coordinate-exchange two-phase local search algorithm for the D- and I-optimal designs of split-plot experiments

Many industrial experiments involve one or more restrictions on the randomization. In such cases, the split-plot design structure, in which the experimental runs are performed in groups, is a commonly used cost-efficient approach that reduces the number of independent settings of the hard-to-change factors. Several criteria can be adopted for optimizing split-plot experimental designs: the most frequently used are D-optimality and I-optimality. A multi-objective approach to the optimal design of split-plot experiments, the coordinate-exchange two-phase local search (CE-TPLS), is proposed. The CE-TPLS algorithm is able to approximate the set of experimental designs which concurrently minimize the D-criterion and the I-criterion. It allows for a flexible choice of the number of hard-to-change factors, the number of easy-to-change factors, the number of whole plots and the total sample size. When tested on four case studies from the literature, the proposed algorithm returns meaningful sets of experimental designs, covering the whole spectrum between the two objectives. On most of the analyzed cases, the CE-TPLS algorithm returns better results than those reported in the original papers and outperforms the state-of-the-art algorithm in terms of computational time, while retaining a comparable performance in terms of the quality of the optima for each single objective.

[1]  Thomas Stützle,et al.  Stochastic Local Search Algorithms for Multiobjective Combinatorial Optimization , 2006, Handbook of Approximation Algorithms and Metaheuristics.

[2]  Don X. Sun,et al.  Optimal Blocking Schemes for 2n and 2n—p Designs , 1997 .

[3]  Thomas Stützle,et al.  Stochastic Local Search: Foundations & Applications , 2004 .

[4]  Peter Goos,et al.  Classification of three-level strength-3 arrays , 2012 .

[5]  Byran J. Smucker,et al.  Model-robust designs for split-plot experiments , 2012, Comput. Stat. Data Anal..

[6]  Steven G. Gilmour,et al.  Multistratum Response Surface Designs , 2001, Technometrics.

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

[8]  Peter Goos,et al.  Optimal Design of Experiments: A Case Study Approach , 2011 .

[9]  Don X. Sun,et al.  Optimal blocking schemes for 2 n and 2 n−p designs , 1997 .

[10]  Peter Goos,et al.  Outperforming Completely Randomized Designs , 2004 .

[11]  Peter Goos,et al.  Optimal versus orthogonal and equivalent‐estimation design of blocked and split‐plot experiments , 2006 .

[12]  Peter Goos,et al.  I-Optimal Versus D-Optimal Split-Plot Response Surface Designs , 2012 .

[13]  Richard A. Watson,et al.  Reducing Local Optima in Single-Objective Problems by Multi-objectivization , 2001, EMO.

[14]  Thomas Stützle,et al.  A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems , 2011, Comput. Oper. Res..

[15]  Marco Laumanns,et al.  Performance assessment of multiobjective optimizers: an analysis and review , 2003, IEEE Trans. Evol. Comput..

[16]  Christopher J. Nachtsheim,et al.  Split-Plot Designs: What, Why, and How , 2009 .

[17]  Christine M. Anderson-Cook,et al.  Optimization of Designed Experiments Based on Multiple Criteria Utilizing a Pareto Frontier , 2011, Technometrics.

[18]  Peter Goos,et al.  Practical Inference from Industrial Split-Plot Designs , 2006 .

[19]  P. Goos,et al.  Optimal Split-Plot Designs , 2001 .

[20]  Peter Goos,et al.  D-Optimal Split-Plot Designs With Given Numbers and Sizes of Whole Plots , 2003, Technometrics.

[21]  Jacques Teghem,et al.  Two-phase Pareto local search for the biobjective traveling salesman problem , 2010, J. Heuristics.

[22]  E. Schoen,et al.  A Split-Plot Experiment with Factor-Dependent Whole-Plot Sizes , 2011 .

[23]  Raymond H. Myers,et al.  Response Surface Methods for Bi-Randomization Structures , 1996 .

[24]  Peter Goos,et al.  D-Optimal and D-Efficient Equivalent-Estimation Second-Order Split-Plot Designs , 2010 .

[25]  Peter Goos,et al.  The optimal design of blocked and split-plot experiments , 2002 .

[26]  Peter Goos,et al.  Identifying effects under a split‐plot design structure , 2005 .

[27]  Thomas Stützle,et al.  Improving the anytime behavior of two-phase local search , 2011, Annals of Mathematics and Artificial Intelligence.

[28]  Peter Goos,et al.  The D-Optimal Design of Blocked Experiments with Mixture Components , 2006 .

[29]  Mark Fleischer,et al.  The measure of pareto optima: Applications to multi-objective metaheuristics , 2003 .

[30]  Peter Goos,et al.  A candidate-set-free algorithm for generating D-optimal split-plot designs , 2007, Journal of the Royal Statistical Society. Series C, Applied statistics.