Delay Analysis for the Fixed-Cycle Traffic-Light Queue

We consider the fixed-cycle traffic-light (FCTL) queue, where vehicles arrive at an intersection controlled by a traffic light and form a queue. The traffic-light signal alternates between green and red periods, and delayed vehicles are assumed to depart during the green period at equal time intervals. Most of the research done on the FCTL queue assumes that the vehicles arrive at the intersection according to a Poisson process and focuses on deriving formulas for the mean queue length at the end of green periods and the mean delay. For a class of discrete arrival processes, including the Poisson process, we derive the probability generating function of both the queue length and delay, from which the whole queue length and delay distribution can be obtained. This allows for the evaluation of performance characteristics other than the mean, such as the variance and percentiles of the distribution. We discuss the numerical procedures that are required to obtain the performance characteristics, and give several numerical examples.

[1]  Richard E. Allsop.  Delay at a Fixed Time Traffic Signal—I: Theoretical Analysis , 1972 .

[2]  William G. Marchal,et al.  Robustness of Rootfinding in Single-Server Queueing Models , 1990, INFORMS J. Comput..

[3]  D. Heidemann.  Queue length and delay distributions at traffic signals , 1994 .

[4]  Andrzej P. Tarko.  Random Queues in Signalized Road Networks , 2000, Transp. Sci..

[5]  Norman T. J. Bailey,et al.  On Queueing Processes with Bulk Service , 1954 .

[6]  Herwig Bruneel,et al.  Discrete-time models for communication systems including ATM , 1992 .

[7]  Donald R. McNeil,et al.  A solution to the fixed-cycle traffic light problem for compound Poisson arrivals , 1968 .

[8]  Alan J. Miller.  Settings for Fixed-Cycle Traffic Signals , 1963 .

[9]  Ivo Adan,et al.  Analyzing GI/E_r/1 queues , 1994 .

[10]  Bart Steyaert,et al.  Bound analysis for WRR scheduling in a statistical multiplexer with bursty sources , 1999, Telecommun. Syst..

[11]  Yiqiang Zhao,et al.  Analyzing GI/Er/1 queues , 1996, Oper. Res. Lett..

[12]  T. Koopmans,et al.  Studies in the Economics of Transportation. , 1956 .

[13]  Ward Whitt,et al.  Numerical inversion of probability generating functions , 1992, Oper. Res. Lett..

[14]  Francois Dion,et al.  COMPARISON OF DELAY ESTIMATES AT UNDER-SATURATED AND OVER-SATURATED PRE-TIMED SIGNALIZED INTERSECTIONS , 2004 .

[15]  Johan van Leeuwaarden,et al.  A discrete-time queueing model with periodically scheduled arrival and departure slots , 2006, Perform. Evaluation.

[16]  Katsuhisa Ohno,et al.  Computational Algorithm for a Fixed Cycle Traffic Signal and New Approximate Expressions for Average Delay , 1978 .

[17]  Ning Wu.  ESTIMATION OF QUEUE LENGTHS AND THEIR PERCENTILES AT SIGNALIZED INTERSECTIONS , 1998 .

[18]  van Mja Michel Eenige.  Queueing systems with periodic service , 1996 .

[19]  G. F. Newell.  Approximation Methods for Queues with Application to the Fixed-Cycle Traffic Light , 1965 .

[20]  Gordon F. Newell,et al.  Queues for a Fixed-Cycle Traffic Light , 1960 .

[21]  F. Webster.  TRAFFIC SIGNAL SETTINGS , 1958 .

[22]  Johan van Leeuwaarden,et al.  Analytic Computation Schemes for the Discrete-Time Bulk Service Queue , 2005, Queueing Syst. Theory Appl..

[23]  Johan van Leeuwaarden,et al.  Bounds and Approximations for the Fixed-Cycle Traffic-Light Queue , 2006, Transp. Sci..

[24]  Liping Fu,et al.  Delay Variability at Signalized Intersections , 2000 .

[25]  Richard Cowan.  An analysis of the fixed-cycle traffic-light problem , 1981 .

[26]  J. Darroch.  On the Traffic-light Queue , 1964 .