Self-adaptive Cooperation Scheme in a Parallel ACO Algorithm for Binary Combinatorial Problems
Universidade da Coruña, Servizo de Publicacións, 2023
Online
Konferenz
Zugriff:
Cursos e Congresos, C-155 ; [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 ; Xunta de Galicia; ED431G 2019/01 ; Xunta de Galicia; ED431C 2021/30 ; RPR, PGG and RDB acknowledges funding from Grants PID2019-104184RB-I00 and PID2022-136435NB-I00, funded by MCIN/AEI/ 10.13039/501100011033, PID2022 also funded by ”ERDF. A way of making Europe”, EU; Xunta de Galicia and FEDER funds of the EU (Centro de Investigación de Galicia accreditation 2019–2022, ref. ED431G 2019/01; Consolidation Program of Competitive Reference Groups, ref. ED431C 2021/30). JRB acknowledges funding from the Ministry of Science and Innovation of Spain MCIN /AEI / 10.13039/501100011033 through grant PID2020-117271RB- C22 (BIODYNAMICS). Authors also acknowledge the Galician Supercomputing Center (CESGA) for the access to its facilities
Titel: |
Self-adaptive Cooperation Scheme in a Parallel ACO Algorithm for Binary Combinatorial Problems
|
---|---|
Autor/in / Beteiligte Person: | Prado-Rodríguez, Roberto ; González, Patricia ; Banga, Julio R. ; Doallo, Ramón |
Link: | |
Veröffentlichung: | Universidade da Coruña, Servizo de Publicacións, 2023 |
Medientyp: | Konferenz |
DOI: | 10.17979/spudc.000024.12 |
Schlagwort: |
|
Sonstiges: |
|