Enhancing Harmony Search Metaheuristic Algorithm for Coverage Efficiency, Test Suite Reduction, and Running Time in Combinatorial Interaction Testing
Optimization has developed powerful algorithms for solving complex problems efficiently. The effectiveness of these algorithms, also called metaheuristics, largely depends on the capabilities of their search techniques. Combinatorial Interaction Testing (CIT) is an efficient technique for detecting...
Saved in:
| Main Authors: | Aminu Aminu Muazu, Ahmad Sobri Hashim |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2025-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/11050427/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
SCIPOG: Seeding and constraint support in IPOG strategy for combinatorial t-way testing to generate optimum test cases
by: Aminu Aminu Muazu, et al.
Published: (2023-01-01) -
Improving harmony search algorithms by using tonal variation: the case of Sudoku and MKP
by: Nicolás Rojas-Morales, et al.
Published: (2018-07-01) -
Application of harmony search algorithm in optimizing autoregressive integrated moving average: A study on a data set of Coronavirus Disease 2019
by: Riya Karmakar, et al.
Published: (2024-12-01) -
Regression Test Suite Minimization Using Modified Artificial Ecosystem Optimization Algorithm
by: Abhishek Singh Verma, et al.
Published: (2021-01-01) -
AGTS: Novel automated generation of smart contract test suites for Hyperledger Fabric
by: Lixue Liu, et al.
Published: (2025-08-01)