A Discrete Particle Swarm Optimization for Covering Array Generation

• Published in: IEEE transactions on evolutionary computation Vol. 19; no. 4; pp. 575 - 591
• Main Authors: Huayao Wu, Changhai Nie, Fei-Ching Kuo, Leung, Hareton, Colbourn, Charles J.
• Format: Journal Article
• Language: English
• Published: IEEE 01.08.2015
• Subjects: Arrays; Combinatorial Testing; Covering Array Generation; Guidelines; Optimization; Particle swarm optimization; Servers; Testing; Combinatorial testing (CT); particle swarm optimization (PSO); covering array generation
• ISSN: 1089-778X; 1941-0026
• DOI: 10.1109/TEVC.2014.2362532

Software behavior depends on many factors. Combinatorial testing (CT) aims to generate small sets of test cases to uncover defects caused by those factors and their interactions. Covering array generation, a discrete optimization problem, is the most popular research area in the field of CT. Particle swarm optimization (PSO), an evolutionary search-based heuristic technique, has succeeded in generating covering arrays that are competitive in size. However, current PSO methods for covering array generation simply round the particle's position to an integer to handle the discrete search space. Moreover, no guidelines are available to effectively set PSOs parameters for this problem. In this paper, we extend the set-based PSO, an existing discrete PSO (DPSO) method, to covering array generation. Two auxiliary strategies (particle reinitialization and additional evaluation of gbest) are proposed to improve performance, and thus a novel DPSO for covering array generation is developed. Guidelines for parameter settings both for conventional PSO (CPSO) and for DPSO are developed systematically here. Discrete extensions of four existing PSO variants are developed, in order to further investigate the effectiveness of DPSO for covering array generation. Experiments show that CPSO can produce better results using the guidelines for parameter settings, and that DPSO can generate smaller covering arrays than CPSO and other existing evolutionary algorithms. DPSO is a promising improvement on PSO for covering array generation.