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

基于蚁群算法的测试用例集优化方法
引用本文:任洪丽,张伟,梁家安.基于蚁群算法的测试用例集优化方法[J].计算机工程与应用,2010,46(29):58-62.
作者姓名:任洪丽  张伟  梁家安
作者单位:江南大学,信息工程学院,江苏,无锡,214122
摘    要:为了达到以尽可能少的测试用例满足测试需求的目的,提出了一种先对测试用例集进行完全划分,再利用蚁群算法对其优化的方法。首先根据测试需求间的相互关系,将最初的测试用例集划分成多个互不相交的子集,每个子集中的元素为等价测试用例;其次从各个子集中选取一个测试用例,组成一个新的集合,该集合已经摒弃了部分冗余测试用例;然后利用蚁群算法对测试用例集进行最优的简化;最后通过实例证明了该方法可以产生比原有的方法更优的测试用例集。

关 键 词:测试用例  测试需求  蚁群算法  测试用例集
收稿时间:2009-12-31
修稿时间:2010-5-25  

Approach for optimizing test suite based on ACO
REN Hong-li,ZHANG Wei,LIANG Jia-an.Approach for optimizing test suite based on ACO[J].Computer Engineering and Applications,2010,46(29):58-62.
Authors:REN Hong-li  ZHANG Wei  LIANG Jia-an
Affiliation:(School of Information Technology, Jiangnan University, Wuxi, Jiangsu 214122, China)
Abstract:In order to meet the test requirements with the minimal test case,a method that divides test suite completely is presented,and then the test suite is simplified with ant colony algorithm.Firstly,test suite is divided into several disjoint subsets, whose elements are equivalent, according to the inter-relationship among the test requirements.Secondly, one test case is selected from each subset to form a new collection that has been abandoned some of the redundancy test cases.Then the test suite is optimized using ant colony algorithm.Finally,through the experiment, it is verified that the method proposed can produce more optimal test suite compared to the original method.
Keywords:test cases  test requirement  ant colony algorithm  test suite
本文献已被 维普 万方数据 等数据库收录!
点击此处可从《计算机工程与应用》浏览原始摘要信息
点击此处可从《计算机工程与应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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

京公网安备 11010802026262号