A full process algebraic representation of Ant Colony Optimization
Neural and Evolutionary Computing
2026-01-22 v1
Abstract
We present a process algebra capable of specifying parallelized Ant Colony Optimization algorithms in full detail: PACO. After explaining the basis of three different ACO algorithms (Ant System, MAX-MIN Ant System, and Ant Colony System), we formally define PACO 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.
Cite
@article{arxiv.2601.14436,
title = {A full process algebraic representation of Ant Colony Optimization},
author = {Maria Garcia and Natalia Lopez and Ismael Rodriguez},
journal= {arXiv preprint arXiv:2601.14436},
year = {2026}
}
Comments
This paper was published in Information Sciences. The present version is the author's accepted manuscript