Thanks to its high dimensionality and a usually non-convex constraint set, system optimal dynamic traffic assignment remains one of the most challenging problems in transportation research. This paper identifies two fundamental properties of the problem and uses them to design an efficient...

This paper studies the morning commute problem under “tactical waiting”, a phenomenon observable under situations when sudden drops in travel costs are present. Under such situations, travelers may find it advantageous to delay reaching the bottleneck by slowing down or waiting beside, even...

There have been numerous studies of the morning commute problem in a network with a single route or parallel routes with a single bottleneck on each route. Most congested networks, however, often contain more than one congestion spot along each route. In such networks, it is usually difficult to...

Accurately estimating Origin–Destination (OD) trip tables based on traffic data has become crucial in many real-time traffic applications. The problem of OD estimation is traditionally modeled as a bilevel network design problem (NDP), which is challenging to solve in large-scale networks. In...

An access control policy that eliminates all queues beyond the entry points to a network has obvious benefits, which include smooth travel and predictable travel times inside the network. Yet it has never been proven, to the best of our knowledge, whether excluding inside queues yields...