检索
E-mail
RSS
作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2012, Vol. 38 ›› Issue (7): 40-41,45.doi: 10.3969/j.issn.1000-3428.2012.07.014

• 软件技术与数据库 • 上一篇    下一篇

基于改进DPSO的组合测试数据生成算法

孙家泽，王曙燕   

  1. (西安邮电学院计算机学院，西安 710121)
  • 收稿日期:2011-05-12 出版日期:2012-04-05 发布日期:2012-04-05
  • 作者简介:孙家泽(1980－)，男，讲师，主研方向：智能优化算法，软件测试；王曙燕，教授、博士
  • 基金项目:
    国家自然科学基金资助项目(61050003)；陕西省科技攻 关计划基金资助项目(2009K08-26)；陕西省教育厅基金资助项目(11JK1037)

Combinatorial Test Data Generation Algorithm Based on Improved DPSO

SUN Jia-ze, WANG Shu-yan   

  1. (School of Computer Science & Technology, Xi’an University of Posts and Telecommunications, Xi’an 710121, China)
  • Received:2011-05-12 Online:2012-04-05 Published:2012-04-05

PDF

1101

被引次数

3 | 1

摘要： 对离散粒子群优化算法进行改进，提出一种两两覆盖的组合测试数据生成算法。以一个粒子代表一个测试数据集，从整体上评价测试数据集对各个因素组合的覆盖情况，以测试数据中各因素离散值出现的次数为依据，随机产生粒子位置。实例分析表明，该算法与初始值无关，可有效生成测试数据且收敛速度快。

关键词: 组合测试, 离散粒子群优化, 测试数据集, 两两覆盖, 软件测试

Abstract: This paper improves the Discrete Particle Swarm Optimization(DPSO), presents a pairwise covering combinatorial test data generation algorithm. A particle represents a test set, fitness function is evaluated by the number of combination pair, and the position of the particle is produced by stochastic algorithm, which is randomly generated by the frequency of discrete values of all factors in test set. Example analysis shows that the algorithm has nothing to do with the initial value and can generate the most effective test data with fast convergence.

Key words: combinatorial test, Discrete Particle Swarm Optimization(DPSO), test data set, pairwise covering, software test

中图分类号: