IDEAS home Printed from https://ideas.repec.org/a/kap/netspa/v7y2007i4p333-351.html
   My bibliography  Save this article

Traffic Grammar and Algorithmic Complexity in Urban Freeway Flow Patterns

Author

Listed:
  • Kingsley Haynes
  • Rajendra Kulkarni
  • Roger Stough

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

Suggested Citation

  • Kingsley Haynes & Rajendra Kulkarni & Roger Stough, 2007. "Traffic Grammar and Algorithmic Complexity in Urban Freeway Flow Patterns," Networks and Spatial Economics, Springer, vol. 7(4), pages 333-351, December.
    • Handle: RePEc:kap:netspa:v:7:y:2007:i:4:p:333-351
    DOI: 10.1007/s11067-007-9032-9
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s11067-007-9032-9
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s11067-007-9032-9?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. J F Betak, 1974. "Information Theory as a Basis for Studying Environmental Complexity: Some Limitations," Environment and Planning A, , vol. 6(3), pages 259-272, June.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.

      Corrections

      All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. 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.

      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 CitEc recognized a bibliographic reference but did not link an item in RePEc 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 RePEc Author Service profile, as there may be some citations waiting for confirmation.

      For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

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

      IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.