MicroAnts 2.5 is a general-purpose agent-based model designed as a flexible workhorse for simulating ecological and evolutionary dynamics in artificial populations, as well as, potentially, the emergence of political institutions and economic regimes. It builds on and extends Stephen Wright’s original MicroAnts 2.0 by introducing configurable predators, inequality tracking, and other options.
Ant agents are of two tyes/casts and controlled by 16-bit chromosomes encoding traits such as vision, movement, mating thresholds, sensing, and combat strength. Predators (anteaters) operate in static, random, or targeted predatory modes. Ants reproduce, mutate, cooperate, fight, and die based on their traits and interactions. Environmental pressures (poison and predators) and social dynamics (sharing, mating, combat) drive emergent behavior across red and black ant populations.
The model supports insertion of custom agents at runtime, configurable mutation/inversion rates, and exports detailed statistics, including inequality metrics (e.g., Gini coefficients), trait frequencies, predator kills, and lineage data. Intended for rapid testing and educational experimentation, MicroAnts 2.5 serves as a modular base for more complex ecological and social simulations.

This model illustrates the processes underlying the social construction of reality through an agent-based genetic algorithm. By simulating the interactions of agents within a structured environment, we have demonstrated how shared information and popularity contribute to the formation of emergent social structures with diverse cultures. The model illustrates how agents balance environmentally valid information with socially reliable information. It also highlights how social interaction leads to the formation of stable, yet diverse, social groups.

This study employs a hierarchical cross-departmental ABM to explore the question: How and to what extent are the land use policies enforced when assessed against the real-world land use pattern? Specifically, two sub-questions are of interest: How can real-world policy interactions be abstracted into the behavior across hierarchical governmental departments in the model? How can the level of enforcement for each land use policy be quantified under these interactions? We build three hierarchical agents—the central level, the local level that incorporates three departments, and the village collective level—with simplified but plausible processes of land use change, with levels of enforcement of different land use policies as key parameters. We calibrate the model using a genetic algorithm to determine those parameters and answer our research question. We further applied the model to simulate potential land use changes and investigate the implications of different policy options. The results are expected to provide insights into the intricate relationships shaping land use processes, contributing to evidence-based decision-making in urban planning and sustainable land use management.

According to the philosopher of science K. Popper “All life is problem solving”. Genetic algorithms aim to leverage Darwinian selection, a fundamental mechanism of biological evolution, so as to tackle various engineering challenges.
Flibs’NFarol is an Agent Based Model that embodies a genetic algorithm applied to the inherently ill-defined “El Farol Bar” problem. Within this context, a group of agents operates under bounded rationality conditions, giving rise to processes of self-organization involving, in the first place, efficiency in the exploitation of available resources. Over time, the attention of scholars has shifted to equity in resource distribution, as well. Nowadays, the problem is recognized as paradigmatic within studies of complex evolutionary systems.
Flibs’NFarol provides a platform to explore and evaluate factors influencing self-organized efficiency and fairness. The model represents agents as finite automata, known as “flibs,” and offers flexibility in modifying the number of internal flibs states, which directly affects their behaviour patterns and, ultimately, the diversity within populations and the complexity of the system.

NeoCOOP is an iteration-based ABM that uses Reinforcement Learning and Artificial Evolution as adaptive-mechanisms to simulate the emergence of resource trading beliefs among Neolithic-inspired households.

This project combines game theory and genetic algorithms in a simulation model for evolutionary learning and strategic behavior. It is often observed in the real world that strategic scenarios change over time, and deciding agents need to adapt to new information and environmental structures. Yet, game theory models often focus on static games, even for dynamic and temporal analyses. This simulation model introduces a heuristic procedure that enables these changes in strategic scenarios with Genetic Algorithms. Using normalized 2x2 strategic-form games as input, computational agents can interact and make decisions using three pre-defined decision rules: Nash Equilibrium, Hurwicz Rule, and Random. The games then are allowed to change over time as a function of the agent’s behavior through crossover and mutation. As a result, strategic behavior can be modeled in several simulated scenarios, and their impacts and outcomes can be analyzed, potentially transforming conflictual situations into harmony.

Large-scale land acquisitions (LSLAs) threaten smallholder livelihoods globally. Despite more than a decade of research on the LSLA phenomenon, it remains a challenge to identify governance conditions that may foster beneficial outcomes for both smallholders and investors. One potentially promising strategy toward this end is contract farming (CF), which more directly involves smallholder households in commodity production than conditions of acquisition and displacement.

To improve understanding of how CF may mediate the outcomes of LSLAs, we developed an agent-based model of smallholder livelihoods, which we used as a virtual laboratory to experiment on a range of hypothetical LSLA and CF implementation scenarios.

The model represents a community of smallholder households in a mixed crop-livestock system. Each agent farms their own land and manages a herd of livestock. Agents can also engage in off-farm employment, for which they earn a fixed wage and compete for a limited number of jobs. The principal model outputs include measures of household food security (representing access to a single, staple food crop) and agricultural production (of a single, staple food crop).

…

A minimal genetic algorithm was previously developed in order to solve 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 seems relevant in some types of tumorigenesis and in a more general way, in cells and tissues submitted to chronic sublethal environmental or genomic stress.
For 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 to an environmental challenge.
The model aims to shed light on these controversial points of view and it provides also the features required to check the role of sex and genetic recombination in the mutator genes diffusion.

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”

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”.