HABCSm: A Hamming Based t-way Strategy Based on Hybrid Artificial Bee Colony for Variable Strength Test Sets Generation
Ammar K Alazzawi, Helmi Md Rais, Shuib Basri, Yazan A Alsariera, Luiz, Fernando Capretz, Abdullateef Oluwagbemiga Balogun, Abdullahi Abubakar Imam

TL;DR
This paper introduces HABCSm, a novel hybrid meta-heuristic strategy combining Artificial Bee Colony and Particle Swarm Optimization, using Hamming distance to efficiently generate minimal variable strength test sets.
Contribution
It proposes the first hybrid Artificial Bee Colony-based t-way testing strategy utilizing Hamming distance for improved test set generation.
Findings
HABCSm outperforms existing strategies in test set minimization.
The hybrid approach enhances exploration and solution quality.
Experimental results confirm superior performance of HABCSm.
Abstract
Search-based software engineering that involves the deployment of meta-heuristics in applicable software processes has been gaining wide attention. Recently, researchers have been advocating the adoption of meta-heuristic algorithms for t-way testing strategies (where t points the interaction strength among parameters). Although helpful, no single meta-heuristic based t-way strategy can claim dominance over its counterparts. For this reason, the hybridization of meta-heuristic algorithms can help to ascertain the search capabilities of each by compensating for the limitations of one algorithm with the strength of others. Consequently, a new meta-heuristic based t-way strategy called Hybrid Artificial Bee Colony (HABCSm) strategy, based on merging the advantages of the Artificial Bee Colony (ABC) algorithm with the advantages of a Particle Swarm Optimization (PSO) algorithm is proposed…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
