| Autor |
dc.contributor.author |
Crawford B. |
|
| Autor |
dc.contributor.author |
Castro C. |
|
| Autor |
dc.contributor.author |
Monfroy E. |
|
| Fecha Ingreso |
dc.date.accessioned |
2014-04-05T00:15:33Z |
|
| Fecha Disponible |
dc.date.available |
2014-04-05T00:15:33Z |
|
| Fecha en Repositorio |
dc.date.issued |
2014-04-04 |
|
|
dc.identifier |
10.1109/ACT.2009.74 |
|
|
dc.description.abstract |
Subset Problems are models for many important applications in the field of Operational Research. In this paper, we solve some benchmarks of the Set Partitioning Problem with an Ant-based algorithm using a transition rule with a lookahead mechanism. It was incorporated to check constraint consistency in each iteration. Computational results are presented showing the advantages to use this additional mechanism to Ant Colony Optimization. © 2009 IEEE. |
en_US |
|
dc.source |
ACT 2009 - International Conference on Advances in Computing, Control and Telecommunication Technologies |
|
| Link Descarga |
dc.source.uri |
http://www.scopus.com/inward/record.url?eid=2-s2.0-77949306128&partnerID=40&md5=3df5d995bd1613a2b6e329a98649e51b |
|
| Title |
dc.title |
An ant-based solver for subset problems |
en_US |
| Tipo |
dc.type |
Conference Paper |
|
|
dc.description.keywords |
Ant-colony optimization; Computational results; Constraint consistency; Look-ahead; Operational research; Set partitioning problem; Transition rule; Optimization; Communication channels (information theory) |
en_US |