Controlling traffic lights at a bottleneck with renewal arrival processes

Controlling traffic lights at a bottleneck with renewal arrival processes

0.00 Avg rating0 Votes
Article ID: iaor2005990
Country: Cuba
Volume: 24
Issue: 3
Start Page Number: 274
End Page Number: 281
Publication Date: Oct 2003
Journal: Revista de Investigacin Operacional
Authors: ,
Keywords: markov processes
Abstract:

Grycko & Moeschlin describe the control of traffic lights at a bottleneck with a stochastic volume of traffic. The present paper generalizes the developed theory to the case of arrival processes being renewal processes. The finiteness of the asymptotic expected queue length is proved by a domination principle. Computer experimentation shows that the optimal time of open passage does not only depend on the traffic intensity but also on the distribution of interarrival times, which means that a precise traffic control requires to estimate this distribution.

Reviews

Required fields are marked *. Your email address will not be published.