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

Alberto Bressan, Khai T. Nguyen

Research output: Contribution to journalArticlepeer-review

4 Scopus citations

Abstract

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.

Original languageEnglish (US)
Pages (from-to)717-748
Number of pages32
JournalNetworks and Heterogeneous Media
Volume10
Issue number4
DOIs
StatePublished - 2015

All Science Journal Classification (ASJC) codes

  • Statistics and Probability
  • Engineering(all)
  • Computer Science Applications
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Optima and equilibria for traffic flow on networks with backward propagating queues'. Together they form a unique fingerprint.

Cite this