A full process algebraic representation of Ant Colony Optimization
Fuente:
arXiv
Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2026
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866908778888167424 |
|---|---|
| author | Garcia, Maria Lopez, Natalia Rodriguez, Ismael |
| author_facet | Garcia, Maria Lopez, Natalia Rodriguez, Ismael |
| contents | We present a process algebra capable of specifying parallelized Ant Colony Optimization algorithms in full detail: PA$^2$CO. After explaining the basis of three different ACO algorithms (Ant System, MAX-MIN Ant System, and Ant Colony System), we formally define PA$^2$CO 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2601_14436 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | A full process algebraic representation of Ant Colony Optimization Garcia, Maria Lopez, Natalia Rodriguez, Ismael Neural and Evolutionary Computing We present a process algebra capable of specifying parallelized Ant Colony Optimization algorithms in full detail: PA$^2$CO. After explaining the basis of three different ACO algorithms (Ant System, MAX-MIN Ant System, and Ant Colony System), we formally define PA$^2$CO 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. |
| title | A full process algebraic representation of Ant Colony Optimization |
| topic | Neural and Evolutionary Computing |
| url | https://arxiv.org/abs/2601.14436 |