基于正交搜索的粒子群优化测试用例生成方法

doi:10.3969/j.issn.0372-2112.2014.12.002

电子学报 ›› 2014, Vol. 42 ›› Issue (12): 2345-2351.DOI: 10.3969/j.issn.0372-2112.2014.12.002

基于正交搜索的粒子群优化测试用例生成方法

王令赛, 姜淑娟, 张艳梅, 于巧

中国矿业大学计算机科学与技术学院, 江苏徐州 221116

收稿日期:2014-05-02 修回日期:2014-06-26 出版日期:2014-12-25
- 通讯作者:
- 姜淑娟
- 作者简介:
- 王令赛 女,1989年3月出生于河北清河.中国矿业大学研究生,主要研究领域为软件测试、测试数据生成. E-mail:wls_007@126.com
- 基金资助:
- 国家自然科学基金 (No.60970032); 江苏省"333"工程; 江苏省"青蓝工程"; 中央高校基本科研业务费专项资金资助 (No.2013NB17)

Test Case Generation Based on Orthogonal Exploration and Particle Swarm Optimization

WANG Ling-sai, JIANG Shu-juan, ZHANG Yan-mei, YU Qiao

School of Computer Science and Technology, China University of Mining and Technology, Xuzhou, Jiangsu 221116, China

Received:2014-05-02 Revised:2014-06-26 Online:2014-12-25 Published:2014-12-25
- Supported by:
- National Natural Science Foundation of China (No.60970032); 333 High-level Talents Cultivation Project in Jiangsu Province; Blue Project in Jiangsu Province; Supported by Fundamental Research Funds for the Central Universities (No.2013NB17)

摘要/Abstract

摘要：

针对粒子群优化算法易出现早熟收敛的问题,本文提出一种基于正交搜索的粒子群优化测试用例生成方法.首先,利用奇异值分解来预测种群的进化方向,在其正交方向进行搜索,可避免已搜索过的区域,有助于跳出局部最优;然后,对粒子速度项进行改进,使其与正交方向保持一致,保证种群可持续受到正交方向的影响,有利于减少奇异值分解次数,降低时间消耗;最后,对每代最优个体进行局部搜索,以增强算法局部搜索能力.实验证明,本文方法在覆盖率、运行时间、进化代数等指标上均有优势.

关键词: 测试用例生成, 粒子群优化算法, 局部搜索, 奇异值分解

Abstract:

To solve the problem of premature convergence,this paper presents a method of generating test cases based on orthogonal exploration and particle swarm optimization.First,singular value decomposition is used to estimate the evolution direction and drives the population towards orthogonal direction,so that our method can avoid searching those traversed areas so far and jump out of local optimum.Then,we change the velocity so that it is able to be consistent with the orthogonal direction,and as a result,the population can be affected continually,which can decrease the frequency of singular value decomposition and reduce the time consumption.Finally,the local search is used for the best particle in each generation.The experimental results show that our method has advantages in coverage,running time,and the number of generations.

Key words: test case generation, particle swarm optimization, local search, singular value decomposition

中图分类号:

TP311

王令赛, 姜淑娟, 张艳梅, 等. 基于正交搜索的粒子群优化测试用例生成方法[J]. 电子学报, 2014, 42(12): 2345-2351.

WANG Ling-sai, JIANG Shu-juan, ZHANG Yan-mei, et al. Test Case Generation Based on Orthogonal Exploration and Particle Swarm Optimization[J]. Acta Electronica Sinica, 2014, 42(12): 2345-2351.

参考文献

[1] Bertolino A.Software testing research:Achievements,challenges,dreams[A].Future of Software Engineering (FOSE '07)[C].Minneapolis:IEEE,2007.85-103.
[2] Harman M,Kim S G,Lakhotia K,et al.Optimizing for the number of tests generated in search based test data generation with an application to the oracle cost problem[A].Proceedings of the Third IEEE International Conference on Software Testing Verification and Validation -Workshops (ICSTW 2010)[C].Paris:IEEE,2010.182-191.
[3] Nie P.A PSO Test case generation algorithm with enhanced exploration ability[J].Journal of Computational Information Systems,2012,8(14):5785-5793.
[4] Zhu X M,Yang X F.Software test data generation automatically based on improved adaptive particle swarm optimizer[A].Proceedings 2010 International Conference on Computational and Information Sciences[C].Chengdu:IEEE,2010.1300-1303.
[5] 史娇娇,姜淑娟,韩寒,王令赛.自适应粒子群优化算法及其在测试数据生成中的应用研究[J].电子学报,2013,41(8):1555-1559. Shi Jiaojiao,Jiang Shujuan,Han Han,Wang Lingsai.Adaptive particle swarm optimization algorithm and its application in test data generation[J].Acta Electronica Sinica,2013,41(8):1555-1559.(in Chinese)
[6] De Lucia A,Di Penta M,Oliveto R,et al.Estimating the evolution direction of populations to improve genetic algorithms[A].Proceedings of the 14th International Conference on Genetic and Evolutionary Computation[C].Philadelphia:ACM,2012.617-624.
[7] Kifetew M F,Panichella A,De Lucia A,et al.Orthogonal exploration of the search space in evolutionary test case generation[A].Proceedings of the 2013 International Symposium on Software Testing and Analysis[C].Lugano:ACM,2013.257-267.
[8] Kempka J,McMinn P,Sudholt D.A theoretical runtime and empirical analysis of different alternating variable searches for search-based testing[A].Proceeding of the 15th Annual Conference on Genetic and Evolutionary Computation Conference[C].Amsterdam:ACM,2013.1445-1452.
[9] Xiao M,El-Attar M,Reformat M,et al.Empirical evaluation of optimization algorithms when used in goal-oriented automated test data generation techniques[J].Empirical Software Engineering,2007,12(2):183-239.

[1]	廖勇, 杨馨怡, 杜洁汝. 基于两阶段的毫米波大规模MIMO低复杂度混合预编码算法[J]. 电子学报, 2021, 49(7): 1298-1304.
[2]	张建民, 黎铁军, 马柯帆, 肖立权. 一种加速FPGA布线的不可满足子式求解算法[J]. 电子学报, 2021, 49(6): 1210-1216.
[3]	韩红桂, 阿音嘎, 张璐, 乔俊飞. 自适应分解式多目标粒子群优化算法[J]. 电子学报, 2020, 48(7): 1245-1254.
[4]	王金艳, 胡春, 牛当当, 李先贤. 基于IAPS的扩展规则局部搜索算法[J]. 电子学报, 2020, 48(5): 899-905.
[5]	孙辉, 邓志诚, 赵嘉, 王晖, 谢海华. 混合均值中心反向学习粒子群优化算法[J]. 电子学报, 2019, 47(9): 1809-1818.
[6]	郑晨, 席晓莉, 宋忠国, 王梦蕾. 基于子空间技术中奇异向量分析的穿墙雷达杂波抑制方法[J]. 电子学报, 2019, 47(4): 848-854.
[7]	黄锦旺, 吕善翔, 李广明, 袁华强. 基于增殖系数的混沌信号提取算法[J]. 电子学报, 2019, 47(4): 855-861.
[8]	张行, 常颖, 宋康, 李春国, 杨绿溪. 一种新颖的水声信道参数估计算法[J]. 电子学报, 2019, 47(2): 509-512.
[9]	韩红桂, 武淑君. 基于收敛速度和多样性的多目标粒子群种群规模优化设计[J]. 电子学报, 2018, 46(9): 2263-2269.
[10]	刘兆广, 纪秀花, 刘云霞. 一种快速收敛的非参数粒子群优化算法及其收敛性分析[J]. 电子学报, 2018, 46(7): 1669-1674.
[11]	王金铭, 叶时平, 徐振宇, 陈超祥, 蒋燕君. 半张量积低存储压缩感知方法研究[J]. 电子学报, 2018, 46(4): 797-804.
[12]	闫涛, 刘凤娴, 陈斌. 基于量子混沌粒子群优化算法的分数阶超混沌系统参数估计[J]. 电子学报, 2018, 46(2): 333-340.
[13]	张丹威, 王晓东, 黄国勇. 相关系数SVD增强随机共振的单向阀故障诊断[J]. 电子学报, 2018, 46(11): 2696-2704.
[14]	曹玉莲, 李文锋, 张煜. 基于拟熵自适应启动局部搜索策略的混合粒子群算法[J]. 电子学报, 2018, 46(1): 110-117.
[15]	周新平, 孙德刚, 王竹, 欧长海. 一种基于奇异值分解的功耗轨迹筛选方法[J]. 电子学报, 2017, 45(9): 2250-2255.

基于正交搜索的粒子群优化测试用例生成方法

Test Case Generation Based on Orthogonal Exploration and Particle Swarm Optimization

PDF

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 15

编辑推荐

Metrics