Computational Model Library

Peer reviewed Evolution of Sex

Kristin Crouse | Published Sun Jun 5 08:24:01 2016 | Last modified Mon Feb 15 15:40:39 2021

Evolution of Sex is a NetLogo model that illustrates the advantages and disadvantages of sexual and asexual reproductive strategies. It seeks to demonstrate the answer to the question “Why do we have sex?”

Change and Senescence

André Martins | Published Tue Nov 10 20:28:59 2020

Agers and non-agers agent compete over a spatial landscape. When two agents occupy the same grid, who will survive is decided by a random draw where chances of survival are proportional to fitness. Agents have offspring each time step who are born at a distance b from the parent agent and the offpring inherits their genetic fitness plus a random term. Genetic fitness decreases with time, representing environmental change but effective non-inheritable fitness can increase as animals learn and get bigger.

A minimal genetic algorithm was preliminarily developed to search for the solution of an elementary arithmetic problem. It has been modified to explore the effect of a mutator gene and the consequent entrance into a hypermutation state. The phenomenon is particularly important in some types of tumorigenesis and in a more general way, in cells and tissues submitted to chronic sublethal environmental or genomic stress.
Since a long time, some scholars suppose that organisms speed up their own evolution by varying mutation rate, but evolutionary biologists are not convinced that evolution can select a mechanism promoting more (often harmful) mutations looking forward an environmental challenge. The aim of the model is to shed light on these controversial points of views.

Peer reviewed MGA - Minimal Genetic Algorithm

Cosimo Leuci | Published Tue Sep 3 07:52:29 2019 | Last modified Thu Jan 30 08:42:08 2020

Genetic algorithms try to solve a computational problem following some principles of organic evolution. This model has educational purposes; it can give us an answer to the simple arithmetic problem on how to find the highest natural number composed by a given number of digits. We approach the task using a genetic algorithm, where the candidate solutions to the problem are represented by agents, that in logo programming environment are usually known as “turtles”.

Peer reviewed Population Genetics

Kristin Crouse | Published Thu Feb 8 22:07:51 2018 | Last modified Wed Sep 9 03:31:32 2020

This model simulates the mechanisms of evolution, or how allele frequencies change in a population over time.

Peer reviewed Flibs'NLogo - An elementary form of evolutionary cognition

Cosimo Leuci | Published Thu Jan 30 08:34:19 2020

Flibs’NLogo implements in NetLogo modelling environment, a genetic algorithm whose purpose is evolving a perfect predictor from a pool of digital creatures constituted by finite automata or flibs (finite living blobs) that are the agents of the model. The project is based on the structure described by Alexander K. Dewdney in “Exploring the field of genetic algorithms in a primordial computer sea full of flibs” from the vintage Scientific American column “Computer Recreations”
As Dewdney summarized: “Flibs […] attempt to predict changes in their environment. In the primordial computer soup, during each generation, the best predictor crosses chromosomes with a randomly selected flib. Increasingly accurate predictors evolve until a perfect one emerges. A flib […] has a finite number of states, and for each signal it receives (a 0 or a 1) it sends a signal and enters a new state. The signal sent by a flib during each cycle of operation is its prediction of the next signal to be received from the environment”

00b SimEvo_V5.08 NetLogo

Garvin Boyle | Published Sat Oct 5 08:29:38 2019

In 1985 Dr Michael Palmiter, a high school teacher, first built a very innovative agent-based model called “Simulated Evolution” which he used for teaching the dynamics of evolution. In his model, students can see the visual effects of evolution as it proceeds right in front of their eyes. Using his schema, small linear changes in the agent’s genotype have an exponential effect on the agent’s phenotype. Natural selection therefore happens quickly and effectively. I have used his approach to managing the evolution of competing agents in a variety of models that I have used to study the fundamental dynamics of sustainable economic systems. For example, here is a brief list of some of my models that use “Palmiter Genes”:
- ModEco - Palmiter genes are used to encode negotiation strategies for setting prices;
- PSoup - Palmiter genes are used to control both motion and metabolic evolution;
- TpLab - Palmiter genes are used to study the evolution of belief systems;
- EffLab - Palmiter genes are used to study Jevon’s Paradox, EROI and other things.

Agent-Based Computational Model of the cryptocurrency Bitcoin with a realistic market and transaction system. Bitcoin’s transaction limit (i.e. block size) and Bitcoin generation can be calibrated and optimized for wealth and network’s hashing power by the Non-Dominated Sorted Genetic Algorithm - II.

A test-bed ecological model

Bruce Edmonds | Published Sun May 4 13:22:47 2014 | Last modified Wed May 15 14:18:58 2019

This is a multi-patch meta-population ecological model. It intended as a test-bed in which to test the impact of humans with different kinds of social structure.

Peer reviewed lgm_ecodynamics

Colin Wren | Published Mon Apr 22 20:46:09 2019

This is a modification of a model published previous by Barton and Riel-Salvatore (2012). In this model, we simulate six regional populations within Last Glacial Maximum western Europe. Agents interact through reproduction and genetic markers attached to each of six regions mix through subsequent generations as a way to track population dynamics, mobility, and gene flow. In addition, the landscape is heterogeneous and affects agent mobility and, under certain scenarios, their odds of survival.

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.