Mostrar el registro sencillo del ítem
A hybrid Ant algorithm for the set covering problem
dc.contributor.author | Crawford B. | |
dc.contributor.author | Soto R. | |
dc.contributor.author | Monfroy E. | |
dc.contributor.author | Paredes F. | |
dc.contributor.author | Palma W. | |
dc.date.accessioned | 2020-09-02T22:15:41Z | |
dc.date.available | 2020-09-02T22:15:41Z | |
dc.date.issued | 2011 | |
dc.identifier.citation | 6, 19, 4667-4673 | |
dc.identifier.issn | 19921950 | |
dc.identifier.uri | https://hdl.handle.net/20.500.12728/4156 | |
dc.description | Set 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.iso | en | |
dc.publisher | Academic Journals | |
dc.subject | Ant colony optimization | |
dc.subject | Look-ahead techniques | |
dc.subject | Set covering problem | |
dc.title | A hybrid Ant algorithm for the set covering problem | |
dc.type | Article |