Resolviendo Problemas Pre-Procesados de Cobertura de Conjuntos vía Cuckoo Search y Lévy Flight

Ricardo Soto; Broderick Crawford; Jorge Barraza; Franklin Johnson; Fernando Paredes

doi:10.1109/CISTI.2015.7170589

Resolviendo Problemas Pre-Procesados de Cobertura de Conjuntos vía Cuckoo Search y Lévy Flight

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

Resultado de la investigación: Capítulo del libro/informe/acta de congreso › Contribución a la conferencia › revisión exhaustiva

2 Citas (Scopus)

Resumen

Cuckoo search is a modern bio-inspired metaheuristic that has successfully been used to solve different real world optimization problems. In particular, it has exhibited rapid convergence reaching considerable good results. In this paper, we employ this technique to solve the set covering problem, which is a well-known optimization benchmark. We illustrate interesting experimental results where the proposed algorithm is able to obtain several global optimums for different set covering instances from the OR-Library.

Título traducido de la contribución	Solving pre-processed set covering problems via cuckoo search and lévy flights
Idioma original	Español
Título de la publicación alojada	2015 10th Iberian Conference on Information Systems and Technologies, CISTI 2015
Editorial	Institute of Electrical and Electronics Engineers Inc.
ISBN (versión digital)	9789899843455
DOI	https://doi.org/10.1109/CISTI.2015.7170589
Estado	Publicada - 28 jul. 2015
Publicado de forma externa	Sí
Evento	10th Iberian Conference on Information Systems and Technologies, CISTI 2015 - Aveiro, Portugal Duración: 17 jun. 2015 → 20 jun. 2015

Serie de la publicación

Nombre	2015 10th Iberian Conference on Information Systems and Technologies, CISTI 2015

Conferencia

Conferencia	10th Iberian Conference on Information Systems and Technologies, CISTI 2015
País/Territorio	Portugal
Ciudad	Aveiro
Período	17/06/15 → 20/06/15

Palabras clave

Artificial Intelligence
Bio-Inspired Models
Set Covering Problem

Acceder al documento

10.1109/CISTI.2015.7170589

Otros archivos y enlaces

Enlace a la publicación en Scopus

Citar esto

Soto, R., Crawford, B., Barraza, J., Johnson, F., & Paredes, F. (2015). Resolviendo Problemas Pre-Procesados de Cobertura de Conjuntos vía Cuckoo Search y Lévy Flight. En 2015 10th Iberian Conference on Information Systems and Technologies, CISTI 2015 [7170589] (2015 10th Iberian Conference on Information Systems and Technologies, CISTI 2015). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/CISTI.2015.7170589

Soto, Ricardo ; Crawford, Broderick ; Barraza, Jorge et al. / Resolviendo Problemas Pre-Procesados de Cobertura de Conjuntos vía Cuckoo Search y Lévy Flight. 2015 10th Iberian Conference on Information Systems and Technologies, CISTI 2015. Institute of Electrical and Electronics Engineers Inc., 2015. (2015 10th Iberian Conference on Information Systems and Technologies, CISTI 2015).

@inproceedings{ced08cdc5d61425cbf01e48a0bc8227b,

title = "Resolviendo Problemas Pre-Procesados de Cobertura de Conjuntos v{\'i}a Cuckoo Search y L{\'e}vy Flight",

abstract = "Cuckoo search is a modern bio-inspired metaheuristic that has successfully been used to solve different real world optimization problems. In particular, it has exhibited rapid convergence reaching considerable good results. In this paper, we employ this technique to solve the set covering problem, which is a well-known optimization benchmark. We illustrate interesting experimental results where the proposed algorithm is able to obtain several global optimums for different set covering instances from the OR-Library.",

keywords = "Artificial Intelligence, Bio-Inspired Models, Set Covering Problem",

author = "Ricardo Soto and Broderick Crawford and Jorge Barraza and Franklin Johnson and Fernando Paredes",

note = "Publisher Copyright: {\textcopyright} 2015 AISTI.; null ; Conference date: 17-06-2015 Through 20-06-2015",

year = "2015",

month = jul,

day = "28",

doi = "10.1109/CISTI.2015.7170589",

language = "Spanish",

series = "2015 10th Iberian Conference on Information Systems and Technologies, CISTI 2015",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

booktitle = "2015 10th Iberian Conference on Information Systems and Technologies, CISTI 2015",

}

Soto, R , Crawford, B, Barraza, J, Johnson, F & Paredes, F 2015, Resolviendo Problemas Pre-Procesados de Cobertura de Conjuntos vía Cuckoo Search y Lévy Flight. En 2015 10th Iberian Conference on Information Systems and Technologies, CISTI 2015., 7170589, 2015 10th Iberian Conference on Information Systems and Technologies, CISTI 2015, Institute of Electrical and Electronics Engineers Inc., 10th Iberian Conference on Information Systems and Technologies, CISTI 2015, Aveiro, Portugal, 17/06/15. https://doi.org/10.1109/CISTI.2015.7170589

Resolviendo Problemas Pre-Procesados de Cobertura de Conjuntos vía Cuckoo Search y Lévy Flight. / Soto, Ricardo ; Crawford, Broderick; Barraza, Jorge et al.

2015 10th Iberian Conference on Information Systems and Technologies, CISTI 2015. Institute of Electrical and Electronics Engineers Inc., 2015. 7170589 (2015 10th Iberian Conference on Information Systems and Technologies, CISTI 2015).

Resultado de la investigación: Capítulo del libro/informe/acta de congreso › Contribución a la conferencia › revisión exhaustiva

TY - GEN

T1 - Resolviendo Problemas Pre-Procesados de Cobertura de Conjuntos vía Cuckoo Search y Lévy Flight

AU - Soto, Ricardo

AU - Crawford, Broderick

AU - Barraza, Jorge

AU - Johnson, Franklin

AU - Paredes, Fernando

PY - 2015/7/28

Y1 - 2015/7/28

N2 - Cuckoo search is a modern bio-inspired metaheuristic that has successfully been used to solve different real world optimization problems. In particular, it has exhibited rapid convergence reaching considerable good results. In this paper, we employ this technique to solve the set covering problem, which is a well-known optimization benchmark. We illustrate interesting experimental results where the proposed algorithm is able to obtain several global optimums for different set covering instances from the OR-Library.

AB - Cuckoo search is a modern bio-inspired metaheuristic that has successfully been used to solve different real world optimization problems. In particular, it has exhibited rapid convergence reaching considerable good results. In this paper, we employ this technique to solve the set covering problem, which is a well-known optimization benchmark. We illustrate interesting experimental results where the proposed algorithm is able to obtain several global optimums for different set covering instances from the OR-Library.

KW - Artificial Intelligence

KW - Bio-Inspired Models

KW - Set Covering Problem

UR - http://www.scopus.com/inward/record.url?scp=84943338610&partnerID=8YFLogxK

U2 - 10.1109/CISTI.2015.7170589

DO - 10.1109/CISTI.2015.7170589

M3 - Conference contribution

AN - SCOPUS:84943338610

T3 - 2015 10th Iberian Conference on Information Systems and Technologies, CISTI 2015

BT - 2015 10th Iberian Conference on Information Systems and Technologies, CISTI 2015

PB - Institute of Electrical and Electronics Engineers Inc.

Y2 - 17 June 2015 through 20 June 2015

ER -

Soto R , Crawford B, Barraza J, Johnson F, Paredes F. Resolviendo Problemas Pre-Procesados de Cobertura de Conjuntos vía Cuckoo Search y Lévy Flight. En 2015 10th Iberian Conference on Information Systems and Technologies, CISTI 2015. Institute of Electrical and Electronics Engineers Inc. 2015. 7170589. (2015 10th Iberian Conference on Information Systems and Technologies, CISTI 2015). doi: 10.1109/CISTI.2015.7170589

Resolviendo Problemas Pre-Procesados de Cobertura de Conjuntos vía Cuckoo Search y Lévy Flight

Resumen

Serie de la publicación

Conferencia

Palabras clave

Acceder al documento

Otros archivos y enlaces

Huella

Citar esto