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 …

Most of the optimization problems encountered in the real world are discrete type which
involves decision variables defined in the discrete search space. Binary optimization …

Combinatorial searching-based software testing (CSST) is a challenging optimization
procedure. The achievement of optimal solutions involves a careful formulation of the …

Search-based software engineering that involves the deployment of meta-heuristics in
applicable software processes has been gaining wide attention. Recently, researchers have …

The potentially many software system input combinations make exhaustive testing
practically impossible. To address this issue, combinatorial t-way testing (where t indicates …

Much of our daily tasks have been computerized by machines and sensors communicating
with each other in real-time. There is a reasonable risk that something could go wrong …

In combinatorial testing development, the fabrication of covering arrays is the key challenge
by the multiple aspects that influence it. A wide range of combinatorial problems can be …

This paper introduces a new variant of a metaheuristic algorithm based on the whale
optimization algorithm (WOA), the Q-learning algorithm and the Exponential Monte Carlo …

Exhaustive testing is a type of testing that test all possible combination of parameter values
to make sure the product is free from any possible faults and errors. However, employing …

To ensure the correctness and quality of a software system, it is desirable to test all possible
combinations of the input parameters under various configurations. But the exhaustive …