Mostrar el registro sencillo del ítem

Application of the artificial bee colony algorithm for solving the set covering problem

dc.contributor.authorCrawford B.
dc.contributor.authorSoto R.
dc.contributor.authorCuesta R.
dc.contributor.authorParedes F.
dc.date.accessioned2020-09-02T22:15:37Z
dc.date.available2020-09-02T22:15:37Z
dc.date.issued2014
dc.identifier10.1155/2014/189164
dc.identifier.citation2014, , -
dc.identifier.issn1537744X
dc.identifier.urihttps://hdl.handle.net/20.500.12728/4130
dc.descriptionThe set covering problem is a formal model for many practical optimization problems. In the set covering problem the goal is to choose a subset of the columns of minimal cost that covers every row. Here, we present a novel application of the artificial bee colony algorithm to solve the non-unicost set covering problem. The artificial bee colony algorithm is a recent swarm metaheuristic technique based on the intelligent foraging behavior of honey bees. Experimental results show that our artificial bee colony algorithm is competitive in terms of solution quality with other recent metaheuristic approaches for the set covering problem. © 2014 Broderick Crawford et al.
dc.language.isoen
dc.publisherScientificWorld Ltd.
dc.titleApplication of the artificial bee colony algorithm for solving the set covering problem
dc.typeArticle


Ficheros en el ítem

Thumbnail
Nombre:
item_2-s2.0-84900009934.pdf
Tamaño:
1.788Kb
Formato:
PDF
Ver/

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

Mostrar el registro sencillo del ítem