A XOR-based ABC algorithm for solving set covering problems

Ricardo Soto, Broderick Crawford, Sebastián Lizama, Franklin Johnson, Fernando Paredes

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

1 Cita (Scopus)

Resumen

The set covering problem is a classical problem in the subject of combinatorial optimization that consists in finding a set of solutions that cover a range of needs at the lowest possible cost. The literature reports various techniques to solve this problem, ranging from exact algorithms to approximate methods. In this paper, we present a new XOR-based artificial bee colony algorithm for solving set covering problems. We integrate a XOR operator to binarize the solution construction in order to cope with the binary nature of set covering problems. We also incorporate pre-processing phases and dynamic ABC parameters so as to improve solving time. We report interesting and competitive experimental results on a set of 65 benchmarks from the Beasley’s OR-Library.

Idioma originalInglés
Título de la publicación alojadaThe 1st International Conference on Advanced Intelligent System and Informatics, AISI 2015
EditoresAboul Ella Hassanien, Nashwa El-Bendary, Tarek Gaber, Nilanjan Dey
EditorialSpringer Verlag
Páginas209-218
Número de páginas10
ISBN (versión impresa)9783319266886
DOI
EstadoPublicada - 2016
Publicado de forma externa
Evento1st International Conference on Advanced Intelligent System and Informatics, AISI 2015 - Beni Suef, Egipto
Duración: 28 nov 201530 nov 2015

Serie de la publicación

NombreAdvances in Intelligent Systems and Computing
Volumen407
ISSN (versión impresa)2194-5357

Conferencia

Conferencia1st International Conference on Advanced Intelligent System and Informatics, AISI 2015
País/TerritorioEgipto
CiudadBeni Suef
Período28/11/1530/11/15

Huella

Profundice en los temas de investigación de 'A XOR-based ABC algorithm for solving set covering problems'. En conjunto forman una huella única.

Citar esto