A binary monkey search algorithm variation for solving the set covering problem

BRODERICK CRAWFORD LABRIN, RICARDO JAVIER SOTO DE GIORGIS, Rodrigo Olivares, Gabriel Embry, Diego Flores, WENCESLAO ENRIQUE PALMA MUÑOZ, Carlos Castro, Fernando Paredes, José Miguel Rubio

Resultado de la investigación: Contribución a una revistaArtículorevisión exhaustiva

3 Citas (Scopus)

Resumen

In complexity theory, there is a widely studied grouping of optimization problems that belongs to the non-deterministic polynomial-time hard set. One of them is the set covering problem, known as one of Karp’s 21 NP-complete problems, and it consists of finding a subset of decision variables for satisfying a set of constraints at the minimum feasible cost. However, due to the nature of the problem, this cannot be solved using traditional complete algorithms for hard instances. In this work, we present an improved binary version of the monkey search algorithm for solving the set covering problem. Originally, this approximate method was naturally inspired by the cognitive behavior of monkeys for climbing mountains. We propose a new climbing process with a better exploratory capability and a new cooperation procedure to reduce the number of unfeasible solutions. For testing this approach, we present a detailed computational results section, where we illustrate how this variation of the monkey search algorithm is capable of reaching various global optimums for a well-known instance set from the Beasley’s OR-Library and how it outperforms many other heuristics and meta-heuristics addressed in the literature. Moreover, we add a complete statistical analysis to show the effectiveness of the proposed approach with respect to the original version.

Idioma originalInglés
PublicaciónNatural Computing
DOI
EstadoPublicada - 1 ene 2019

Huella Profundice en los temas de investigación de 'A binary monkey search algorithm variation for solving the set covering problem'. En conjunto forman una huella única.

Citar esto