A TIME-DEPENDENT APPROACH TO JUNCTION DELAYS
I Catling
Abstract
I Catling
Abstract
When demand at a junction is close to or above saturation and is varying with time, conventional steady-state delay formulae are inapplicable. The formulae presented in this paper extend previous work on a dynamic delay formulae to the case of time-dependent demand. A peak period is divided into a series of short intervals during each of which demand is considered to be stationary. By taking into account the mean queue length at the beginning and end of each interval, a representation of average delay is obtained which compares favourably both with more complex analytical formulae and with results of simulations.(a) /TRRL/
OpenAlex reports 67 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
When demand at a junction is close to or above saturation and is varying with time, conventional steady-state delay formulae are inapplicable. The formulae presented in this paper extend previous work on a dynamic delay formulae to the case of time-dependent demand. A peak period is divided into a series of short intervals during each of which demand is considered to be stationary. By taking into account the mean queue length at the beginning and end of each interval, a representation of average delay is obtained which compares favourably both with more complex analytical formulae and with results of simulations.(a) /TRRL/
Key concepts: Queue, Retard, Interval (graph theory), Representation (politics), Series (stratigraphy), Mathematics, Applied mathematics, Control theory (sociology)