Abstract

Social insect colonies have evolved collective foraging strategies that consist of many autonomous individuals operating without centralized control. The ant colony optimization (ACO) family of algorithms mimics this behavior to approximate solutions to computationally difficult problems. ACO algorithms focus on pheromone recruitment, which is only one of several known biological foraging strategies. Here, we use a spatial agent-based model to simulate three foraging strategies: pheromone recruitment, nest recruitment, and random search. We compare their performance across two environmental dimensions: spatial distribution of food resources and resource volatility. We find that pheromone recruitment performs only marginally better than the simpler nest recruitment strategy in most environments. Further, both strategies become progressively less efficient as resource dispersion and volatility increase. In the extreme, with highly dispersed or volatile resources, the simplest strategy of all, random search, outperforms the other two. Our results suggest that in many environments, pheromone-based strategies may not be required and that simpler methods like random search or nest recruitment may be sufficient, both for biological ants and computational methods.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.