« ORESTE » is an Associate Team between INRIA project-team ACUMES (formerly OPALE) and the Berkeley University team Connected Corridors (formerly Mobile Millennium), funded from 2012 to 2014, renewed from 2015 to 2017.

Research activity in 2016



Research Report for 2016

Exchanges between partners in 2016

During the fifth year of the project we had the following research visit exchanges:

  1. Maria Laura Delle Monache, Post-Doc at Rutgers University - Camden, visited Inria in from January 4 to January 9, from June 1 to June 8 and from September 19 to September 22, 2016.
  2. Paola Goatin, Senior Researcher at Inria, visited Rutgers University from April 26 to May 4, 2016.
  3. Alexander Keimer, Post-Doc at UC Berkeley, visited Inria from November 7 to 26, 2016.

Advances of the work program

During this fifth year, we focused mainly on the following topics:

  • Construction of a general Riemann Solver at junctions
    1. We introduced a new Riemann solver for traffic flow on networks. The Priority Riemann solver (PRS) provides a solution at junctions by taking into consideration priorities for the incoming roads and maximization of through flux. We prove existence of solutions for the solver for junctions with up to two incoming and two outgoing roads and show numerically the comparison with previous Riemann solvers. Additionally, we introduce a second version of the solver that considers the priorities as softer constraints and illustrate numerically the differences between the two solvers.

  • Development of Dynamic Traffic Assignment (DTA) models
    1. We investigated literature on DTA, focusing mainly on the single commodity model, in order to understand the foundations of more elaborated models. In particular, Bressan’s work enables us to develop models on networks for traffic flow. . We will formulate an optimal routing problem, and give optimality conditions for a proposed cost function subject to the dynamics on the network.
    2. We are currently developing a new junction model for the network, which relies on short-term estimates for travel times within the network. We will finally implement the model numerically, which requires a proper numerical discretization of the model.

Joint papers resulting from the collaboration

During this year we submitted the paper

    M.L. Delle Monache, P. Goatin and B. Piccoli, Priority-based Riemann solver for traffic flow on networks, submitted.

Top