Computational Model Library

SONG - Simulation of Network Growth (version 1.0.0)

SONG 1.0 is a simulator designed for simulating the process of transportation network growth. The growth or decline of transportation networks is normally treated as the result of top-down decision making in the long-range planning efforts of metropolitan planning organizations (MPOs). However, changes to transportation networks are essentially the results of numerous small decisions by property owners, firms, developers, towns, cities, counties, state department of transportation districts, MPOs, and states in response to market conditions and policy initiatives. These system behaviors demonstrate the characteristics of decentralized systems, where organized patterns and structures can emerge not because of centralized control, but because of the interactions among decentralized system components. This phenomenon of decentralization and self-organization occurs in many circumstances, such as bird flocks, ant colonies, life evolutions, neural networks. Increasingly research is applying decentralized models in different domains as a new way of viewing the world. In SONG 1.0, transportation networks are treated as decentralized systems that demonstrate self-organizing patterns. By design, the simulator models behavior of individual system components and small decisions, and then demonstrates the patterns resulting from interactions of component models. The idea is that it is the actions of the components, not the whole that are controlled by the designer; the resulting patterns or structures, which often behave very differently than the elements that compose them, are not designed.

Version Submitter First published Last modified Status
1.0.0 D Levinson Mon Aug 29 18:11:37 2011 Sat Apr 27 20:18:48 2013 Published

Discussion

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.