Abstract Cultural Algorithms (CAs) are evolutionary algorithms (EAs) inspired by the
conceptual models of the human cultural evolution process. In contrast to the conventional …

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 is a formal model for many practical optimization problems. In the
set covering problem the goal is to choose a subset of the columns of minimal cost that …

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 set cover problem, belongs to the branch of combinatorial optimization problems, whose
complexity is exponential theoretically established as NP-complex problems. Consists in …

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 …

This work presents a study of a new binary coded firefly algorithm. The firefly algorithm is a
novel nature-inspired metaheuristic, inspired by the social behavior of fireflies, which is …

In this paper, we present a new Artificial Bee Colony algorithm to solve the non-unicost Set
Covering Problem. The Artificial Bee Colony algorithm is a recent metaheuristic technique …

The set covering problem (SCP) is a well-known computationally intractable problem. We
suggest here a two-phase heuristic to solve it. The first phase reduces substantially the size …

Abstract The Set Covering Problem is a formal model for many practical optimization
problems. It consists in finding a subset of columns in a zero–one matrix such that they cover …