基于蚁群算法的测试用例集优化方法  

Approach for optimizing test suite based on ACO

作　　者：任洪丽[1] 张伟[1] 梁家安[1] 

机构地区：[1]江南大学信息工程学院,江苏无锡214122

出　　处：《计算机工程与应用》2010年第29期58-62,共5页Computer Engineering and Applications

摘　　要：为了达到以尽可能少的测试用例满足测试需求的目的,提出了一种先对测试用例集进行完全划分,再利用蚁群算法对其优化的方法。首先根据测试需求间的相互关系,将最初的测试用例集划分成多个互不相交的子集,每个子集中的元素为等价测试用例;其次从各个子集中选取一个测试用例,组成一个新的集合,该集合已经摒弃了部分冗余测试用例;然后利用蚁群算法对测试用例集进行最优的简化;最后通过实例证明了该方法可以产生比原有的方法更优的测试用例集。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.

关 键 词：测试用例 测试需求 蚁群算法 测试用例集 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]