Optimization and Prioritization of Test Cases through the Hungarian Algorithm
Hemant Kumar
*
Department of Computer Science, Babasaheb Bhimrao Ambedkar University, Vidya Vihar, Rae Bareli Road, Lucknow 226025, India.
Vipin Saxena
Department of Computer Science, Babasaheb Bhimrao Ambedkar University, Vidya Vihar, Rae Bareli Road, Lucknow 226025, India.
*Author to whom correspondence should be addressed.
Abstract
Test cases play a significant role in developing high-quality and reliable software products. Efficient test case generation and optimization are essential to minimize testing time and ensure comprehensive coverage of software modules. This paper proposes a novel approach to test case optimization and prioritization using the Hungarian algorithm, which systematically assigns test cases to minimize execution time and enhance testing efficiency. Initially, test cases are generated and classified as valid or invalid, with only valid test cases being prioritized for execution. The proposed method is adaptable to various software testing strategies, making it applicable across different domains. The effectiveness of this approach is demonstrated through computed results presented in tabular and graphical formats, showing significant improvements in test execution efficiency.
Keywords: Testing strategy, test cases, hungarian method, prioritization, optimization