Traffic Grammar and Algorithmic Complexity in Urban Freeway Flow Patterns
AbstractThis paper uses techniques from formal language theory to describe the linear spatial patterns in urban freeway traffic flows in order to understand and analyze “hidden order” in such high volume systems. A method for measuring randomness based on algorithmic entropy is introduced and developed. These concepts are operationalized using Pincus’ approximate entropy formulation in an appropriate illustration. These measures, which may be viewed as counterintuitive, are believed to offer robust and rigorous guidance to enhance the overall understanding of efficiency in urban freeway traffic systems. Utilization of such measures should be facilitated by information generated by real time intelligent transportation systems (ITS) technologies and may prove helpful in real time traffic flow management. Copyright Springer Science+Business Media, LLC 2007
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoArticle provided by Springer in its journal Networks and Spatial Economics.
Volume (Year): 7 (2007)
Issue (Month): 4 (December)
Contact details of provider:
Web page: http://www.springerlink.com/link.asp?id=106607
Formal language theory; Algorithmic complexity; Intelligent transportation systems (ITS); Approximate entropy;
You can help add them by filling out this form.
reading list or among the top items on IDEAS.Access and download statisticsgeneral information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Guenther Eichhorn) or (Christopher F. Baum).
If references are entirely missing, you can add them using this form.