A binary cuckoo search algorithm for solving the set covering problem

Ricardo Soto, Broderick Crawford, Rodrigo Olivares, Jorge Barraza, Franklin Johnson, Fernando Paredes

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

25 Citas (Scopus)

Resumen

The non-unicost set covering problem is a classical optimization benchmark that belongs to the Karp’s 21 NP-complete problems. In this paper, we present a new approach based on cuckoo search for solving such problem. Cuckoo search is a modern nature-inspired metaheuristic that has attracted much attention due to its rapid convergence and easy implementation. We illustrate interesting experimental results where the proposed cuckoo search algorithm reaches several global optimums for the non-unicost instances from the OR-Library.

Idioma originalInglés
Título de la publicación alojadaBioinspired Computation in Artificial Systems - International Work-Conference on the Interplay Between Natural and Artificial Computation, IWINAC 2015, Proceedings
EditoresJosé Ramón Álvarez-Sánchez, Félix de la Paz López, Hojjat Adeli, José Manuel Ferrández Vicente, Fco. Javier Toledo-Moreo
EditorialSpringer Verlag
Páginas88-97
Número de páginas10
ISBN (versión digital)9783319188324
DOI
EstadoPublicada - 2015
Publicado de forma externa
EventoInternational Work-Conference on the Interplay Between Natural and Artificial Computation, IWINAC 2015 - Elche, Espana
Duración: 1 jun. 20155 jun. 2015

Serie de la publicación

NombreLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volumen9108
ISSN (versión impresa)0302-9743
ISSN (versión digital)1611-3349

Conferencia

ConferenciaInternational Work-Conference on the Interplay Between Natural and Artificial Computation, IWINAC 2015
País/TerritorioEspana
CiudadElche
Período1/06/155/06/15

Huella

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

Citar esto