| 求解正交数组问题的拟物拟人算法 |
| |
| 引用本文： | 黄文奇,赵孝武.求解正交数组问题的拟物拟人算法[J].计算机研究与发展,2002,39(2):205-212. |
| |
| 作者姓名： | 黄文奇 赵孝武 |
| |
| 作者单位： | 华中科技大学计算机学院,武汉,430074,中国科学院软件研究所,北京,100080 |
| |
| 基金项目： | 国家“九七三”重点基础研究发展规划项目 (G19980 3 0 60 0 )，国家“八六三”高技术研究发展计划(863 -3 0 6-ZT0 6-0 1-1)，中国科学院软件研究所计算机科学实验室开放课题基金 (SYSKF 970 2 )资助 |
| |
| 摘 要： | 此工作是方开泰工作的继续，正交数组在制造业和高技术产业的试验中有着广泛的应用，目前正交数组构造的研究相当活跃，现有的许多构造方法很复杂且所能构造的类型有限。提出了一个构造正交数组简单而效的方法－拟物拟人算法，应用该算法已经独立地得到了一些历史上尚未发现的L27（3^13)的不同构数组，希望该算法经过进一步发展后将能设计出许多新的正交数组。
|
| 关 键 词： | 正交数组问题 拟物拟人算法 数论 计算机 |
QUASI-PHYSICAL AND QUASI-SOCIOLOGICAL ALGORITHMS FOR SOLVING THE PROBLEMS OF ORTHOGONAL ARRAYS |
| |
| HUANG Wen,Qi and ZHAO Xiao,Wu.QUASI-PHYSICAL AND QUASI-SOCIOLOGICAL ALGORITHMS FOR SOLVING THE PROBLEMS OF ORTHOGONAL ARRAYS[J].Journal of Computer Research and Development,2002,39(2):205-212. |
| |
| Authors: | HUANG Wen Qi and ZHAO Xiao Wu |
| |
| Abstract: | This paper is the continuous work of Kai Tai Fang. Orthogonal arrays are widely used in manufacturing and high tech industries for quality and productivity improvement experiments. The construction of orthogonal arrays is an active research topic at present. Most existing methods are complex and produce only limited types of arrays. Described in this paper is a simple and effective method for constructing orthogonal arrays-the quasi physical and quasi sociological algorithms. Some orthogonal arrays L 27 (3 13 ) are obtained independently, which are not isomorphic to historical existing array. It is hoped that this method can produce many new orthogonal arrays after further development. |
| |
| Keywords: | quasi physical algorithm quasi sociological algorithm computer aided designs orthogonal arrays |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
