CoMSES Net maintains cyberinfrastructure to foster FAIR data principles for access to and (re)use of computational models. Model authors can publish their model code in the Computational Model Library with documentation, metadata, and data dependencies and support these FAIR data principles as well as best practices for software citation. Model authors can also request that their model code be peer reviewed to receive a DOI. All users of models published in the library must cite model authors when they use and benefit from their code.
CoMSES Net also maintains a curated database of over 7500 publications of agent-based and individual based models with additional metadata on availability of code and bibliometric information on the landscape of ABM/IBM publications that we welcome you to explore.
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.
The community consequences of intra-specific trait variation (ITV) are a current topic in ecological research. The effects of ITV on species coexistence have, yet, not sufficiently been understood. With this individual-based model we analyzed the effect of intra-specific variation in movement by mimicking variation found in ground-dwelling rodents and analyzing how such variation affects inter-specific differences in competitive ability (i.e. foraging efficiency) and temporary coexistence. The movement algorithm and behavioral plasticity was adapted from existing algorithms and current ecological literature. As a measure for temporary coexistence, we analyzed the time until one of the species went extinct.
The purpose of the model is to simulate the cultural hitchhiking hypothesis to explore how neutral cultural traits linked with advantageous traits spread together over time
The purpose of this model is explore how “friend-of-friend” link recommendations, which are commonly used on social networking sites, impact online social network structure. Specifically, this model generates online social networks, by connecting individuals based upon varying proportions of a) connections from the real world and b) link recommendations. Links formed by recommendation mimic mutual connection, or friend-of-friend algorithms. Generated networks can then be analyzed, by the included scripts, to assess the influence that different proportions of link recommendations have on network properties, specifically: clustering, modularity, path length, eccentricity, diameter, and degree distribution.
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?”
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.
PowerGen-ABM is an optimisation model for power plant expansions from 2010 to 2025 with Indonesian electricity systems as the case study. PowerGen-ABM integrates three approaches: techno-economic analysis (TEA), linear programming (LP), and input-output analysis (IOA) and environmental analysis. TEA is based on the revenue requirement (RR) formula by UCDavis (2016), and the environmental analysis accounts for resource consumption (i.e., steel, concrete, aluminium, and energy) and carbon dioxide equivalent (CO2e) emissions during the construction and operational stages of power plants.
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.