期刊文献+

基于蚁群算法的测试集优化 被引量:12

A Test Set Optimization Method Based on Ant Algorithm
在线阅读 下载PDF
导出
摘要 电路集成度和复杂度的不断增加使电路故障诊断变得愈加困难 .其中 ,测试集优化问题是电路故障诊断的关键问题之一 .本文以新颖的蚁群算法为基础 ,较好地解决了测试集的优化问题 ,并通过实验证明了该算法的良好性能 . The increase of digital circuit integrity and complexity has made fault diagnosis of circuits more and more difficult.The scale of test set has become very large because of redundancy,which costs lots of time and memory unnecessarily.It is important to acquire optimal test set for test application.Test set optimization,which can eliminate the redundancy,is one of key problems in fault diagnosis of digital circuits.Ant colony optimization,a new kind of random optimization algorithm,has become a better alternative to genetic algorithm in some areas.That algorithm has such advantages as less parameters and simple operations,so it is easier to be adopted.We propose a method based on ant colony optimization that solves test set optimization better than classic algorithm or genetic algorithm.The better performance of the proposed method is demonstrated by experimental results.
出处 《电子学报》 EI CAS CSCD 北大核心 2003年第8期1178-1181,共4页 Acta Electronica Sinica
关键词 蚁群算法 测试集优化 故障诊断 ant algorithm test optimization fault diagnosis
  • 相关文献

参考文献8

  • 1Colomi A, Dori$o M, Maniemo V. Distributed optimization by ant colonies[A]. Proc. 1st European Conf. On artificial life [C].Paris,France:Elsevier, 1991:134 - 142.
  • 2Hideo Fujiwara, Shunichi Toda. The complexity of fault detection problems for combinational logic circuits [ J ].IEEE Trans. Comput. June.1982,C-31(6).
  • 3http://reinforcementlearning, ai-depot, com/lntro. html[ Z/OL].
  • 4Gambardella M, Dorigo M.Ant-Q:A reinforcement learning approach to the traveling salesman problem [ A ]. Proc. of ML-95, Twelfth Intern.Conf. on Machine Learning[ C]. Morgan Kaufmann, 1995.252 - 260.
  • 5Reinelt G. TSPLIB-a traveling salesman problem libtmy[ J]. ORSAJ.On Computing, 1991,3(4) :376 - 385.
  • 6Mark Alien Weiss. Data Stmctmes and Algorithm Analysis (2nd Edition) [M]. Addison Wesley&Pearson, 1993.
  • 7Duviviex D, Preux P, Talbi E G. Parallel genetic algorithms for optimization and application to NP-complete problem solving [ A ]. Int.Workshop on Combinatorics and Computex Science[ C ]. Brest, France,1995.
  • 8El-ghazali Talbi, Olivier Roux, Cyril Fardupt, Denis Robillard. Parallel ant colonies for combinatorial, otaimi,,alon problems[ A] .Job Schednl-ing Strategies for Paralled Processing:IPPS'95 Workshop[C],Springer LNCS 949,1995.

同被引文献80

引证文献12

二级引证文献60

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部