Computational Algorithm for a Fixed Cycle Traffic Signal and New Approximate Expressions for Average Delay

Katsuhisa Ohno
Additional contact information
Katsuhisa Ohno: Kyoto University, Kyoto, Japan

Transportation Science, 1978, vol. 12, issue 1, 29-47

Abstract: A computational algorithm for several characteristics such as the average delay, the average queue length and the probability of clearing the queue is devised for a fixed cycle traffic signal. The values of the average delay given by several theoretical expressions are compared with the exact values computed by the present algorithm. This comparison suggests new approximate expressions for the average delay. New approximate expressions and existing approximate expressions including Webster's full expression and Newell's expression are compared numerically with exact values of the average delay. It is shown that new approximate expressions give almost exact values of the average delay. In addition it is shown that Newell's expression is the most accurate of the existing approximate expressions.

Date: 1978
References: Add references at CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.12.1.29 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ortrsc:v:12:y:1978:i:1:p:29-47

Access Statistics for this article

More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().