CONTROLLING TRAFFIC LIGHTS AT A BOTTLENECK WITH RENEWAL ARRIVAL PROCESSES

Abstract

In Grycko-Moeschlin (1998a) and (1998b) the control of traffic lights at a bottleneck with a stochastic volume of traffic is discussed. 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.