Group Dynamics in Memory-Enhanced Ant Colonies: The Influence of Colony Division on a Maze Navigation Problem

• Published in: Algorithms Vol. 17; no. 2; p. 63
• Main Authors: Cavallaro, Claudia, Crespi, Carolina, Cutello, Vincenzo, Pavone, Mario, Zito, Francesco
• Format: Journal Article
• Language: English
• Published: Basel MDPI AG 01.02.2024
• Subjects: Agent-based models; Algorithms; Ant colony optimization; Behavior; Collaboration; Cost analysis; group cooperation and network analysis; Group dynamics; multi-objective optimization; Multiple objective analysis; Navigation; Optimization techniques; Partitioning; Pheromones; Simulation; Sociology; Traveling salesman problem; Germany
• ISSN: 1999-4893; 1999-4893
• DOI: 10.3390/a17020063

This paper introduces an agent-based model grounded in the ACO algorithm to investigate the impact of partitioning ant colonies on algorithmic performance. The exploration focuses on understanding the roles of group size and number within a multi-objective optimization context. The model consists of a colony of memory-enhanced ants (ME-ANTS) which, starting from a given position, must collaboratively discover the optimal path to the exit point within a grid network. The colony can be divided into groups of different sizes and its objectives are maximizing the number of ants that exit the grid while minimizing path costs. Three distinct analyses were conducted: an overall analysis assessing colony performance across different-sized groups, a group analysis examining the performance of each partitioned group, and a pheromone distribution analysis discerning correlations between temporal pheromone distribution and ant navigation. From the results, a dynamic correlation emerged between the degree of colony partitioning and solution quality within the ACO algorithm framework.