Hostname: page-component-7dd5485656-pnlb5 Total loading time: 0.001 Render date: 2025-10-31T11:23:19.219Z Has data issue: false hasContentIssue false
  • English
  • Français

Traffic intersection control and zero-switch queues under conditions of Markov chain dependence input

Published online by Cambridge University Press:  14 July 2016

J. P. Lehoczky
J. P. Lehoczky*
Affiliation:
Carnegie-Mellon University
Get access Rights & Permissions [Opens in a new window]

Abstract

A model for a vehicle controlled intersection based on a zero-switch queueing system is introduced and analyzed under Markov chain dependence input. Conditions for asymptotic stability are derived. Under these conditions the moments of the cycle lengths are derived. The expected area beneath the sample paths given by the queue sizes is computed. This area represents total delay to all cars, and is a measure of the effectiveness of the control device.

Keywords

TRAFFIC CONTROLZERO-SWITCH QUEUESALTERNATING PRIORITY QUEUESSTABILITY OF QUEUESMARKOV CHAIN INPUT PROCESSFIRST ORDER DEPENDENT INPUTFIRST EMPTINESS TIME OF A DAMTOTAL DELAYAREA BENEATH SAMPLE PATH

Information

Type
Research Papers
Information
Journal of Applied Probability , Volume 9 , Issue 2 , June 1972 , pp. 382 - 395
Copyright
Copyright © Applied Probability Trust 1972 

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.)

Article purchase

Temporarily unavailable

References

Avi-Itzhak, B., Maxwell, W. L. and Miller, L. W. (1965) Queueing with alternating priorities. Operat. Res. 13, 306–318.CrossRefGoogle Scholar
Chung, K. L. (1968) A Course in Probability Theory. Harcourt, Brace and World, Inc., New York.Google Scholar
Darroch, J. N., Newell, G. F. and Morris, R. W. J. (1964) Queues for a vehicle-actuated traffic light. Operat. Res. 12, 882–894.Google Scholar
Dunne, M. C. (1967) Traffic delays at a signalized intersection with binomial arrivals. Transportation Sci. 1, 24–31.Google Scholar
Gani, J. (1969) Recent advances in storage and flooding theory. Adv. Appl. Prob. 1, 90–110.Google Scholar
Gani, J. (1970) First emptiness problems in queueing, storage and traffic theory. Proc. Sixth Berkeley Symp. To appear.Google Scholar
Hawkes, A. G. (1965) Queueing at traffic intersections. Proc. Third Internat. Symp. on the Theory of Traffic Flow. OECD, Paris, 190–199.Google Scholar
Lehoczky, J. P. (1969) Stochastic models in traffic flow theory: intersection control. Stanford University Technical Report No. 14.Google Scholar
Lehoczky, J. P. (1971) A note on the first emptiness time of an infinite reservoir with inputs forming a Markov chain. J. Appl. Prob. 8, 276–284.CrossRefGoogle Scholar
Neuts, M. F. and Yadin, M. (1968) The transient behavior of the queue with alternating priorities, with special reference to the waiting times. Mimeo Series No. 136, Department of Statistics, Purdue University.Google Scholar
Newell, G. F. (1969) Properties of vehicle-actuated signals: I. One-way streets. Transportation Sci. 3, 30–52.Google Scholar
Newell, G. F. and Osuna, E. E. (1969) Properties of vehicle-actuated signals: II. Two-way streets. Transportation Sci. 3, 99–125.Google Scholar
Potts, R. B. (1967) Traffic delays at a signalized intersection with binomial arrivals. Transportation Sci. 1, 126–128.Google Scholar
Stidham, S. Jr. (1969) Optimal control of a signalized intersection. Part. I: Introduction; structure of intersection models. Part II: Determining the optimal switching policies. Part III: Descriptive stochastic models. Technical Reports Nos. 94, 95, 96. Department of Operations Research, Cornell University.Google Scholar
Takács, L. (1968) Two queues attended by a single server. Operat. Res. 16, 639–650.Google Scholar
Yadin, M. (1970) Queueing with alternating priorities treated as a random walk on the lattice in the plane. J. Appl. Prob. 7, 196–218.CrossRefGoogle Scholar