Traffic Operations and Management

For networks consisting of a single route the Macroscopic Fundamental Diagram (MFD) can be predicted analytically; but when the networks consist of multiple overlapping routes the flows observed in congestion for a given density are less than those one would predict if the routes were homogeneously congested and did not overlap. These types of networks also tend to jam at densities that are only a fraction of their routes’ average jam density. This paper provides an explanation for this phenomena. It shows that, even for perfectly homogeneous networks with spatially uniform travel patterns...

This paper evaluates strategies for operating buses on signal-controlled arterials using special lanes that are made intermittently available to general traffic. The advantage of special bus lanes, intermittent or dedicated, is that they free buses from traffic interference; the disadvantage is that they disrupt traffic. We find that intermittent lanes, unlike dedicated ones, do not significantly reduce street capacity. Intermittence, however, increases the average traffic density at which the demand is served, and as a result increases traffic delay. These delays are more than offset by...

Traffic congestion is a growing problem in Nairobi, Kenya, resulting from rapidly increasing population and the crowding of motorized traffic onto a limited street network. This report includes analysis of the traffic conditions in Nairobi, the expected effects of further growth in demand, and a set of recommendations for how to improve the performance of the street network. Data describing motorized vehicle traffic was used to build a simulation model of Nairobi’s street network considering cars and matatus. This model was used to analyze traffic conditions at the city-scale under...

This paper shows that a macroscopic fundamental diagram (MFD) relating flow and average density must exist on any street with blocks of diverse widths and lengths, but no turns, even if all or some of the intersections are controlled by arbitrarily timed traffic signals. The timing patterns are assumed to be fixed in time. Exact expressions in terms of a shortest path recipe are given, both, for the street’s capacity and its MFD. Approximate formulas that require little data are also given.Conditions under which the results can be approximately extended to networks encompassing large city...