An Improved Jaya Algorithm-Based Strategy for T-Way Test Suite Generation
In the field of software testing, several meta-heuristics algorithms have been successfully used for finding an optimized t-way test suite (where t refers to covering level). T-way testing strategies adopt the meta-heuristic algorithms to generate the smallest/optimal test suite. However, the existi...
| Main Authors: | , , , |
|---|---|
| Format: | Conference or Workshop Item |
| Language: | English |
| Published: |
Springer
2020
|
| Subjects: | |
| Online Access: | http://umpir.ump.edu.my/id/eprint/27274/ http://umpir.ump.edu.my/id/eprint/27274/ http://umpir.ump.edu.my/id/eprint/27274/1/Full%20paper%20IRICT2019-IJA%20-3_1.pdf |
| Summary: | In the field of software testing, several meta-heuristics algorithms have been successfully used for finding an optimized t-way test suite (where t refers to covering level). T-way testing strategies adopt the meta-heuristic algorithms to generate the smallest/optimal test suite. However, the existing t-way strategies’ results show that no single strategy appears to be superior in all problems. The aim of this paper to propose a new variant of Jaya algorithm for generating t-way test suite called Improved Jaya Algorithm (IJA). In fact, the performance of meta-heuristic algorithms highly depends on the intensification and diversification ca-pabilities. IJA enhances the intensification and diversification capabilities by in-troducing new operators search such lévy flight and mutation operator in Jaya Algorithm. Experimental results show that the IJA variant improves the results of original Jaya algorithm, also overcomes the problems of slow convergence of Ja-ya algorithm. |
|---|