Computational Model Library

Our mission is to help computational modelers develop, document, and share their computational models in accordance with community standards and good open science and software engineering practices. Model authors can publish their model source code in the Computational Model Library with narrative documentation as well as metadata that supports open science and emerging norms that facilitate software citation, computational reproducibility / frictionless reuse, and interoperability. Model authors can also request private peer review of their computational models. Models that pass peer review receive a DOI once published.

All users of models published in the library must cite model authors when they use and benefit from their code.

Please check out our model publishing tutorial and feel free to contact us if you have any questions or concerns about publishing your model(s) in the Computational Model Library.

Displaying 1 of 1 results nearshoring clear search

NOMAD is an agent-based model of firm location choice between two aggregate regions (“near” and “off”) under logistics uncertainty. Firms occupy sites characterised by attractiveness and logistics risk, earn a risk-adjusted payoff that depends on regional costs (wages plus congestion) and an individual risk-tolerance trait, and update location choices using aspiration-based satisficing rules with switching frictions. Logistics risk evolves endogenously on occupied sites through a region-specific absorption mechanism (good/bad events that reduce/increase risk), while congestion feeds back into regional costs via regional shares and local crowding. Runs stop endogenously once the near-region share becomes quasi-stable after burn-in, and the model records time series and quasi-stable outcomes such as near/off composition, switching intensity, costs, average risk, and average risk tolerance.

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