 Interchange Algorithms for Constructing Designs with Complex Blocking StructuresJ. A. John Chapter 19 in Statistical Theory and Applications, 1996, pp 233-246 from Springer Abstract: Abstract The different types of designs, involving one or more blocking factors, which have evolved since the 1930’s are briefly reviewed. Lately, with the widespread availability of powerful computers, a number of interchange algorithms to construct efficient block and row-column designs have been developed. The features of an interchange algorithm are identified, and the alternative strategies used in existing programs examined and compared. An algorithm is then described which incorporates many of these features, and which can be used to construct designs with a variety of treatment and blocking structures, such as resolvability, adjusted orthogonality, latinization, factorial and residual treatment effects. Such an algorithm goes a long way in realising the eventual aim of providing a comprehensive expert system for the design and analysis of experiments with alternative treatment and blocking requirements. Keywords: Adjusted orthogonality; change-over designs; cyclic designs; interchange algorithms; latinized designs; multi-objective functions; optimality; resolvability; row-column designs; simulated annealing (search for similar items in EconPapers) There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it. Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4612-3990-1_19 Ordering information: This item can be ordered from DOI: 10.1007/978-1-4612-3990-1_19 Access Statistics for this chapter More chapters in Springer Books from Springer |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.