TY  - JOUR
AV  - none
N1  - cited By 10
TI  - Review of Nature Inspired Metaheuristic Algorithm Selection for Combinatorial t-Way Testing
SP  - 27404
PB  - Institute of Electrical and Electronics Engineers Inc.
SN  - 21693536
EP  - 27431
N2  - The metaheuristic algorithm is a very important area of research that continuously improves in solving optimization problems. Nature-inspired is one of the metaheuristic algorithm classifications that has grown in popularity among researchers over the last few decades. Nature-inspired metaheuristic algorithms contribute significantly to tackling many standing complex problems (such as the combinatorial t-way testing problem) and achieving optimal results. One challenge in this area is the combinatorial explosion problem, which is always intended to find the most optimal final test suite that will cover all combinations of a given interaction strength. As such, test case generation has been selected as the most active research area in combinatorial t-way testing as Non-deterministic Polynomial-Time Hardness (NP-hard). However, not all metaheuristics are effectively adopted in combinatorial t-way testing, some proved to be effective and thus have been popular tools selected for optimization, whilst others were not. This research paper outlines a hundred and ten (110) outstanding nature-inspired metaheuristic algorithms for the last decades (2001 and 2021), such as the Coronavirus Optimization Algorithm, Ebola Optimization Algorithm, Harmony Search, Tiki-Taka Algorithm, and so on. The purpose of this review is to revisit and carry out an up-to-date review of these distinguished algorithms with their respective current states of use. This is to inspire future research in the field of combinatorial t-way testing for better optimization. Thus, we found that all metaheuristics have a simple structure that can be adopted in different areas to become more efficient in optimization. Finally, we suggested some future paths of investigation for researchers who are interested in the combinatorial t-way testing field to employ more of these algorithms by tuning their parameters settings to achieve an optimal solution. © 2013 IEEE.
ID  - scholars17733
KW  - Combinatorial optimization; Heuristic algorithms; Polynomial approximation; Problem solving; Software testing
KW  -  Combinatorial t-way testing; Heuristics algorithm; License; Meta-heuristics algorithms; Metaheuristic; Optimisations; Software algorithms; T-way testing; Test case; Test case optimization
KW  -  Genetic algorithms
Y1  - 2022///
A1  - Muazu, A.A.
A1  - Hashim, A.S.
A1  - Sarlan, A.
JF  - IEEE Access
UR  - https://www.scopus.com/inward/record.uri?eid=2-s2.0-85126278580&doi=10.1109%2fACCESS.2022.3157400&partnerID=40&md5=225d7fdd132e1d0caca84a102b2ba5f1
VL  - 10
ER  -