A full process algebraic representation of Ant Colony Optimization

2023-12-01

Information Sciences

AI Summary

This study addresses the lack of a systematic formal description for parallel implementations of ant colony optimization (ACO) algorithms. To this end, it proposes PA²CO, a dedicated process algebra that establishes, for the first time, a unified formal framework supporting both fine-grained and coarse-grained parallelism. This framework precisely captures the full lifecycle behavior of canonical ACO algorithms—including Ant System, MAX-MIN Ant System, and Ant Colony System—as well as their parallel variants. By enabling rigorous modeling of diverse parallel ACO structures, the work not only advances the formal understanding of these algorithms but also provides a solid theoretical foundation for verifying correctness, analyzing performance, and guiding efficient implementations.

Technology Category

• Constraint Satisfaction and Optimization: Distributed CSP/Optimization
• Search and Optimization: Evolutionary Computation
• Multiagent Systems: Coordination and Collaboration

Application Category

• Graph Algorithms and Modeling for the Web: Algorithms and analysis for incomplete, noisy, or partially observed Web-related graphs
• Systems and Infrastructure for Web, Mobile and WoT: Experiences and lessons learnt from Web-based algorithms and system deployments
• Semantics and Knowledge: Methods, algorithms and applications for the development of semantic models, knowledge graphs and other forms of structured data models with machine-interpretable semantics

Problem

• Ant Colony Optimization
• process algebra
• parallelization
• formal specification
• concurrent systems

Innovation

• process algebra
• Ant Colony Optimization
• parallelization
• formal specification
• coarse-grained and fine-grained parallelism