Whole-Plot Exchange Algorithms for Constructing D-Optimal Multistratum Designs
Whole-Plot Exchange Algorithms for Constructing D-Optimal Multistratum Designs
复制标题
用于构建 D 最优多层设计的整区交换算法
DOI：
--
复制
发表时间：
2011
期刊：
影响因子：
--
通讯作者：
G. Milliken
中科院分区：
文献类型：
--
作者：
C. Vahl;G. Milliken
多层实验包含几个不同大小的实验单元。例如分割小区设计、条带小区设计和随机区组设计。我们提出了一种构建D-最优多层设计的策略，该策略通过一系列全图交换来改进随机生成的设计。这种方法保留了设计结构，简化了对信息的更新，适用于最大试验单元为整个小区或区块的任何多层设计。描述了受Fedorov(1972)和Wynn(1972)点交换策略启发的两种全图交换算法。讨论了这些算法在几个设计问题中的应用。
Multistratum experiments contain several different sizes of experimental units. Examples include split-plot, strip-plot designs, and randomized block designs. We propose a strategy for constructing a D-optimal multistratum design by improving a randomly generated design through a sequence of whole-plot exchanges. This approach preserves the design structure and simplifies updates to the information and is applicable to any multistratum design where the largest-sized experimental unit is either a whole plot or a block. Two whole-plot exchange algorithms inspired by the point-exchange strategies of Fedorov (1972) and Wynn (1972) are described. The application of the algorithms to several design problems is discussed.