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

Translated title of the contribution: Solving pre-processed set covering problems via cuckoo search and lévy flights

RICARDO JAVIER SOTO DE GIORGIS, BRODERICK CRAWFORD LABRIN, Jorge Barraza, Franklin Johnson, Fernando Paredes

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations

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.

Translated title of the contributionSolving pre-processed set covering problems via cuckoo search and lévy flights
Original languageSpanish
Title of host publication2015 10th Iberian Conference on Information Systems and Technologies, CISTI 2015
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9789899843455
DOIs
StatePublished - 28 Jul 2015
Event10th Iberian Conference on Information Systems and Technologies, CISTI 2015 - Aveiro, Portugal
Duration: 17 Jun 201520 Jun 2015

Publication series

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

Conference

Conference10th Iberian Conference on Information Systems and Technologies, CISTI 2015
CountryPortugal
CityAveiro
Period17/06/1520/06/15

Fingerprint Dive into the research topics of 'Solving pre-processed set covering problems via cuckoo search and lévy flights'. Together they form a unique fingerprint.

Cite this