On Φp-optimality of Incomplete Block Designs: An Algorithm

Since statisticians are interested in optimal incomplete block designs, the existence of algorithms to construct them can be notable. This article presents an algorithm to search for Φp-optimal or nearly Φp-optimal incomplete block designs. It is a variant of exchange and interchange procedures of Jones and Eccleston. The algorithm starts by constructing a cyclic design as the initial design. Then it enters a modified exchange and interchange procedures. Since our criterion for optimality is Φp, the algorithm utilizes the eigenvalues of the information matrix of designs. In most of the cases, optimal or nearly optimal designs were found, which shows the good performance of the algorithm. In addition, a new virtual design for has been obtained. So, for situations in which optimal incomplete block designs are required, this algorithm can be used.

[1]  Steven David Prestwich A Local Search Algorithm for Balanced Incomplete Block Designs , 2002, International Workshop on Constraint Solving and Constraint Logic Programming.

[2]  A. Hedayat,et al.  A-Optimal Incomplete Block Designs for Control-Test Treatment Comparisons , 1984 .

[3]  Margaret J. Robertson,et al.  Design and Analysis of Experiments , 2006, Handbook of statistics.

[4]  A. Rosa,et al.  2-( v , k , λ) Designs of Small Order , 2006 .

[5]  John P. Morgan,et al.  Optimal Incomplete Block Designs , 2007 .

[6]  J. Morgan,et al.  ON THE TYPE-1 OPTIMALITY OF NEARLY BALANCED INCOMPLETE BLOCK DESIGNS WITH SMALL CONCURRENCE RANGE , 2000 .

[7]  Getachew Zergaw A SEQUENTIAL METHOD OF CONSTRUCTING OPTIMAL BLOCK DESIGNS , 1989 .

[8]  Klaus Hinkelmann,et al.  Design and Analysis of Experiments: Advanced Experimental Design , 2005 .

[9]  Tue Tjur,et al.  An algorithm for optimization of block designs , 1993 .

[10]  Ching-Shui Cheng,et al.  Nearly balanced incomplete block designs , 1981 .

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

[12]  Nam-Ky Nguyen,et al.  Construction of Optimal Block Designs by Computer , 1994 .

[13]  J. Kiefer Construction and optimality of generalized Youden designs II , 1975 .

[14]  Lefteris Angelis,et al.  An evolutionary algorithm for A-optimal incomplete block designs , 2003 .

[15]  Carme Torras,et al.  Comparison of simulated annealing and mean field annealing as applied to the generation of block designs , 2003, Neural Networks.

[17]  Gholamreza B. Khosrovshahi,et al.  On Optimality of Designs with Three Distinct Eigenvalues , 2012, Electron. J. Comb..

[18]  Byron Jones,et al.  Exchange and Interchange Procedures to Search for Optimal Designs , 1980 .

[19]  J. Jansen,et al.  An Annealing Algorithm for Searching Optimal Block Designs , 1992 .

[20]  Anthony C. Atkinson,et al.  The construction of exact D optimum wxperimental designs with application to blocking response surface designs , 1989 .

[21]  Peter J. Cameron,et al.  Combinatorics of optimal designs , 2008 .

[22]  Byron Jones,et al.  An Algorithm for Deriving Optimal Block Designs , 1976 .

[23]  Carlos Cotta,et al.  Finding Balanced Incomplete Block Designs with Metaheuristics , 2009, EvoCOP.

[24]  Ching-Shui Cheng,et al.  Optimality of Certain Asymmetrical Experimental Designs , 1978 .