摘要
最优测试序列的生成是大型复杂系统可测试性设计中极为重要的一步,可利用遗传退火算法解决组合优化问题的优越性来生成最优测试序列。建立最优测试序列问题的数学模型,利用优先权布尔矩阵式编码方案来对测试序列进行编码,设计交算子和两种变异算子,并引入与或树来说明算法搜索最优序列的全过程,在MatLab上进行仿真实验。实验结果表明,该算法取得较好的效果,具有一定的参考价值。
The generation of optimal test sequence is a very important procedure during the test ability designing for complex systems. The GASA was adopted to solve this problem for its talent in solving the combinatorial optimization problem. First, the mathematical model of the test sequence problem was presented. Second, a new chromosome matrixing method was designed to link the problem to GASA and two new mutation operators are designed. The and/or tree was also used to illustrate the whole finding procedure. Last, the algorithm was simulated on the platform MatLab. The results show that it is a practical and preferable test sequencing algorithm, which is of certain referenced value.
出处
《计算技术与自动化》
2009年第1期104-107,共4页
Computing Technology and Automation
关键词
故障诊断
测试序列
遗传退火算法
与或树
fault diagnosis
test sequence
Genetic- annealing Simulated Algorithm （GASA）
And/Or Tree
作者简介
梁竞敏（1974-），男，广东广州人，讲师，研究方向：计算机应用技术（E—mail：lwsale〈lwsale@126．com）。
