Self-adaptive Cooperation Scheme in a Parallel ACO Algorithm for Binary Combinatorial Problems
![Thumbnail](/dspace/bitstream/handle/2183/34242/XoveTIC_2023_proceedings_Parte12.pdf.jpg?sequence=5&isAllowed=y)
Use this link to cite
http://hdl.handle.net/2183/34242
Except where otherwise noted, this item's license is described as Attribution 4.0 International (CC BY 4.0)
Metadata
Show full item recordTitle
Self-adaptive Cooperation Scheme in a Parallel ACO Algorithm for Binary Combinatorial ProblemsDate
2023Abstract
[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
Keywords
Problemas combinatorios binarios
Algoritmos de optimización
Algoritmos de optimización
Description
Cursos e Congresos, C-155
Editor version
Rights
Attribution 4.0 International (CC BY 4.0)