Sistema de Biblioteca
An ant-based solver for subset problems
DSpace/Manakin Repository
Search DSpace
- DSpace Home
- →
- Colecciones Institucionales
- →
- Artículos Científicos
- →
- Ciencias de la Vida
- →
- View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.
An ant-based solver for subset problems
Disponible vía
Disponible vía
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.
Files in this item
| Files | Size | Format | View |
|---|---|---|---|
|
There are no files associated with this item. |
|||