In this study, we review the covering problems in facility location. Here, besides a number of
reviews on covering problems, a comprehensive review of models, solutions and …

When deciding where to locate facilities (eg, emergency points where an ambulance will
wait for a call) that provide a service, it happens quite often that a customer (eg, a person) …

Abstract The Set Covering Problem (SCP) is a main model for several important
applications, including crew scheduling in railway and mass-transit companies. In this …

The set covering problem (SCP) is a well known NP-hard problem with many practical
applications. In this research, a new approach based on ant colony optimization (ACO) is …

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 binarization of Swarm intelligence continuous metaheuristics is an area of great interest
in operations research. This interest is mainly due to the application of binarized …

The integration of machine learning techniques and metaheuristic algorithms is an area of
interest due to the great potential for applications. In particular, using these hybrid …

The set covering problem (SCP) is a fundamental NP-hard problem in computer science and
has a broad range of important real-world applications. In practice, SCP instances …

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 progress of metaheuristic techniques, big data, and the Internet of things generates
opportunities to performance improvements in complex industrial systems. This article …