期刊文献+

混合拓扑结构的粒子群算法及其在测试数据生成中的应用研究 被引量:8

MPSO and Its Application in Test Data Automatic Generation
下载PDF
导出
摘要 粒子群算法(PSO)的拓扑结构是影响算法性能的关键因素,为了从根源上避免粒子群算法易陷入局部极值及早熟收敛等问题,提出一种混合拓扑结构的粒子群优化算法(MPSO)并将其应用于软件结构测试数据的自动生成中。通过不同邻域拓扑结构对算法性能影响的分析,采用一种全局寻优和局部寻优相结合的混合粒子群优化算法。通过观察粒子群的多样性反馈信息,对每一代种群粒子以进化时选择全局拓扑结构模型(GPSO)或局部拓扑结构模型(LPSO)的方法进行。实验结果表明,MPSO使得种群的多样性得到保证,避免了粒子群陷入局部极值,提高了算法的收敛速度。 To date,meta-heuristic search algorithms have been applied to automate test data generation.The topology of particle swarm optimization(PSO)is one of the key factors that affect algorithm performance.In order to overcome the phenomena of falling into local optimal and premature convergence of the standard particle swarm algorithm(PSO),a mixture neighborhood structure(MPSO)was proposed to generate software structure test data automatically.Based on the analysis of the different neighborhood topology structure effect on the performance of particle optimization,this paper presented a new particle swarm optimization with mix topological structure.MPSO is based on the combination of global optimization and local optimization.In each generation,by observing the feedback information of diversity of the population,the particle speed update method is selected by global topology model or local topology model.The experimental results show that MPSO increases the swarm diversity,avoids falling into local optimization,and improves the convergence speed of the proposed algorithm.
作者 焦重阳 周清雷 张文宁 JIAO Chong-yang;ZHOU Qing-lei;ZHANG Wen-ning(School of Information Engineering,Zhengzhou University,Zhengzhou 450001,China;The PLA Information Engineering University,Zhengzhou 450001,China;Zhongyuan University of Technology,Zhengzhou 450001,China)
出处 《计算机科学》 CSCD 北大核心 2017年第12期249-254,共6页 Computer Science
基金 国家自然科学基金项目(61250007) 河南省科技厅基础与前沿技术研究项目(152300410055)资助
关键词 粒子群算法 测试数据自动生成 拓扑结构 全局寻优 局部寻优 多样性 Particle swarm algorithm Automatic test data generation Topology structure Global optimization Local optimization Diversity
  • 相关文献

参考文献6

二级参考文献73

  • 1赫然,王永吉,王青,周津慧,胡陈勇.一种改进的自适应逃逸微粒群算法及实验分析[J].软件学报,2005,16(12):2036-2044. 被引量:134
  • 2孟红记,郑鹏,梅国晖,谢植.基于混沌序列的粒子群优化算法[J].控制与决策,2006,21(3):263-266. 被引量:76
  • 3OTSU N. A threshold selection method from gray-level histograms[ J ]. IEEE Trans on Systems, Man and Cybernetics, 1976, 9( 1 ) :62- 66.
  • 4KITTLER J, ILLINGWORTH J. Minimum error thresholding[ J ]. Pattern Recognition, 1986, 19( 1 ) : 41-47.
  • 5ABUTALEB A S. Automatic thresholding of grey-level pictures using two-dimensional entropy [ J ]. Computer Vision Graphics, and Image Processing, 1983, 47( 1 ) : 22-32.
  • 6SOON H K. Threshold selection based on cluster analysis [ J ]. Pattern Recognition Letters, 2004, 25(9) :1045-1050.
  • 7HUANG Qing-ming, GAO Wen, CAI Wen-jian. Thresholding technique with adaptive window selection for uneven lighting image [ J ]. Pattern Recognition Letters, 2005, 26(6) :801-808.
  • 8HEMACHANDER S, VERMA A, ARORA S, et al. Locally adaptive block thresholding method with continuity constraint [ J ]. Pattern Recognition Letters, 2007, 28 ( 1 ) : 119-124.
  • 9Q1AO Yu, HU Qing-mao, QIAN Guo-yu, et al. Thresholding based on variance and intensity contrast[ J]. Pattem Recognition, 2007, 40(2 ) :596-608.
  • 10PAL N R, PAL S K. Entropic thresholding[ J]. Signal Processing, 1959, 16(2) :97-108.

共引文献76

同被引文献52

引证文献8

二级引证文献38

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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