An algorithm is presented for the construction of efficient neighbour designs for use in field variety trials. The method is based on a two-stage procedure whereby a desirable α;-array is obtained first, and then indexed to produce a neighbour array. Three schemes for allocating weights to plots within a block are compared.
No takes yet. Share an insight, caveat, or question.
Wild et al. (1987) studied this question.