Combinatorial Test Case Generation Using Q-Value Based Particle Swarm Optimization

• Main Authors: Prakash, V.C (Author), Tatale, S. (Author)
• Format: Article
• Language: English
• Published: International Information and Engineering Technology Association 2022
• Subjects: combinatorial testing; pairwise testing; particle swarm optimization; test case generation
• Online Access: View Fulltext in Publisher

 Combinatorial testing is an effective method for generating test cases. Pairwise testing is a combinatorial approach that evaluates the interactions between the input test parameters while reducing test case size by selecting a broader search area. Most combinatorial testing research focuses on developing novel approaches for generating an optimal number of test cases that cover pairwise combinations of input test parameters. Using existing test case generation techniques, optimal or near-optimal combinatorial test cases are generated in polynomial time. The authors presented the Q-value-based Particle Swarm Optimization (Q-PSO) technique for efficiently and effectively generating an optimal number of test cases. The primary goals of the proposed technique are to generate test cases using a Q-value based PSO, which is easier to build and has fewer parameters to define than other meta-heuristic search methodologies and to put the proposed technique into practice and report on an empirical study that examines and verifies the significant impact factors in the proposed approach. Q-value is used to evaluate the particles (referred to as test cases) in the Q-PSO. The reward is totalled in the Q-value, which serves as the fitness function for PSO evolution. The Q-value of each particle determines its performance and indicates how quickly the particle can lead the system's state to the set of objective states. The authors used the Q-PSO technique to validate the efficiency and efficacy of the proposed approach. The Q-PSO technique's results are compared to existing metaheuristics and computation-based techniques. In most inputs based on the development environment, meta-heuristic search techniques take significantly longer than other greedy techniques. For some inputs, the proposed Q-PSO technique outperforms existing meta-heuristics techniques. Q-PSO results are also compared to IPOG, ITCH, Jenny, TConfig, TVG, and other well-known computational-based techniques. The goal of the comparison is to examine how the size of the test cases generated has grown over time. © 2022 Lavoisier. All rights reserved.