返回
Effective Covering Array Generation Using an Improved Particle Swarm Optimization
DOI:10.1109/TR.2021.3132147.png)
摘要
En 中文
In the test case generation process of combinatorial testing, particle swarm optimization (PSO) is widely concerned for its simple implementation and fast convergence rate; however, it often falls into local optimum due to premature convergence. To attack this problem, a novel adaptive value measurement strategy is adopted by weighing the relationship between current test cases and historical test cases. The test case with the minimum average hamming distance is selected as the optimal test case, and the inertial weight linear differential decrease strategy is developed to ensure better inertial weight in different search stages, further to improve the capability of generating smaller covering arrays. In addition, we integrate the simulated annealing strategy into the improved PSO to improve the ability of particles jumping out of the local optimum, and an innovative approach for generating a better covering array is proposed. Experiments on 16 classical random strength covering arrays suggest that our approach outperforms six other techniques in terms of effectiveness.
Keyword:
Combinatorial testing
Particle swarm optimization
Convergence
Software algorithms
Genetic algorithms
Statistics
Sociology
Combinatorial testing
covering array generation
improved particle swarm optimization (PSO)
scale reduction
simulated annealing strategy
期刊
IF:
5.7
论文数:
2.8K
被引数:
8.5K
机构
引用论文
An Empirical Comparison of Combinatorial Testing, Random Testing and Adaptive Random Testing组合测试、随机测试和自适应随机测试的实证比较
An efficient GPU-based parallel tabu search algorithm for hardware/software co-design一种高效的基于GPU的软硬件协同设计并行禁忌搜索算法

