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...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Crawford, Broderick, Castro, Carlos
Formato: Objeto de conferencia
Lenguaje:Inglés
Publicado: 2006
Materias:
Ciencias Informáticas
Benchmarks
Ant Colony Optimization (ACO
Arc Consistency
Acceso en línea:http://sedici.unlp.edu.ar/handle/10915/24244
Aporte de:
SEDICI (UNLP) de Universidad Nacional de La Plata
id I19-R120-10915-24244
record_format dspace
institution Universidad Nacional de La Plata
institution_str I-19
repository_str R-120
collection SEDICI (UNLP)
language Inglés
topic Ciencias Informáticas
Benchmarks
Ant Colony Optimization (ACO
Arc Consistency
spellingShingle Ciencias Informáticas
Benchmarks
Ant Colony Optimization (ACO
Arc Consistency
Crawford, Broderick
Castro, Carlos
Ant colonies using arc consistency techniques for the set partitioning problem
topic_facet Ciencias Informáticas
Benchmarks
Ant Colony Optimization (ACO
Arc Consistency
description 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 based on Arc Consistency. The concept of Arc Consistency plays an essential role in constraint satisfaction as a problem simplification operation and as a tree pruning technique during search through the detection of local inconsistencies with the uninstantiated variables. In the proposed hybrid algorithms, we explore the addition of this mechanism in the construction phase of the ants so they can generate only feasible partial solutions. Computational results are presented showing the advantages to use this kind of additional mechanisms to Ant Colony Optimization in strongly constrained problems where pure Ant Algorithms are not successful.
format Objeto de conferencia
Objeto de conferencia
author Crawford, Broderick
Castro, Carlos
author_facet Crawford, Broderick
Castro, Carlos
author_sort Crawford, Broderick
title Ant colonies using arc consistency techniques for the set partitioning problem
title_short Ant colonies using arc consistency techniques for the set partitioning problem
title_full Ant colonies using arc consistency techniques for the set partitioning problem
title_fullStr Ant colonies using arc consistency techniques for the set partitioning problem
title_full_unstemmed Ant colonies using arc consistency techniques for the set partitioning problem
title_sort ant colonies using arc consistency techniques for the set partitioning problem
publishDate 2006
url http://sedici.unlp.edu.ar/handle/10915/24244
work_keys_str_mv AT crawfordbroderick antcoloniesusingarcconsistencytechniquesforthesetpartitioningproblem
AT castrocarlos antcoloniesusingarcconsistencytechniquesforthesetpartitioningproblem
bdutipo_str Repositorios
_version_ 1764820466816516097

Ejemplares similares