Optima and equilibria for traffic flow on networks with backward propagating queues

This paper studies an optimal decision problem for several groups of drivers on a network of roads. Drivers have different origins and destinations, and different costs, related to their departure and arrival time. On each road the ow is governed by a conservation law, while intersections are modeled using buffers of limited capacity, so that queues can spill backward along roads leading to a crowded intersection. Two main results are proved: (i) the existence of a globally optimal solution, minimizing the sum of the costs to all drivers, and (ii) the existence of a Nash equilibrium solution, where no driver can lower his own cost by changing his departure time or the route taken to reach destination.