Optimal sequencing of traffic streams at a signalized junction

• Online Access: http://hdl.handle.net/2047/d20001201

At a signalized intersection, efficiency can be gained by running compatible traffic streams in parallel, while incompatible streams run in series. In an intersection with an asymmetric clearance times, some sequences require less clearance time than others. In a simple intersection with a limited number of sequences, finding the optimal sequence is trivial. However in a complex intersection with a large number of traffic streams or unusual geometry, the optimal sequence is not obvious, and the number of possible sequences can be too large to check manually. An optimal sequence increases intersection capacity and minimizes delay by allowing an intersection to run with a shorter cycle length while serving the demand of all the traffic streams