For years, extensive research has been in the binarization of continuous metaheuristics for
solving binary-domain combinatorial problems. This paper is a continuation of a previous …

In this paper, the optimization of Capacitated Vehicle Routing Problem with Alternative
Delivery, Pick-up and Time windows is considered. The development of this problem was …

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 …

Nature-inspired algorithms are commonly used for solving the various optimization
problems. In past few decades, various researchers have proposed a large number of …

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 …

The binarization of continuous swarm-intelligence metaheuristics is an area of great interest
in operational research. This interest is mainly due to the application of binarized …

Evolutionary algorithms have been used to solve several optimization problems, showing an
efficient performance. Nevertheless, when these algorithms are applied they present the …

Abstract Human Learning Optimization (HLO) is an emerging meta-heuristic with promising
potential, which is inspired by human learning mechanisms. Although binary algorithms like …

Method: One of the main problems which we turn out to be faced on having used
metaheuristic is the difficulty of realizing a correct parametrization with the purpose to find …