Abstract
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 capabilities. IJA enhances the intensification and diversification capabilities by introducing new operators search such levy 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 Jaya algorithm.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
