The dynamics of ant colony optimization algorithms applied to binary chains

• Published in: Swarm intelligence Vol. 6; no. 4; pp. 343 - 377
• Main Authors: Iacopino, Claudio, Palmer, Phil
• Format: Journal Article
• Language: English
• Published: Boston Springer US 01.12.2012
• Subjects: Artificial Intelligence; Communications Engineering; Computer Communication Networks; Computer Science; Computer Systems Organization and Communication Networks; Mathematical and Computational Engineering; Networks; ODE; Change of stability; Parameter impact analysis; Dynamical systems; Ant colony optimization algorithm; Equilibrium point
• ISSN: 1935-3812; 1935-3820
• DOI: 10.1007/s11721-012-0074-3

In the last decade Ant Colony Optimization (ACO) algorithms have received increasing attention due to their flexibility and adaptability to different applications. Despite these advantages, their design and analysis are still critical issues; research on formal methods could increase the reliability of these systems and extend their applications to critical scenarios such as space or military. This paper aims at exploring the potential of formal modelling techniques already developed for studying dynamical systems. The benefits of these techniques are shown in the analysis of a generic ACO algorithm applied to problems modelled as binary chains. The theoretical model developed is able to give new insights on the overall system dynamics, predicting the system long-term behaviours and the influence of specific parameters on such behaviours. This paper first offers a complete stability analysis for a basic problem providing an easy description of the key concepts before generalizing the model to problems of n nodes, allowing its application to real problems. The picture of the system dynamics is then completed by a convergence time analysis, which is necessary to draw sensible conclusions.