Self-adaptive Cooperation Scheme in a Parallel ACO Algorithm for Binary Combinatorial Problems
Use este enlace para citar
http://hdl.handle.net/2183/34242
A non ser que se indique outra cousa, a licenza do ítem descríbese como Attribution 4.0 International (CC BY 4.0)
Metadatos
Mostrar o rexistro completo do ítemTítulo
Self-adaptive Cooperation Scheme in a Parallel ACO Algorithm for Binary Combinatorial ProblemsData
2023Resumo
[Abstract] The ant colony optimization (ACO) is widely used for combinatorial optimization
problems, although it can suffer from fast convergence to local minima. In order to provide a
versatile implementation of ACO, we present a parallel multicolony strategy with an improved
cooperation scheme for binary combinatorial problems. Our proposal is based on a self-adaptive
method, which assigns appropriate run-time cooperation levels to each problem based on its size
and available computational resources. We evaluate this proposal with problems with different
levels of cooperation and number of processes. All these configurations combined show its flexibility
as a versatile solver for this type of problems
Palabras chave
Problemas combinatorios binarios
Algoritmos de optimización
Algoritmos de optimización
Descrición
Cursos e Congresos, C-155
Versión do editor
Dereitos
Attribution 4.0 International (CC BY 4.0)