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
N1 - Publisher Copyright:
© 2015 AISTI.
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.
T2 - 10th Iberian Conference on Information Systems and Technologies, CISTI 2015
Y2 - 17 June 2015 through 20 June 2015
ER -