A full process algebraic representation of Ant Colony Optimization

Abstract

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.

This paper was published in Information Sciences. The present version is the author's accepted manuscript

References in corpus (1)

• Generalization and Completeness of Stochastic Local Search Algorithms