Computational Model Library

Displaying 6 of 6 results ants clear search

Peer reviewed Ants Digging Networks

Elske van der Vaart | Published Friday, September 14, 2018

This is a NetLogo version of Buhl et al.’s (2005) model of self-organised digging activity in ant colonies. It was built for a master’s course on self-organisation and its intended use is still educational. The ants’ behavior can easily be changed by toggling switches on the interface, or, for more advanced students, there is R code included allowing the model to be run and analysed through RNetLogo.

Peer reviewed Umwelten Ants

Kit Martin | Published Thursday, January 15, 2015 | Last modified Thursday, August 27, 2015

Simulates impacts of ants killing colony mates when in conflict with another nest. The murder rate is adjustable, and the environmental change is variable. The colonies employ social learning so knowledge diffusion proceeds if interactions occur.

Ant Colony Optimization for infrastructure routing

P W Heijnen Emile Chappin Igor Nikolic | Published Wednesday, March 05, 2014 | Last modified Saturday, March 24, 2018

The mode implements a variant of Ant Colony Optimization to explore routing on infrastructures through a landscape with forbidden zones, connecting multiple sinks to one source.

Ants in the genus Temnothorax use tandem runs (rather than pheromone trails) to recruit to food sources. This model explores the collective consequences of this linear recruitment (as opposed to highly nonlinear pheromone trails).

The model explores how two types of information - social (in the form of pheromone trails) and private (in the form of route memories) affect ant colony level foraging in a variable enviroment.

Positive feedback can lead to “trapping” in local optima. Adding a simple negative feedback effect, based on ant behaviour, prevents this trapping

This website uses cookies and Google Analytics to help us track user engagement and improve our site. If you'd like to know more information about what data we collect and why, please see our data privacy policy. If you continue to use this site, you consent to our use of cookies.
Accept