Randomized Search Strategies for Finding Optimal or Near Optimal Block and Row‐column Designs

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