Abstract

The optimal test case suite constructing problem is defined thus: given a set of test requirements and a test suite that satisfies all test requirements, find a subset of the test suite containing a minimum number of test cases that still satisfies all test requirements. Existing methods for solving test case suite generation problem do not guarantee that obtained test suite is optimal. In this study, we propose a global optimization and generation method to construct optimal combinatorial testing data. Firstly, an encoding mechanism is used to map the combinatorial testing problem domain to a binary coding space. After that, an improving ethnic group evolution algorithm is used to search the binary coding space in order to find the optimal code schema. Finally, a decoding mechanism is used to read out the composition information of combinatorial testing data from the optimal code schema and construct optimal test case suite according to it. The simulation results show this method is simple and effective and it has the characteristics of less producing test data and time consumption.

Keywords:

Combinatorial testing, ethnic group evolution computing model, optimal test case suite, test data construction algorithm,

References

Competing interests

The authors have no competing interests.

Open Access Policy

This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.

Copyright

The authors have no competing interests.