Genetic Algorithms for the Construction of D-Optimal Designs
Genetic Algorithms for the Construction of D-Optimal Designs
复制标题
用于构建 D 最优设计的遗传算法
DOI：
--
复制
发表时间：
2003
期刊：
影响因子：
--
通讯作者：
G. Runger
中科院分区：
文献类型：
--
作者：
A. Heredia;W. Carlyle;Douglas C. Montgomery;C. Borror;G. Runger
计算机生成的设计适用于标准析因设计、部分析因设计或响应曲面设计难以使用的情况。字母最优设计是最广泛使用的计算机生成设计类型，其中D-最优（或D-有效）设计类非常受欢迎。D-最优设计通常由算法构造，该算法通过使用在感兴趣区域上间隔开的候选点集，从潜在设计中顺序添加和删除点。我们提出了一种技术，使用遗传算法（GA）生成D-有效的设计。这种方法消除了明确考虑一组候选实验点的需要，并且可以在高度受限的区域中使用，同时保持与更传统的设计构造技术相当的性能水平。
Computer-generated designs are useful for situations where standard factorial, fractional factorial or response surface designs cannot be easily employed. Alphabetically-optimal designs are the most widely used type of computer-generated designs, and of these, the D-optimal (or D-efficient) class of designs is extremely popular. D-optimal designs are usually constructed by algorithms that sequentially add and delete points from a potential design by using a candidate set of points spaced over the region of interest. We present a technique to generate D-efficient designs using genetic algorithms (GA). This approach eliminates the need to explicitly consider a candidate set of experimental points and it can be used in highly constrained regions while maintaining a level of performance comparable to more traditional design construction techniques.