基于改进离散粒子群算法的测试优化选择  

Optimal Test Selection Based on Improved Discrete PSO Algorithm

作　　者：马羚[1] 李海军[1] 王成刚[2] 张晓瑜[3] 

机构地区：[1]海军航空工程学院兵器科学与技术系,山东烟台264001 [2]海军航空工程学院基础实验部,山东烟台264001 [3]新疆军区指挥自动化工作站,乌鲁木齐830042

出　　处：《计算机测量与控制》2015年第7期2244-2246,2251,共4页Computer Measurement &Control

基　　金：国家部委"十二五"预先研究项目(51319040102)

摘　　要：为了解决复杂系统测试性设计过程中测试选择所产生的组合爆炸问题,提出一种改进离散粒子群算法的智能方法;首先,为保证初始种群的多样性,利用混沌不重复遍历的特性初始化种群的速度和位置;其次,根据启发式规则和罚函数的方法计算粒子适应度,使算法具有良好的搜索性能;最后,通过采用自适应调整策略的惯性权重,使粒子易于跳出局部最优解,找到最优解;通过仿真实例验证了文章方法的有效性,优化结果满足系统各项测试性指标要求,可为复杂系统的测试优化选择提供有效指导。Due to the fact that the combinatorial explosion problem of lest selection in the design for testability for complex system,an intelligent method of test selection based on an improved discrete particle swarm optimization algorithm（IDPSO） is put forward.First,the ergodic of chaos has been used to initialize the velocities and positions of the particles.Then,the fitness value is calculated by heuristic rule and penalty function to improve the search performance.Finally,The inertia weights were adjusted according to adaptively strategy,which can avoid the particles trapped in local optimal.The simulation results meet all system requirements and show that IDPSO algorithm can achieve global optimal solution fast and effectively,which makes it a good solution to the optimal test selection for complex system.

关 键 词：测试性设计 测试选择 离散粒子群算法 混沌 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]