Hostname: page-component-848d4c4894-nmvwc Total loading time: 0 Render date: 2024-07-02T18:20:28.331Z Has data issue: false hasContentIssue false
  • English
  • Français

The fixed cycle traffic light problem: a note on a paper by Mcneil

Published online by Cambridge University Press:  14 July 2016

Victor Siskind
Victor Siskind*
Affiliation:
University of Copenhagen
Get access Rights & Permissions [Opens in a new window]

Extract

Both paper and author (D. R. McNeil, (1968)) will be referred to below as DRM. The said paper deals with the following situation: an intersection is controlled by a traffic light with a fixed cycle time, T; the possibility of other delays, e.g., due to turning vehicles, is ignored; arrivals at the light form a compound Poisson process; if vehicles arrive to find the light green and the queue empty they are not delayed, while in the contrary case they depart when they reach the head of the queue, providing the light is green, each vehicle taking a constant time to move off. The length of the effective red period is R. For further details and discussion, DRM may be consulted.

Type
Short Communications
Information
Journal of Applied Probability , Volume 7 , Issue 1 , April 1970 , pp. 245 - 248
Copyright
Copyright © Applied Probability Trust 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Mcneil, D.R. (1968) A solution to the fixed-cycle traffic light problem for compound Poisson arrivals. J. Appl. Prob. 5, 624–635.Google Scholar
Darroch, J.N. (1964) On the traffic light queue. Ann. Math. Statist. 35, 380–388.Google Scholar