A Discrete Particle Swarm Optimization for Covering Array Generation

Huayao Wu, Changhai Nie, Fei Ching Kuo, Hareton Leung, Charles Colbourn

Research output: Contribution to journalArticle

40 Citations (Scopus)

Abstract

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.

Original languageEnglish (US)
Article number6919298
Pages (from-to)575-591
Number of pages17
JournalIEEE Transactions on Evolutionary Computation
Volume19
Issue number4
DOIs
StatePublished - Aug 1 2015

Fingerprint

Covering Array
Discrete Optimization
Particle swarm optimization (PSO)
Particle Swarm Optimization
Optimization Methods
Testing
Search Space
Evolutionary Algorithms
Defects
Heuristics
Optimization Problem
Integer
Software

Keywords

  • Combinatorial Testing
  • Covering Array Generation
  • Particle Swarm Optimization

ASJC Scopus subject areas

  • Software
  • Computational Theory and Mathematics
  • Theoretical Computer Science

Cite this

A Discrete Particle Swarm Optimization for Covering Array Generation. / Wu, Huayao; Nie, Changhai; Kuo, Fei Ching; Leung, Hareton; Colbourn, Charles.

In: IEEE Transactions on Evolutionary Computation, Vol. 19, No. 4, 6919298, 01.08.2015, p. 575-591.

Research output: Contribution to journalArticle

Wu, Huayao ; Nie, Changhai ; Kuo, Fei Ching ; Leung, Hareton ; Colbourn, Charles. / A Discrete Particle Swarm Optimization for Covering Array Generation. In: IEEE Transactions on Evolutionary Computation. 2015 ; Vol. 19, No. 4. pp. 575-591.
@article{b9aa9306788f49a1ba48fa9ee7dd8c90,
title = "A Discrete Particle Swarm Optimization for Covering Array Generation",
abstract = "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.",
keywords = "Combinatorial Testing, Covering Array Generation, Particle Swarm Optimization",
author = "Huayao Wu and Changhai Nie and Kuo, {Fei Ching} and Hareton Leung and Charles Colbourn",
year = "2015",
month = "8",
day = "1",
doi = "10.1109/TEVC.2014.2362532",
language = "English (US)",
volume = "19",
pages = "575--591",
journal = "IEEE Transactions on Evolutionary Computation",
issn = "1089-778X",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "4",

}

TY - JOUR

T1 - A Discrete Particle Swarm Optimization for Covering Array Generation

AU - Wu, Huayao

AU - Nie, Changhai

AU - Kuo, Fei Ching

AU - Leung, Hareton

AU - Colbourn, Charles

PY - 2015/8/1

Y1 - 2015/8/1

N2 - 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.

AB - 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.

KW - Combinatorial Testing

KW - Covering Array Generation

KW - Particle Swarm Optimization

UR - http://www.scopus.com/inward/record.url?scp=84938586373&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84938586373&partnerID=8YFLogxK

U2 - 10.1109/TEVC.2014.2362532

DO - 10.1109/TEVC.2014.2362532

M3 - Article

VL - 19

SP - 575

EP - 591

JO - IEEE Transactions on Evolutionary Computation

JF - IEEE Transactions on Evolutionary Computation

SN - 1089-778X

IS - 4

M1 - 6919298

ER -