A full process algebraic representation of Ant Colony Optimization
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...
| Autores: | , , |
|---|---|
| Tipo de recurso: | artículo |
| Fecha de publicación: | 2023 |
| País: | España |
| Institución: | Universidad Complutense de Madrid (UCM) |
| Repositorio: | Docta Complutense |
| Idioma: | inglés |
| OAI Identifier: | oai:docta.ucm.es:20.500.14352/103826 |
| Acceso en línea: | https://hdl.handle.net/20.500.14352/103826 |
| Access Level: | acceso abierto |
| Palabra clave: | 004(043.3) Ant Colony Optimization Swarm intelligence Process algebras Formal methods Informática (Informática) 33 Ciencias Tecnológicas |
| Sumario: | 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. |
|---|