Our mission is to help computational modelers at all levels engage in the establishment and adoption of community standards and good practices for developing and sharing computational models. Model authors can freely publish their model source code in the Computational Model Library alongside narrative documentation, open science metadata, and other emerging open science norms that facilitate software citation, reproducibility, interoperability, and reuse. Model authors can also request peer review of their computational models to receive a DOI.
All users of models published in the library must cite model authors when they use and benefit from their code.
We also maintain a curated database of over 7500 publications of agent-based and individual based models with additional detailed metadata on availability of code and bibliometric information on the landscape of ABM/IBM publications that we welcome you to explore.
Displaying 10 of 31 results genetic clear
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.
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”.
This model simulates the mechanisms of evolution, or how allele frequencies change in a population over time.
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”
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.
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.
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 Repast Simphony model simulates genomic admixture during the farming expansion of human groups from mainland Asia into the Papuan dominated islands of Southeast Asia during the Neolithic period.
Model of shifting cultivation. All parameters can be controlled by the user or the model can be run in adaptive mode, in which agents innovate and select parameters.
Displaying 10 of 31 results genetic clear