A relay-based hybrid PSO-jaya algorithm for efficient test redundancy reduction
In software development, test redundancy increases resource consumption and execution time. To address this problem, Test Redundancy Reduction (TRR) has emerged as a critical optimization problem in software testing. In this context, we introduce a Relay-based Hybrid PSO-Jaya algorithm, which employ...
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Conference or Workshop Item |
| Language: | en |
| Published: |
IEEE
2026
|
| Subjects: | |
| Online Access: | https://umpir.ump.edu.my/id/eprint/47562/1/A%20relay-based%20hybrid%20PSO-jaya%20algorithm%20for%20efficient%20test%20redundancy%20reduction.pdf https://umpir.ump.edu.my/id/eprint/47562/ https://doi.org/10.1109/ICSECS65227.2025.11279093 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | In software development, test redundancy increases resource consumption and execution time. To address this problem, Test Redundancy Reduction (TRR) has emerged as a critical optimization problem in software testing. In this context, we introduce a Relay-based Hybrid PSO-Jaya algorithm, which employs PSO for its strong global exploration capability, followed by Jaya to perform local refinement of promising regions in the search space. This sequential relay allows PSO to broadly explore the solution space while Jaya intensifies the search around highquality candidates. Experimental results across four benchmark datasets show that the proposed relay-based hybrid approach consistently outperforms standalone PSO and Jaya in terms of test reduction percentage and full requirement coverage. Furthermore, the effect of the algorithmic sequence (PSO-Jaya vs. Jaya-PSO) is also evaluated, highlighting the importance of strategic hybridization order. The findings demonstrate that the proposed relay-based hybrid metaheuristics offer a promising direction for addressing TRR in large-scale test suites. |
|---|