A REVIEW OF BOUNDS FOR THE EFFICIENCY FACTOR OF BLOCK DESIGNS

This paper draws together bounds for the efficiency factor of block designs, starting with the papers of Conniffe & Stone (1974) and Williams & Patterson (1977). By extending the methods of Jarrett (1983), firstly to cover supercomplete block designs and then to cover resolvable designs, a set of bounds is obtained which provides the best current bounds for any block design with equal replication and equal block size, including resolvable designs and two-replicate resolvable designs as special cases. The bounds given for non-resolvable designs apply strictly only to designs which are either regular-graph (John & Mitchell, 1977) or whose duals are regular-graph. It is conjectured (John & Williams, 1982) that they are in fact global bounds. Similar qualifications apply to the bounds for resolvable designs.     

An algorithm for constructing optimal resolvable incomplete block designs

This paper describes an efficient algorithm for the construction of optimal or near-optimal resolvable incomplete block designs (IBDs) for any number of treatments v < 100. The performance of this algorithm is evaluated against known lattice designs and the 414 or-designs of Patterson & Williams [36]. For the designs under study, it appears that our algorithm is about equally effective as the simulated annealing algorithm of Venables & Eccleston [42]. An example of the use of our algorithm to construct the row (or column) components of resolvable row-column designs is given.     

UPPER BOUNDS FOR LATINIZED DESIGNS

Upper bounds axe derived for the efficiency factor of a class of resolvable incomplete block designs known as latinized designs. These designs are particularly useful in glasshouse and field trials, and can be readily extended to two-dimensional blocking structures. Existing bounds for resolvable designs axe also reviewed and a comparison is made between the third moment bounds discussed by Jarrett (1989) and the second moment bounds of Tjur (1990).     

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.     

THE USE OF A CLASS OF FOLDOVER DESIGNS AS SEARCH DESIGNS

It is shown that members of a class of two-level nonorthogonal resolution IV designs with n factors are strongly resolvable search designs when k, the maximum number of two-factor interactions thought possible, equals one; weakly resolvable when k = 2 except when the number of factors is 6; and may not be weakly resolvable when k≥ 3.     

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).     

αn–Designs

This paper defines a broad class of resolvable incomplete block designs called α_n–designs, of which the original α–designs are a special case with n = 1. The statistical and mathematical properties of α–designs extend naturally to these n –dimensional designs. They are a flexible class of resolvable designs appropriate for use in factorial experiments, in constructing efficient t –latinized resolvable block designs, and for enhancing the existing class of α–designs for a single treatment factor.     

t-Latinized Designs

A variety trial sometimes requires a resolvable block design in which the replicates are set out next to each other. The long blocks running through the replicates are then of interest. A t -latinized design is one in which groups of these t long blocks are binary. In this paper examples of such designs are given. It is shown that the algorithm described by John & Whitaker (1993) can be used to construct designs with high average efficiency factors. Upper bounds on these efficiency factors are also derived.     

Constructing 1-rotational NRDFs through an optimization approach: new (46,9,8), (51,10,9) and (55,9,8)-NRBDs

In this paper we formulate the problem of constructing 1-rotational near resolvable difference families as a combinatorial optimization problem where a global optimum corresponds to a desired difference family. Then, we develop an algorithm based on scatter search in conjunction with a tabu search to construct many of these difference families. In particular, we construct three new near resolvable difference families which lead to an equal number of new 1-rotational near resolvable block designs with parameters: (46,9,8), (51,10,9) and (55,9,8). Our results indicate that this conjunction outperforms both scatter search and tabu search.     

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.     

CONSTRUCTION OF RESOLVABLE ROW-COLUMN DESIGNS BASED ON CONTRACTIONS

This paper defines the contraction of a resolvable row‐column design for more than two replicates. It shows that the (M,S)‐optimality criterion for the row‐column designs can be expressed simply in terms of the elements of the row and column incidence matrices of the contraction. This allows the development of a very fast algorithm to construct optimal or near‐optimal resolvable row‐column designs. The performance of such an algorithm is compared with an existing algorithm.     

Resolvable block designs for factorial experiments

It is known that n-cyclic designs provide a flexible class of designs suitable for setting out factorial experiments. In this paper we show that many of these designs are resolvable. Further, an extensive class of practically useful designs can be derived from them by deleting replicates. The properties of the designs compare favourably with those obtained by the algorithm of Williams and John (1996) (Appl. Statist. 45, 39–46).     

Remark on Construction of Efficiency-Balanced Designs

In this note, all the efficiency-balanced block designs constructed by utilizing two methods of Dey & Singh (1980) are completely presented within a practical range of parameters.     

Computer-Generated Neighbor Designs

Neighbor designs are useful to remove the neighbor effects. In this article, an algorithm is developed and is coded in Visual C + +to generate the initial block for possible first, second,…, and all order neighbor designs. To get the required design, a block (0, 1, 2,…, k ? 1) is then augmented with (v ? 1) blocks obtained by developing the initial block cyclically mod (v ? 1).     

Partially efficiency-balanced designs-II

efficiency balanced (£R) and partially efficiency balanced (PEB) designs were studied hy Calinski (1971) and Puri and Higam (1971, 1977a). In tais paper we have studied the dual desinas of two classes of PEB designs. It is shown that the dual of any symmetrical PCS design with HN'=N'H is again a PEB design. Also the dual of a PEB(S) with μ₁ = 0 μ₂ = 0and is shown to the again a PEB(S). The relations between PEB designs and linked and partially linked blocks have heen established. As a conseguence, the analysis of linked Mock and partially linkei block designs can he sinrlififid. Sore useful classes of supplencntcd block designs having simple analysis have also been discussed.     

Optimum mixture designs in some constrained experimental regions

In a mixture experiment, the response depends on the mixing proportions of the components present in the mixture. Optimum designs are available for the estimation of parameters of the models proposed in such situations. However, these designs are found to include the vertex points of the simplex Ξ defining the experimental region, which are not mixtures in the true sense. Recently, Mandal et al. (2015 Mandal, N.K., Pal, M., Sinha, B.K., and Das, P. (2015). Optimum mixture designs in a restricted region. Stat. Pap. 56(1):105–119.[Crossref], [Web of Science ®] , [Google Scholar]) derived optimum designs when the experiment is confined to an ellipsoidal region within Ξ, which does not include the vertices of Ξ. In this paper, an attempt has been made to find optimum designs when the experimental region is a simplex or is cuboidal inside Ξ and does not contain the extreme points.     

Some extensions of circular balanced and circular strongly balanced repeated measurements designs

Repeated measurement designs are widely used in medicine, pharmacology, animal sciences, and psychology. In this paper the works of Iqbal and Tahir (2009 Iqbal, I., and M. H. Tahir. 2009. Circular strongly balanced repeated measurements designs. Communications in Statistics—Theory and Methods 38:3686–96.[Taylor &; Francis Online], [Web of Science ®] , [Google Scholar]) and Iqbal, Tahir, and Ghazali (2010 Iqbal, I., M. H. Tahir, and S. S. A. Ghazali. 2010. Circular first- and second-order balanced repeated measurements designs. Communications in Statistics—Theory and Methods 39:228–40.[Taylor &; Francis Online], [Web of Science ®] , [Google Scholar]) are generalized for the construction of circular-balanced and circular strongly balanced repeated measurements designs through the method of cyclic shifts for three periods.     

Construction of Efficient Multi-Level k-Circulant Supersaturated Designs

This article proposes an algorithm to construct efficient balanced multi-level k-circulant supersaturated designs with m factors and n runs. The algorithm generates efficient balanced multi-level k-circulant supersaturated designs very fast. Using the proposed algorithm many balanced multi-level supersaturated designs are constructed and cataloged. A list of many optimal and near optimal, multi-level supersaturated designs is also provided for m ≤ 60 and number of levels (q) ≤10. The algorithm can be used to generate two-level k-circulant supersaturated designs also and some large optimal two-level supersaturated designs are presented. An upper bound to the number of factors in a balanced multi-level supersaturated design such that no two columns are fully aliased is also provided.     

Circular balanced repeated measurement designs in periods of three different sizes

Abstract

Repeated measurement designs are widely used in medicine, pharmacology, animal sciences and psychology. If there is a restriction on the total number of treatments, some experimental units can receive on the total length of time while some experimental units can remain in the trial, then repeated measurements designs with unequal period sizes should be used. In this article, some infinite series are developed to generate the minimal balanced repeated measurement designs in periods of three different sizes p₁, p₂ and p₃, where 2?≤?p₃?<?p₂ ≤ 10 and p₂?<?p₁.     

RANDOMIZED SEARCH STRATEGIES FOR FINDING OPTIMAL OR NEAR OPTIMAL BLOCK AND ROW-COLUMN DESIGNS

We consider a family of effective and efficient strategies for generating experimental designs of several types with high efficiency. These strategies employ randomized search directions and at some stages allow the possibility of taking steps in a direction of decreasing efficiency in an effort to avoid local optima. Hence our strategies have some affinity with the simulated annealing algorithm of combinatorial optimization. The methods work well and compare favourably with other search strategies. We have implemented them for incomplete block designs, optionally resolvable, and for row-column designs.