Ant colonies using arc consistency techniques for the set partitioning problem
In this paper, we solve some benchmarks of Set Covering Problem and Equality Constrained Set Covering or Set Partitioning Problem. The resolution techniques used to solve them were Ant Colony Optimization algorithms and Hybridizations of Ant Colony Optimization with Constraint Programming techniques...
Guardado en:
| Autores principales: | Crawford, Broderick, Castro, Carlos |
|---|---|
| Formato: | Objeto de conferencia |
| Lenguaje: | Inglés |
| Publicado: |
2006
|
| Materias: | |
| Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/24244 |
| Aporte de: |
Ejemplares similares
-
An ACO approach for the Parallel Machines Scheduling Problem
por: Gatica, Claudia R., et al.
Publicado: (2008) -
Current applications of ant systems for subset problems
por: Leguizamón, Guillermo
Publicado: (2000) -
An ACO model for a non-stationary formulation of the single elevator problem
por: Molina, Silvia, et al.
Publicado: (2007) -
Towards distributed reasoning for behavioral optimization
por: Cebulla, Michael
Publicado: (2006) -
Optimización de rutas en el transporte de personas para la pequeña y mediana empresa
por: Villagra, Andrea, et al.
Publicado: (2016)