Using the Bee Colony Optimization Method to Solve the Weighted Set Covering Problem

Broderick Crawford, Ricardo Soto, Rodrigo Cuesta, Fernando Paredes

Resultado de la investigación: Capítulo del libro/informe/acta de congresoContribución a la conferenciarevisión exhaustiva

10 Citas (Scopus)

Resumen

The Weighted Set Covering Problem is a formal model for many practical optimization problems. In this problem the goal is to choose a subset of columns of minimal cost covering every row. Here, we present a novel application of the Artificial Bee Colony algorithm to solve the Weighted Set Covering Problem. The Artificial Bee Colony algorithm is a recent Swarm Metaheuristic technique based on the intelligent foraging behavior of honey bees. Experimental results show that our Artificial Bee Colony algorithm is competitive in terms of solution quality with other recent metaheuristic approaches.

Idioma originalInglés
Título de la publicación alojadaHCI International 2014 - Posters' Extended Abstracts - International Conference, HCI International 2014, Proceedings
EditorialSpringer Verlag
Páginas493-497
Número de páginas5
ISBN (versión impresa)9783319078564
DOI
EstadoPublicada - 2014
Publicado de forma externa

Serie de la publicación

NombreCommunications in Computer and Information Science
Volumen434 PART I
ISSN (versión impresa)1865-0929

Huella

Profundice en los temas de investigación de 'Using the Bee Colony Optimization Method to Solve the Weighted Set Covering Problem'. En conjunto forman una huella única.

Citar esto