A binary cuckoo search algorithm for solving the set covering problem

Soto R.; Crawford B.; Olivares R.; Barraza J.; Johnson F.; Paredes F.

dc.contributor.author	Soto R.
dc.contributor.author	Crawford B.
dc.contributor.author	Olivares R.
dc.contributor.author	Barraza J.
dc.contributor.author	Johnson F.
dc.contributor.author	Paredes F.
dc.date.accessioned	2020-09-02T22:28:42Z
dc.date.available	2020-09-02T22:28:42Z
dc.date.issued	2015
dc.identifier	10.1007/978-3-319-18833-1_10
dc.identifier.citation	9108, , 88-97
dc.identifier.issn	03029743
dc.identifier.uri	https://hdl.handle.net/20.500.12728/6318
dc.description	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. © Springer International Publishing Switzerland 2015
dc.language.iso	en
dc.publisher	Springer Verlag
dc.source	Alvarez-Sanchez J.R.de la Paz Lopez F.Adeli H.Vicente J.M.F.Toledo-Moreo F.J.
dc.subject	Cuckoo Search
dc.subject	Metaheuristics
dc.subject	Set Covering Problem
dc.subject	Algorithms
dc.subject	Computational complexity
dc.subject	Learning algorithms
dc.subject	Optimization
dc.subject	Binary cuckoo searches
dc.subject	Classical optimization
dc.subject	Cuckoo search algorithms
dc.subject	Cuckoo searches
dc.subject	Global optimum
dc.subject	Meta heuristics
dc.subject	Rapid convergence
dc.subject	Set covering problem
dc.subject	Problem solving
dc.title	A binary cuckoo search algorithm for solving the set covering problem
dc.type	Conference Paper

Ficheros en el ítem

Nombre:: item_2-s2.0-84937684855.pdf
Tamaño:: 2.300Kb
Formato:: PDF

Ver/

Este ítem aparece en la(s) siguiente(s) colección(ones)

Artículos científicos

Mostrar el registro sencillo del ítem

Repositorio Académico

A binary cuckoo search algorithm for solving the set covering problem

Ficheros en el ítem

Este ítem aparece en la(s) siguiente(s) colección(ones)

Ítems relacionados

Solving pre-processed set covering problems via cuckoo search and lévy flights [Resolviendo Problemas Pre-Procesados de Cobertura de Conjuntos vía Cuckoo Search y Lévy Flight] (2020) ﻿

Recent harmony search algorithms for 0–1 optimization problems (2020) ﻿

The set covering problem solved by the binary teaching-learning-based optimization algorithm [Problema del Conjunto de Cobertura Resuelto Mediante el Algoritmo Binario de Optimización Basado en Enseñanza- Aprendizaje] (2020) ﻿

Solving pre-processed set covering problems via cuckoo search and lévy flights [Resolviendo Problemas Pre-Procesados de Cobertura de Conjuntos vía Cuckoo Search y Lévy Flight] (2020)

Recent harmony search algorithms for 0–1 optimization problems (2020)

The set covering problem solved by the binary teaching-learning-based optimization algorithm [Problema del Conjunto de Cobertura Resuelto Mediante el Algoritmo Binario de Optimización Basado en Enseñanza- Aprendizaje] (2020)