A full process algebraic representation of Ant Colony Optimization
Loading...
Full text at PDC
Publication date
2023
Advisors (or tutors)
Editors
Journal Title
Journal ISSN
Volume Title
Publisher
Elsevier
Citations
Exportar
Citation
García, M.; López, N.; Rodríguez, I. A Full Process Algebraic Representation of Ant Colony Optimization. Information Sciences 2024, 658. https://doi.org/10.1016/j.ins.2023.120025.
Abstract
We present a process algebra capable of specifying parallelized Ant Colony Optimization algorithms in full detail: PA2CO. After explaining the basis of three different ACO algorithms (Ant System, MAX-MIN Ant System, and Ant Colony System), we formally define PA2CO and use it for representing several types of implementations with different parallel schemes. In particular fine-grained and coarse-grained specifications, each one taking advantage of parallel executions at different levels of system granularity, are formalized.
Description
2023 Acuerdos transformativos CRUE