In the real world, there are a number of optimization problems whose search space is
restricted to take binary values; however, there are many continuous metaheuristics with …

Cervical cancer is one of the vital and most frequent cancers, but can be cured effectively if
diagnosed in the early stage. This is a novel effort towards effective characterization of cervix …

Firefly algorithm is a nature-inspired metaheuristic algorithm inspired by the flashing
behavior of fireflies. It is originally proposed for continuous problems. However, due to its …

This paper presents a novel binary bat algorithm (NBBA) to solve 0–1 knapsack problems.
The proposed algorithm combines two important phases: binary bat algorithm (BBA) and …

Given a delimited surveillance area, represented in either 2D or 3D, and a set of feasible
camera locations and orientations, the optimal camera placement problem (OCP) is that of …

The set covering problem seeks for minimum cost family of subsets from n given subsets,
which together covers the complete set. In this article, we present multi dynamic binary black …

The Set Covering Problem consists in finding a subset of columns in a zero‐one matrix such
that they cover all the rows of the matrix at a minimum cost. To solve the Set Covering …

The FOX algorithm is a recently developed metaheuristic approach inspired by the behavior
of foxes in their natural habitat. While the FOX algorithm exhibits commendable …

In this paper, we solve the Set Covering Problem with a meta-optimization approach. One of
the most popular models among facility location models is the Set Covering Problem. The …

The set covering problem is a classical optimization benchmark that finds application in
several real-world domains, particularly in line balancing production, crew scheduling, and …