Tie-breaking in social network search algorithm for software test redundancy reduction optimization problem

Test Redundancy Reduction (TRR) is an important approach for minimizing the number of test cases while still satisfying all user acceptance test requirements. During the TRR optimization process, situations may arise in which multiple candidate solutions exhibit identical fitness values, leading to...

Full description

Saved in:
Bibliographic Details
Main Authors: Mekeng, Ambros Magnus Rudolf, Kamal Z., Zamli, Muhammad Zarlis, ., Muhammad Arif, Mohamad, Darusalam, Ucuk
Format: Conference or Workshop Item
Language:en
Published: IEEE 2026
Subjects:
Online Access:https://umpir.ump.edu.my/id/eprint/47716/1/Tie-Breaking_in_Social_Network_Search_Algorithm_for_Software_Test_Redundancy_Reduction_Optimization_Problem%20%281%29%20-%20Ambros%20M.%20Rudolf%20Mekeng.pdf
https://umpir.ump.edu.my/id/eprint/47716/
https://doi.org/10.1109/ISIBER68248.2026.11470036
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Test Redundancy Reduction (TRR) is an important approach for minimizing the number of test cases while still satisfying all user acceptance test requirements. During the TRR optimization process, situations may arise in which multiple candidate solutions exhibit identical fitness values, leading to ambiguity in solution selection. To address this issue, tie-breaking mechanisms, namely first-element tiebreaking, last-element tie-breaking, and random tie-breaking can be applied, each employing a distinct strategy to resolve equal-fitness solutions. In this study, the Social Network Search (SNS) algorithm is employed to investigate the impact of these tie-breaking mechanisms on TRR optimization performance, motivated by the No Free Lunch (NFL) theorem, which states that no single optimization algorithm performs best across all problems. The experimental evaluation focuses on identifying solutions that achieve full requirement coverage (100%) with the minimum possible number of test cases. Experimental results demonstrate that the SNS algorithm integrated with tie-breaking mechanisms consistently achieves optimal fitness, attaining 100% requirement coverage, and the tie-breaking also effect to runtime.