Abstract

The application of meta-heuristic algorithms for t-way testing has recently become prevalent. Consequently, many useful meta-heuristic algorithms have been developed on the basis of the implementation of t-way strategies (where t indicates the interaction strength). Mixed results have been reported in the literature to highlight the fact that no single strategy appears to be superior compared with other configurations. The hybridization of two or more algorithms can enhance the overall search capabilities, that is, by compensating the limitation of one algorithm with the strength of others. Thus, hybrid variants of the flower pollination algorithm (FPA) are proposed in the current work. Four hybrid variants of FPA are considered by combining FPA with other algorithmic components. The experimental results demonstrate that FPA hybrids overcome the problems of slow convergence in the original FPA and offers statistically superior performance compared with existing t-way strategies in terms of test suite size.

Highlights

  • Many aspects of software engineering deal with optimization problems

  • The results show that elitism FPA (eFPA) produces superior results compared with the other variants of flower pollination algorithm (FPA)

  • EFPA is separately compared with each existing strategy to test if a significant difference exists between the produced results of the proposed strategy and those of the other strategies

Read more

Summary

Introduction

Many aspects of software engineering (e.g., requirements, management, testing, and refactoring) deal with optimization problems. Hybrid flower pollination algorithm can exponentially increase computational time and problem complexity To address this issue, many studies have adopted meta-heuristic algorithms on the basis of their implementation, including TS [13], SA [13], GA [13,14], CA [14], PSO [15], HS [16], and CS [17]). Many studies have adopted meta-heuristic algorithms on the basis of their implementation, including TS [13], SA [13], GA [13,14], CA [14], PSO [15], HS [16], and CS [17]) In accordance with the aforementioned prospects, this paper presents hybrid variants of strategies for t-way test suite generation on the basis of a new meta-heuristic called the FPA [8].

T-way test suite generation problem
Theoretical background
Related work
Flower pollination algorithm
Basic form of flower pollination algorithm
Hybrid flower pollination algorithm
Flower pollination algorithm based strategy for t-way test suite generation
Generating interaction element
Generating t-way test suite
Parameter tuning of the FPA
Hybrid FPA-based strategies for t-way test suite generation
Experiments and evaluation
Evaluation of hybrid variants of FPA
Benchmarking with existing t-way strategies
Conclusion
Threats to validity
Conclusion and further work
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.