
تعداد نشریات | 11 |
تعداد شمارهها | 222 |
تعداد مقالات | 2,215 |
تعداد مشاهده مقاله | 3,264,550 |
تعداد دریافت فایل اصل مقاله | 2,346,766 |
Using β-Hill Climbing Optimizer to Generate Optimal Test Suite | ||
Journal of Electrical and Computer Engineering Innovations (JECEI) | ||
مقالات آماده انتشار، پذیرفته شده، انتشار آنلاین از تاریخ 22 تیر 1404 | ||
نوع مقاله: Original Research Paper | ||
شناسه دیجیتال (DOI): 10.22061/jecei.2025.11277.787 | ||
نویسندگان | ||
S. A. H. Eshghazadi؛ E. Pira* ؛ M. Khodizadeh-Nahari؛ A. Rouhi | ||
Faculty of Information Technology and Computer Engineering, Azarbaijan Shahid Madani University, Tabriz, Iran. | ||
تاریخ دریافت: 25 اسفند 1403، تاریخ بازنگری: 18 خرداد 1404، تاریخ پذیرش: 21 تیر 1404 | ||
چکیده | ||
Background and Objectives: Software testing plays a vital role in software development, aimed at verifying the reliability and stability of software systems. The generation of an effective test suite is key to this process, as it directly impacts the detection of defects and vulnerabilities. However, for software systems with numerous input parameters, the combinatorial explosion problem hinders the creation of comprehensive test suites. This research introduces a novel approach using the β-Hill Climbing optimizer, an advanced variant of the traditional hill climbing algorithm, to efficiently generate optimal test suites. Methods: The β-Hill Climbing optimizer introduces a dynamic parameter, β, which facilitates a precise balance between exploration and exploitation throughout the search process. To evaluate the performance of this proposed strategy (referred to as BHC), it is compared with TConfig as a mathematical approach, PICT and IPOG as greedy algorithms, and GS, GALP, DPSO, WOA, BAPSO, and GSTG as meta-heuristic methods. These strategies are tested across a variety of configurations to assess their relative efficiency. Results: The reported results confirm that BHC outperforms the others in terms of the size of generated test suites and convergence speed. The statistical analysis of the experimental results on several different configurations shows that BHC outperforms TConfig as a mathematical strategy, PICT and IPOG as greedy strategies, GS, GALP, DPSO, WOA, BAPSO, and GSTG as meta-heuristics by 83%, 88%, 87%, 61%, 61%, 46%, 61%, 62%, and 70%, respectively. Conclusion: The BHC strategy presents a novel and effective approach to optimization, inspired by β-Hill Climbing optimizer for the generation of optimal test suite. Its superior performance in the generation of test suites with smaller size and higher convergence speed compared to other strategies. | ||
کلیدواژهها | ||
Hill climbing؛ Meta-heuristic؛ Optimizer؛ Software testing؛ Test suite | ||
آمار تعداد مشاهده مقاله: 6 |