An Algorithm Coded with R to Generate GN2 -designs in Circular Blocks

Abstract

Minimal neighbor balanced designs are economical, therefore, these are preferred by the experimenters to minimize the bias due to neighbor effects. Minimal circular balanced neighbor designs cannot be constructed for almost every case of v even, where v is number of the treatments to be compared. For v even, the circular GN2-designs in which each treatment appears exactly once as neighbors with all other treatments except the one with which it appears twice, are considered the better alternate to the minimal balanced neighbor designs. In this article, an algorithm is developed to generate the circular GN2-designs for v even which can be converted directly into minimal circular balanced and strongly balanced neighbor designs. This algorithm is also coded with R.