Advanced Search
MyIDEAS: Login to save this article or follow this journal

Traffic Grammar and Algorithmic Complexity in Urban Freeway Flow Patterns

Contents:

Author Info

  • Kingsley Haynes

    ()

  • Rajendra Kulkarni

    ()

  • Roger Stough

    ()

Registered author(s):

    Abstract

    This 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 Info

    If 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.
    File URL: http://hdl.handle.net/10.1007/s11067-007-9032-9
    Download Restriction: Access to full text is restricted to subscribers.

    As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.

    Bibliographic Info

    Article provided by Springer in its journal Networks and Spatial Economics.

    Volume (Year): 7 (2007)
    Issue (Month): 4 (December)
    Pages: 333-351

    as in new window
    Handle: RePEc:kap:netspa:v:7:y:2007:i:4:p:333-351

    Contact details of provider:
    Web page: http://www.springerlink.com/link.asp?id=106607

    Related research

    Keywords: Formal language theory; Algorithmic complexity; Intelligent transportation systems (ITS); Approximate entropy;

    References

    References listed on IDEAS
    Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
    as in new window
    1. J F Betak, 1974. "Information theory as a basis for studying environmental complexity: some limitations," Environment and Planning A, Pion Ltd, London, vol. 6(3), pages 259-272, March.
    Full references (including those not matched with items on IDEAS)

    Citations

    Lists

    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

    Statistics

    Access and download statistics

    Corrections

    When requesting a correction, please mention this item's handle: RePEc:kap:netspa:v:7:y:2007:i:4:p:333-351. See general 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 you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.