CONSTRUCTION OF RESOLVABLE ROW-COLUMN DESIGNS USING SIMULATED ANNEALING

The paper describes an algorithm which constructs optimal or near optimal resolvable row-column designs. Its performance is assessed against available tables of two-replicate designs.     

AN ALGORITHM FOR CONSTRUCTING OPTIMAL RESOLVABLE ROW-COLUMN DESIGNS

This paper describes an effective algorithm for constructing optimal or near-optimal resolvable row-column designs (RCDs) with up to 100 treatments. The performance of this algorithm is assessed against 20 2-replicate resolvable RCDs of Patterson & Robinson (1989) and 17 resolvable RCDs based on generalized cyclic designs (GCDs) of Ipinyomi & John (1985). The use of the algorithm to construct RCDs with contiguous replicates is discussed.     

AN ALGORITHM FOR THE CONSTRUCTION OF OPTIMAL OR NEAR-OPTIMAL CHANGE-OVER DESIGNS

This paper presents an algorithm for the construction of optimal or near optimal change-over designs for arbitrary numbers of treatments, periods and units. Previous research on optimality has been either theoretical or has resulted in limited tabulations of small optimal designs. The algorithm consists of a number of steps:first find an optimal direct treatment effects design, ignoring residual effects, and then optimise this class of designs with respect to residual effects. Poor designs are avoided by judicious application of the (M, S)-optimality criterion, and modifications of it, to appropriate matrices. The performance of the algorithm is illustrated by examples.     

COMPUTER-AIDED CONSTRUCTION OF SMALL (M, S)-OPTIMAL INCOMPLETE BLOCK DESIGNS

A new exchange algorithm for the construction of (M, S)-optimal incomplete block designs (IBDS) is developed. This exchange algorithm is used to construct 973 (M, S)-optimal IBDs (v, k, b) for v= 4,…,12 (varieties) with arbitrary v, k (block size) and b (number of blocks). The efficiencies of the “best” (M, S)-optimal IBDs constructed by this algorithm are compared with the efficiencies of the corresponding nearly balanced incomplete block designs (NBIBDs) of Cheng(1979), Cheng & Wu (1981) and Mitchell & John(1976).     

ADJUSTED ORTHOGONAL NESTED ROW-COLUMN DESIGNS

Adjusted orthogonality in nested row-column designs is defined and a sufficient condition established for its existence. It is shown that the properties of an adjusted orthogonal nested row-column design are directly related to those of its separate row and column component designs. A method for constructing efficient adjusted orthogonal designs involving a single replicate of every treatment in each of two blocks is given.     

Resolvable Designs With Unequal Block Sizes

Resolvable block designs for v varieties in blocks of size k require v to be a multiple of k so that all blocks are of the same size. If a factorization of v is not possible then a resolvable design with blocks of unequal size is necessary. Patterson & Williams (1976) suggested the use of designs derived from α -designs and conjectured that such designs are likely to be very efficient in the class of resolvable designs with block sizes k and k – 1. This paper examines these derived designs and compares them with designs generated directly using an interchange algorithm. It concludes that the derived designs should be used when v is large, but that for small v they can be relatively inefficient.     

Book Reviews

Books reviewed:
David Griffiths, W. Douglas Stirling, and K. Laurence Weldon, Understanding Data: Principles and Practice of Statistics
Ingwer Borg and Patrick Groenen, Modern Multidimensional Scaling: Theory and Applications
Jeffrey H. Dorfman, Bayesian Economics Through Numerical Methods: A Guide to Econometrics and Decision-making with Prior Information
Marek Musiela and Marek Rutkowski, Martingale Methods in Financial Modelling: Theory and Applications
Aad W. van der Vaart and Jon A. Wellner, Weak Convergence and Empirical Processes     

Partially-latinized designs

An interchange optimization algorithm to construct partially-latinized designs is described. The objective function is a weighted linear combination of up to five functions, each of which corresponds to a blocking factor of the required design. Nested simulated annealing is used to address local optima problems. The average efficiency factors of the generated designs are assessed against theoretical upper bounds.     

Recursive formulae for the average efficiency factor in block and row-column designs

Interchange algorithms are widely used to construct efficient block and row-column designs. We provide simple recursive formulae for updating this average efficiency factor, so that it is no longer computationally expensive to calculate it after each possible interchange.     

(M,S)-optimality in selecting factorial designs

Use of the (M,S) criterion to select and classify factorial designs is proposed and studied. The criterion is easy to deal with computationally and it is independent of the choice of treatment contrasts. It can be applied to two-level designs as well as multi-level symmetrical and asymmetrical designs. An important connection between the (M,S) and minimum aberration criteria is derived for regular fractional factorial designs. Relations between the (M,S) criterion and generalized minimum aberration criteria on nonregular designs are also discussed. The (M,S) criterion is then applied to study the projective properties of some nonregular designs.