Mostrar el registro sencillo del ítem

A hybrid Ant algorithm for the set covering problem

dc.contributor.authorCrawford B.
dc.contributor.authorSoto R.
dc.contributor.authorMonfroy E.
dc.contributor.authorParedes F.
dc.contributor.authorPalma W.
dc.date.accessioned2020-09-02T22:15:41Z
dc.date.available2020-09-02T22:15:41Z
dc.date.issued2011
dc.identifier.citation6, 19, 4667-4673
dc.identifier.issn19921950
dc.identifier.urihttps://hdl.handle.net/20.500.12728/4156
dc.descriptionSet covering problem is the model for many important industrial applications. In this paper, we solve some benchmarks of this problem with ant colony optimization algorithms using a new transition rule. A look-ahead mechanism was incorporated to check constraint consistency in ant computing. Computational results are presented showing the advantages to use this additional mechanism to ant system and ant colony system. © 2011 Academic Journals.
dc.language.isoen
dc.publisherAcademic Journals
dc.subjectAnt colony optimization
dc.subjectLook-ahead techniques
dc.subjectSet covering problem
dc.titleA hybrid Ant algorithm for the set covering problem
dc.typeArticle


Ficheros en el ítem

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

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

Mostrar el registro sencillo del ítem