首页 | 官方网站   微博 | 高级检索  
     

遗传粒子群算法在测试节点优选中的应用
引用本文:刘飞,谷宏强,郭利.遗传粒子群算法在测试节点优选中的应用[J].弹箭与制导学报,2010,30(2).
作者姓名:刘飞  谷宏强  郭利
作者单位:解放军军械工程学院,石家庄,050003
摘    要:测试节点优化是电路板测试诊断设计优化过程中的一个基本问题,属于经典的N-P难题,但目前用于测试点优化的算法存在搜索速度慢、不收敛等问题,因此提出一种基于遗传粒子群优化算法.该方法通过建立电路测试节点的"故障-测试"矩阵,用遗传算法对数学模型进行优化,并采用粒子群算法搜索实现了快速求解.与传统方法相比较,该方法搜索速度快,优化效果明显,已在工程实践中得到应用.

关 键 词:测试节点优选  遗传算法  粒子群算法

Application of Test Node Optimization Based on GAPSO
Abstract:Test node optimization problem is a key problem of diagnostic design for circuit,which belongs to an N-P completeness problem.Algorithms being applied for the test node optimization problem have some problems such as slow searching speed and no convergence,so a kind of method based on genetic particle swarm optimization algorithm was presented to solve the problem.It optimizes the test node's "fault-test" matrix by genetic algorithm and searches quickly by particle swarm optimization.Searching with the method is faster than traditional methods,and the optimal results are also better.The method has been used in engineering practice.
Keywords:test node optimization  genetic algorithm  particle swarm optimization
本文献已被 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号