Using β-Hill Climbing Optimizer to Generate Optimal Test Suite

Eshghazadi, Seyyed AmirHossein; Pira, Einollah; Khodizadeh-Nahari, Mohammad; Rouhi, Alireza

doi:10.22061/jecei.2025.11277.787

تعداد نشریات	11
تعداد شماره‌ها	234
تعداد مقالات	2,381
تعداد مشاهده مقاله	3,802,090
تعداد دریافت فایل اصل مقاله	2,763,591

	Using β-Hill Climbing Optimizer to Generate Optimal Test Suite
Journal of Electrical and Computer Engineering Innovations (JECEI)
مقاله 8، دوره 14، شماره 1، مهر 2026، صفحه 83-98 اصل مقاله (1.46 M)
نوع مقاله: Original Research Paper
شناسه دیجیتال (DOI): 10.22061/jecei.2025.11277.787
نویسندگان
Seyyed AmirHossein Eshghazadi؛ Einollah Pira^* ؛ Mohammad Khodizadeh-Nahari؛ Alireza 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

مراجع
[1] B. S. Ahmed, T. S. Abdulsamad, M. Y. Potrus, "Achievement of minimized combinatorial test suite for configuration-aware software functional testing using the cuckoo search algorithm," Inf. Software Technol., 66: 13-29, 2015. [2] R. Jhala, R. Majumdar, "Software model checking," ACM Comput. Surv. (CSUR), 41(4): 1-54, 2009. [3] L. Luo, "Software testing techniques," Institute for software research international Carnegie mellon university Pittsburgh, PA, vol. 15232, no. 1-19, p. 19, 2001. [4] D. R. Kuhn, M. J. Reilly, "An investigation of the applicability of design of experiments to software testing," in Proc. 27th Annual NASA Goddard/IEEE Software Engineering Workshop: 91-95, 2002. [5] M. A. Al-Betar, "β-hill climbing: an exploratory local search," Neural Comput. Appl., 28(Suppl 1): 153-168, 2017. [6] B. Selman, C. P. Gomes, "Hill-climbing search," Encycl. Cognit. Sci., 81, 2006. [7] S. Chinnasamy, M. Ramachandran, M. Amudha, K. Ramu, "A review on hill climbing optimization methodology," Recent Trends Manage. Commerce, 3(1), 2022. [8] E. R. R. Kato, G. D. de Aguiar Aranha, R. H. Tsunaki, "A new approach to solve the flexible job shop problem based on a hybrid particle swarm optimization and Random-Restart Hill Climbing," Comput. Ind. Eng., 125: 178-189, 2018. [9] E. Aarts, J. Korst, W. Michiels, "Simulated annealing," in Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques: 187-210, 2005. [10] J. Arriaga, M. Valenzuela-Rendón, "Steepest ascent hill climbing for portfolio selection," in Proc. European Conference on the Applications of Evolutionary Computation: 145-154, 2012. [11] D. LaSalle, G. Karypis, "A parallel hill-climbing refinement algorithm for graph partitioning," in Proc. 45th International Conference on Parallel Processing (ICPP): 236-241, 2016. [12] M. Gendreau, J. Y. Potvin, "Tabu search," in Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques: 165-186, 2005. [13] M. H. Shirvani, "A hybrid meta-heuristic algorithm for scientific workflow scheduling in heterogeneous distributed computing systems," Eng. Appl. Artif. Intell., 90: 103501, 2020. [14] B. Keshanchi, N. J. Navimipour, "Priority-based task scheduling in the cloud systems using a memetic algorithm," J. Circuits Syst. Comput., 25(10): 1650119, 2016. [15] B. Selman, C. P. Gomes, "Hill-climbing search," Encycl. Cognit. Sci., 81(10): 333-335, 2006. [16] S. Esfandyari, V. Rafe, "A tuned version of genetic algorithm for efficient test suite generation in interactive t-way testing strategy," Inf. Software Technol., 94: 165-185, 2018. [17] A. Hartman, "Software and hardware testing using combinatorial covering suites," in Graph theory, combinatorics and algorithms: Springer, pp: 237-266, 2005. [18] A. W. Williams, R. L. Probert, "A practical strategy for testing pair-wise coverage of network interfaces," in Proc. 7th International Symposium on Software Reliability Engineering (ISSRE'96) :246-254, 1996. [19] C. Nie, H. Leung, "A survey of combinatorial testing," ACM Comput. Surv. (CSUR), 43(2): 1-29, 2011. [20] D. M. Cohen, S. R. Dalal, M. L. Fredman, G. C. Patton, "The AETG system: An approach to testing based on combinatorial design," IEEE Trans. Software Eng., 23(7): 437-444, 1997. [21] M. B. Cohen, "Designing test suites for software interactions testing," Auckland Univ (New Zealand), 2004. [22] J. Czerwonka, "Pairwise testing in the real world: Practical extensions to test-case scenarios," Microsoft Corporation, Software Testing Technical Articles, 2008. [23] B. Jenkins, "Jenny test tool," ed, 2009. [24] B. S. Ahmed, M. A. Sahib, M. Y. Potrus, "Generating combinatorial test cases using Simplified Swarm Optimization (SSO) algorithm for automated GUI functional testing," Eng. Sci. Technol., Int. J., 17(4): 218-226, 2014. [25] K. Z. Zamli, M. F. Klaib, M. I. Younis, N. A. M. Isa, R. Abdullah, "Design and implementation of a t-way test data generation strategy with automated execution tool support," Inf. Sci., 181(9): 1741-1758, 2011. [26] M. Forbes, J. Lawrence, Y. Lei, R. N. Kacker, D. R. Kuhn, "Refining the in-parameter-order strategy for constructing covering arrays," J. Res. Natl. Inst. Stand. Technol., 113(5): 287, 2008. [27] A. A. Muazu, A. S. Hashim, A. Sarlan, M. Abdullahi, "SCIPOG: Seeding and constraint support in IPOG strategy for combinatorial t-way testing to generate optimum test cases," J. King Saud Univ. Comput. Inf. Sci., 35(1): 185-201, 2023. [28] S. Akyol, B. Alatas, "Plant intelligence based metaheuristic optimization algorithms," Artif. Intell. Rev., 47: 417-462, 2017. [29] B. Alatas, "ACROA: Artificial chemical reaction optimization algorithm for global optimization," Expert Syst. Appl., 38(10): 13170-13180, 2011. [30] Z. Abbasi, S. Esfandyari, and V. Rafe, "Covering array generation using teaching learning base optimization algorithm," Tabriz J. Electr. Eng., 48(1): 161-171, 2018. [31] J. Kennedy, R. Eberhart, "Particle swarm optimization," in Proc. ICNN'95-International Conference on Neural Networks, 4: 1942-1948, 1995. [32] S. Esfandyari, V. Rafe, "Using the particle swarm optimization algorithm to generate the minimum test suite in covering array with uniform strength," Soft Comput. J., 8(2): 66-79, 2021. [33] Y. A. Alsariera, A. H. Al Omari, M. A. Albawaleez, Y. K. Sanjalawe, K. Z. Zamli, "Hybridized BA & PSO t-way Algorithm for Test Case Generation," Int. J. Comput. Sci. Network Secur. (IJCSNS), 21(10): 343, 2021. [34] K. M. Htay, R. R. Othman, A. Amir, J. M. H. Alkanaani, "Gravitational search algorithm based strategy for combinatorial t-way test suite generation," J. King Saud Univ. Comput. Inf. Sci., 34(8A): 4860- 4873, 2022. [35] D. Whitley, "A genetic algorithm tutorial," Stat. Comput., 4(2): 65-85, 1994. [36] H. N. N. Al-Sammarraie, D. N. Jawawi, "Multiple black hole inspired meta-heuristic searching optimization for combinatorial testing," IEEE Access, 8: 33406-33418, 2020. [37] J. M. Altmemi, R. Othman, R. Ahmad, "SCAVS: Implement Sine Cosine Algorithm for generating Variable t-way test suite," in Proc. IOP Conference Series: Materials Science and Engineering, 917(1): 012011, 2020. [38] S. Mirjalili, "SCA: A sine cosine algorithm for solving optimization problems," Knowledge-Based Syst., 96: 120-133, 2016. [39] A. K. Alazzawi, H. M. Rais, S. Basri, "Artificial bee colony algorithm for t-way test suite generation," in Proc. 2018 4th International Conference on Computer and Information Sciences (ICCOINS): 1-6, 2018. [40] A. K. Alazzawi, H. M. Rais, S. Basri, "ABCVS: An artificial bee colony for generating variable t-way test sets," Int. J. Adv. Comput. Sci. Appl., 10(4): 259-274, 2019. [41] A. K. Alazzawi, H. M. Rais, S. Basri, Y. A. Alsariera, "Pairwise test suite generation based on hybrid artificial bee colony algorithm," in Advances in Electronics Engineering, Springer, pp. 137-145, 2020. [42] A. K. Alazzawi, H. Rais, S. Basri, "HABC: Hybrid artificial bee colony for generating variable t-way test sets," J. Eng. Sci. Technol., 15(2): 746-767, 2020. [43] A. K. Alazzawi, H. M. Rais, S. Basri, "Parameters tuning of hybrid artificial bee colony search based strategy for t-way testing," Int. J. Innov. Technol. Exploring Eng, 8(5S): 204-212, 2019. [44] A. K. Alazzawi, H. M. Rais, S. Basri, "Hybrid artificial bee colony algorithm for t-way interaction test suite generation," in Proc. Computer Science On-line Conference: 192-199, 2019. [45] A. K. Alazzawi, H. M. Rais, S. Basri, Y. A. Alsariera, A. O. Balogun, A. A. Imam, "A hybrid artificial bee colony strategy for t-way test set generation with constraints support," J. Phys. Conf. Ser., 1529(4): 042068, 2020. [46] A. K. Alazzawi, H. M. Rais, S. Basri, Y. A. Alsariera, "PhABC: A hybrid artificial bee colony strategy for pairwise test suite generation with constraints support," in Proc. 2019 IEEE Student Conference on Research and Development (SCOReD): 106-111, 2019. [47] S. Esfandyari and V. Rafe, "A hybrid solution for software testing to minimum test suite generation using hill climbing and bat search algorithms," Tabriz J. Electr. Eng., 46(3): 25-35, 2016. [48] J. B. Odili, A. B. Nasser, A. Noraziah, M. H. A. Wahab, M. Ahmed, "African buffalo optimization algorithm based t-way test suite generation strategy for electronic-payment transactions," in Proc. International Conference on Emerging Technologies and Intelligent Systems (ICETIS 2021): 160-174, 2022. [49] M. Ahmed, A. B. Nasser, K. Z. Zamli, "Construction of prioritized t-way test suite using bi-objective dragonfly algorithm," IEEE Access, 10: 71683-71698, 2022. [50] E. Pira, V. Rafe, S. Esfandyari, "Minimum covering array generation using success-history and linear population size reduction based adaptive differential evolution algorithm," Tabriz J. Electr. Eng., 52(2): 77-89, 2022. [51] S. Esfandyari, V. Rafe, "GALP: A hybrid artificial intelligence algorithm for generating covering array," Soft Comput., 25(11): 7673-7689, 2021. [52] M. Z. Z. Ahmad, R. R. Othman, M. S. A. R. Ali, N. Ramli, "A self-adapting Ant Colony Optimization Algorithm Using Fuzzy logic (ACOF) for combinatorial test suite generation," in Proc. IOP Conference Series: Materials Science and Engineering, 767(1): 012017, 2020. [53] A. A. Alsewari, L. M. Xuan, K. Z. Zamli, "Firefly combinatorial testing strategy," in Proc. Science and Information Conference: 936-944, 2018. [54] K. Z. Zamli, F. Din, A. B. Nasser, A. Alsewari, "Combinatorial test suite generation strategy using enhanced sine cosine algorithm," in Proc. 5th International Conference on Electrical, Control & Computer Engineering: 127-137, 2020. [55] A. S. Ghiduk, A. Alharbi, "Generating of test data by harmony search against genetic algorithms," Intell. Autom. Soft Comput., 36(1): 647, 2023. [56] A. A. Muazu, A. S. Hashim, U. I. i. Audi, U. D. Maiwada, "Refining a one-parameter-at-a-time approach using harmony search for optimizing test suite size in combinatorial t-way testing," IEEE Access, 12: 137373-137398, 2024. [57] H. M. Fadhil, M. Abdullah, M. Younis, "Innovations in T-way test creation based on a hybrid hill climbing-greedy algorithm," IAES Int. J. Artif. Intell., 12(2): 794, 2023. [58] A. A. Hassan, S. Abdullah, K. Z. Zamli, R. Razali, "Q-learning whale optimization algorithm for test suite generation with constraints support," Neural Comput. Appl., 35(34): 24069-24090, 2023. [59] X. Guo, X. Song, J. t. Zhou, F. Wang, "A tolerance-based memetic algorithm for constrained covering array generation," Memet. Comput., 15(3): 319-340, 2023. [60] B. Arasteh, K. Arasteh, A. Ghaffari, "An automatic software test-generation method to discover the faults using fusion of machine learning and horse herd algorithm," J. Supercomput., 81(5): 1-36, 2025. [61] B. Arasteh et al., "A bioinspired test generation method using discretized and modified bat optimization algorithm," Mathematics, 12(2): 186, 2024. [62] H. M. Fadhil, M. N. Abdullah, M. I. Younis, "Dynamic TWGH: Client-server optimization for scalable combinatorial test suite generation," in Proc. BIO Web of Conferences: 00115, 2024. [63] E. Pira, V. Rafe, S. Esfandyari, "A three-phase approach to improve the functionality of t-way strategy," Soft Comput., 28(1): 415-435, 2024. [64] E. Pira, M. Khodizadeh-Nahari, "Combinatorial t-way test suite generation using an improved asexual reproduction optimization algorithm," Appl. Soft Comput., 150: 111070, 2024. [65] S. Li, Y. Song, Y. Zhang, "Combinatorial test case generation based on ROBDD and improved particle swarm optimization algorithm," Appl. Sci., 14(2): 753, 2024. [66] M. Friedman, "A comparison of alternative tests of significance for the problem of m rankings," Ann. Math. Stat., 11(1): 86-92, 1940.
آمار تعداد مشاهده مقاله: 245 تعداد دریافت فایل اصل مقاله: 39

سامانه مدیریت نشریات علمی. طراحی و پیاده سازی از سیناوب

پیوندهای مفید

آمار

Using β-Hill Climbing Optimizer to Generate Optimal Test Suite