A memetic algorithm for high‐strength covering array generation-Reference-Cited by-同舟云学术

A memetic algorithm for high‐strength covering array generation

Published:2023-07-12 Issue:4 Volume:17 Page:538-553
ISSN:1751-8806
Container-title:IET Software
language:en
Short-container-title:IET Software

Author:

Guo Xu¹²^ORCID,Song Xiaoyu³,Zhou Jian‐tao¹²,Wang Feiyu¹,Tang Kecheng¹,Wang Zhuowei⁴

Affiliation:

1. College of Computer Science Inner Mongolia University Hohhot Inner Mongolia China

2. National and Local Joint Engineering Research Center of Intelligent Information Processing Technology for Mongolian Engineering Research Center of Ecological Big Data Ministry of Education Inner Mongolia Engineering Laboratory for Cloud Computing and Service Software Inner Mongolia Key Laboratory of Social Computing and Data Processing Inner Mongolia Engineering Laboratory for Big Data Analysis Technology Hohhot China

3. Department of Electrical and Computer Engineering Portland State University Portland Oregon USA

4. School of Computer Science and Technology Guangdong University of Technology Guangzhou Guangdong China

Abstract

AbstractCovering array generation (CAG) is the key research problem in combinatorial testing and is an NP‐complete problem. With the increasing complexity of software under test and the need for higher interaction covering strength t, the techniques for constructing high‐strength covering arrays are expected. This paper presents a hybrid heuristic memetic algorithm named QSSMA for high‐strength CAG problem. The sub‐optimal solution acceptance rate is introduced to generate multiple test cases after each iteration to improve the efficiency of constructing high‐covering strength test suites. The QSSMA method could successfully build high‐strength test suites for some instances where t up to 15 within one day cutoff time and report five new best test suite size records. Extensive experiments demonstrate that QSSMA is a competitive method compared to state‐of‐the‐art methods.

Funder

National Natural Science Foundation of China

Publisher

Institution of Engineering and Technology (IET)

Subject

Computer Graphics and Computer-Aided Design

Reference56 articles.

1. Construction of t-way covering arrays using genetic algorithm

2. Case generation by constraints combinatorial testing;Bai X.;J. Tsinghua Univ.,2017

3. A Discrete Particle Swarm Optimization for Covering Array Generation

4. A survey of combinatorial testing

5. An Approach to Test Set Generation for Pair-Wise Testing Using Genetic Algorithms