AN ALGORITHM FOR CONSTRUCTING OPTIMAL RESOLVABLE ROW‐COLUMN DESIGNS

Nam‐Ky ‐K Nguyen; E. R. Williams

doi:10.1111/j.1467-842X.1993.tb01344.x

AN ALGORITHM FOR CONSTRUCTING OPTIMAL RESOLVABLE ROW‐COLUMN DESIGNS

Nam‐Ky ‐K Nguyen^*, E. R. Williams

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

29 Citations (Scopus)

Abstract

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.

Original language	English
Pages (from-to)	363-370
Number of pages	8
Journal	Australian Journal of Statistics
Volume	35
Issue number	3
DOIs	https://doi.org/10.1111/j.1467-842X.1993.tb01344.x
Publication status	Published - Sept 1993
Externally published	Yes

Access to Document

10.1111/j.1467-842X.1993.tb01344.x

Cite this

@article{3f6c6fe021e24388bc49bd7785a912c5,

title = "AN ALGORITHM FOR CONSTRUCTING OPTIMAL RESOLVABLE ROW‐COLUMN DESIGNS",

abstract = "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.",

keywords = "(M, S)‐optimality, contiguous replicates, generalized cyclic designs, incomplete block designs, interchange algorithm, iterative improvement, resolvability, row‐column designs, simulated annealing, α‐designs",

author = "Nguyen, {Nam‐Ky ‐K} and Williams, {E. R.}",

year = "1993",

month = sep,

doi = "10.1111/j.1467-842X.1993.tb01344.x",

language = "English",

volume = "35",

pages = "363--370",

journal = "Australian Journal of Statistics",

issn = "0004-9581",

publisher = "Wiley-Blackwell Publishing Ltd",

number = "3",

}

TY - JOUR

T1 - AN ALGORITHM FOR CONSTRUCTING OPTIMAL RESOLVABLE ROW‐COLUMN DESIGNS

AU - Nguyen, Nam‐Ky ‐K

AU - Williams, E. R.

PY - 1993/9

Y1 - 1993/9

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

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

KW - (M, S)‐optimality

KW - contiguous replicates

KW - generalized cyclic designs

KW - incomplete block designs

KW - interchange algorithm

KW - iterative improvement

KW - resolvability

KW - row‐column designs

KW - simulated annealing

KW - α‐designs

UR - http://www.scopus.com/inward/record.url?scp=84990515581&partnerID=8YFLogxK

U2 - 10.1111/j.1467-842X.1993.tb01344.x

DO - 10.1111/j.1467-842X.1993.tb01344.x

M3 - Article

AN - SCOPUS:84990515581

SN - 0004-9581

VL - 35

SP - 363

EP - 370

JO - Australian Journal of Statistics

JF - Australian Journal of Statistics

IS - 3

ER -

AN ALGORITHM FOR CONSTRUCTING OPTIMAL RESOLVABLE ROW‐COLUMN DESIGNS

Abstract

Access to Document

Other files and links

Fingerprint

Cite this