首页> 外文期刊>Journal of statistical computation and simulation >AN EVOLUTIONARY ALGORITHM FOR A-OPTIMAL INCOMPLETE BLOCK DESIGNS
【24h】

AN EVOLUTIONARY ALGORITHM FOR A-OPTIMAL INCOMPLETE BLOCK DESIGNS

机译:最佳不完全块设计的进化算法

获取原文
获取原文并翻译 | 示例

摘要

Evolutionary algorithms are heuristic stochastic search and optimization techniques with principles taken from natural genetics. They are procedures mimicking the evolution process of an initial population through genetic transformations. This paper is concerned with the problem of finding A-optimal incomplete block designs for multiple treatment comparisons represented by a matrix of contrasts. An evolutionary algorithm for searching optimal, or nearly optimal, incomplete block designs is described in detail. Various examples regarding the application of the algorithm to some well-known problems illustrate the good performance of the algorithm
机译:进化算法是启发式随机搜索和优化技术,其原理取自自然遗传学。它们是通过遗传转化模仿初始种群进化过程的程序。本文关注的问题是为对比矩阵所代表的多次治疗比较找到最佳的不完全块设计。详细描述了用于搜索最佳或接近最佳的不完整块设计的进化算法。有关将算法应用于一些众所周知的问题的各种示例说明了该算法的良好性能

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号