TY - GEN
T1 - Volatility and spatial distribution of resources determine ant foraging strategies
AU - Levin, Drew
AU - Hecker, Joshua P.
AU - Moses, Melanie E.
AU - Forrest, Stephanie
N1 - Funding Information:
We thank Deborah Gordon, Ben Edwards, and Tatiana Paz-Flanagan for their feedback. This work is supported by NSF grant EF-1038682, DARPA CRASH grant P-1070-113237, the Air Force Research Laboratory, the Santa Fe Institute, and a James S. McDonnell Foundation Complex Systems Scholar Award
Publisher Copyright:
© 2015 Proceedings of the 13th European Conference on Artificial Life, ECAL 2015. All rights reserved.
PY - 2015
Y1 - 2015
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=85035101699&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85035101699&partnerID=8YFLogxK
U2 - 10.7551/978-0-262-33027-5-ch050
DO - 10.7551/978-0-262-33027-5-ch050
M3 - Conference contribution
AN - SCOPUS:85035101699
T3 - Proceedings of the 13th European Conference on Artificial Life, ECAL 2015
SP - 256
EP - 263
BT - Proceedings of the 13th European Conference on Artificial Life, ECAL 2015
PB - MIT Press Journals
T2 - 13th European Conference on Artificial Life, ECAL 2015
Y2 - 20 July 2015 through 24 July 2015
ER -