Answers are grounded in this paper and cite their sources.
Optimal complete block designs are given for variety trials with interplot competition. In the paper, competition is modeled using height differences between neighboring varieties. When variety heights are known at the design stage, a simulated annealing algorithm is proposed. The optimal designs tend to reduce height differences between neighboring varieties. When variety heights are not known in advance, neighbor-balanced designs at distances 1 and 2 are shown to have optimality properties.
No takes yet. Share an insight, caveat, or question.
David et al. (2000) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: