Computational Model Library

Displaying 10 of 54 results problem clear search

The Agent-Based Model for Multiple Team Membership (ABMMTM) simulates design teams searching for viable design solutions, for a large design project that requires multiple design teams that are working simultaneously, under different organizational structures; specifically, the impact of multiple team membership (MTM). The key mechanism under study is how individual agent-level decision-making impacts macro-level project performance, specifically, wage cost. Each agent follows a stochastic learning approach, akin to simulated annealing or reinforcement learning, where they iteratively explore potential design solutions. The agent evaluates new solutions based on a random-walk exploration, accepting improvements while rejecting inferior designs. This iterative process simulates real-world problem-solving dynamics where designers refine solutions based on feedback.

As a proof-of-concept demonstration of assessing the macro-level effects of MTM in organizational design, we developed this agent-based simulation model which was used in a simulation experiment. The scenario is a system design project involving multiple interdependent teams of engineering designers. In this scenario, the required system design is split into three separate but interdependent systems, e.g., the design of a satellite could (trivially) be split into three components: power source, control system, and communication systems; each of three design team is in charge of a design of one of these components. A design team is responsible for ensuring its proposed component’s design meets the design requirement; they are not responsible for the design requirements of the other components. If the design of a given component does not affect the design requirements of the other components, we call this the uncoupled scenario; otherwise, it is a coupled scenario.

Simple models with different types of complexity

Michael Roos | Published Tuesday, September 17, 2024 | Last modified Saturday, March 01, 2025

Hierarchical problem-solving model
The model simulates a hierarchical problem-solving process in which a manager delegates parts of a problem to specialists, who attempt to solve specific aspects based on their unique skills. The goal is to examine how effectively the hierarchical structure works in solving the problem, the total cost of the process, and the resulting solution quality.

Problem-solving random network model
The model simulates a network of agents (generalists) who collaboratively solve a fixed problem by iterating over it and using their individual skills to reduce the problem’s complexity. The goal is to study the dynamics of the problem-solving process, including agent interactions, work cycles, total cost, and solution quality.

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.

HyperMu’NmGA - Effect of Hypermutation Cycles in a NetLogo Minimal Genetic Algorithm

Cosimo Leuci | Published Tuesday, October 27, 2020 | Last modified Sunday, July 31, 2022

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.

Peer reviewed MGA - Minimal Genetic Algorithm

Cosimo Leuci | Published Tuesday, September 03, 2019 | Last modified Thursday, January 30, 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 Garbage can model NetLogo implementation

Smarzhevskiy Ivan | Published Sunday, February 14, 2016 | Last modified Tuesday, July 30, 2019

It is NetLogo reconstruction of the original FORTRAN code of the classical M. Cohen, J. March, and J. Olsen “garbage can model” (GCM or CMO) of collective decision-making.

Peer reviewed Garbage can model Excel reconstruction

Smarzhevskiy Ivan | Published Tuesday, August 19, 2014 | Last modified Tuesday, July 30, 2019

Reconstruction of the original code M. Cohen, J. March, and J. Olsen garbage can model, realized by means of Microsoft Office Excel 2010

The SIM-VOLATILE model is a technology adoption model at the population level. The technology, in this model, is called Volatile Fatty Acid Platform (VFAP) and it is in the frame of the circular economy. The technology is considered an emerging technology and it is in the optimization phase. Through the adoption of VFAP, waste-treatment plants will be able to convert organic waste into high-end products rather than focusing on the production of biogas. Moreover, there are three adoption/investment scenarios as the technology enables the production of polyhydroxyalkanoates (PHA), single-cell oils (SCO), and polyunsaturated fatty acids (PUFA). However, due to differences in the processing related to the products, waste-treatment plants need to choose one adoption scenario.

In this simulation, there are several parameters and variables. Agents are heterogeneous waste-treatment plants that face the problem of circular economy technology adoption. Since the technology is emerging, the adoption decision is associated with high risks. In this regard, first, agents evaluate the economic feasibility of the emerging technology for each product (investment scenarios). Second, they will check on the trend of adoption in their social environment (i.e. local pressure for each scenario). Third, they combine these two economic and social assessments with an environmental assessment which is their environmental decision-value (i.e. their status on green technology). This combination gives the agent an overall adaptability fitness value (detailed for each scenario). If this value is above a certain threshold, agents may decide to adopt the emerging technology, which is ultimately depending on their predominant adoption probabilities and market gaps.

Peer reviewed agent-based model studying money

Juan Ocampo | Published Thursday, March 04, 2021 | Last modified Monday, March 15, 2021

1.7 billion people appear to be financially excluded. Due to the relevance of the problem, special purpose monies known as Complementary Currencies (CC) seem to be a potential solution. This doctoral project inquiries into the organising of money and its performative effects. It does so by following the communities designing CC and engineering their markets.

Reducing packaging waste is a critical challenge that requires organizations to collaborate within circular ecosystems, considering social, economic, and technical variables like decision-making behavior, material prices, and available technologies. Agent-Based Modeling (ABM) offers a valuable methodology for understanding these complex dynamics. In our research, we have developed an ABM to explore circular ecosystems’ potential in reducing packaging waste, using a case study of the Dutch food packaging ecosystem. The model incorporates three types of agents—beverage producers, packaging producers, and waste treaters—who can form closed-loop recycling systems.

Beverage Producer Agents: These agents represent the beverage company divided into five types based on packaging formats: cans, PET bottles, glass bottles, cartons, and bag-in-boxes. Each producer has specific packaging demands based on product volume, type, weight, and reuse potential. They select packaging suppliers annually, guided by deterministic decision styles: bargaining (seeking the lowest price) or problem-solving (prioritizing high recycled content).

Packaging Producer Agents: These agents are responsible for creating packaging using either recycled or virgin materials. The model assumes a mix of monopolistic and competitive market situations, with agents calculating annual material needs. Decision styles influence their choices: bargaining agents compare recycled and virgin material costs, while problem-solving agents prioritize maximum recycled content. They calculate recycled content in packaging and set prices accordingly, ensuring all produced packaging is sold within or outside the model.

Displaying 10 of 54 results problem clear search

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