This article deals with macroscopic traffic flow models on a road network. More precisely, we consider coupling conditions at junctions for the Aw-Rascle-Zhang second order model consisting of a hyperbolic system of two conservation laws. These coupling conditions conserve both the number of vehicles and the mixing of Lagrangian attributes of traffic through the junction. The proposed Riemann solver is based on assignment coefficients, multi-objective optimization of fluxes and priority parameters. We prove that this Riemann solver is wellposed in the case of special junctions, including 1-to-2 diverge and 2-to-1 merge.Due to finite wave propagation speed, it is not restrictive to study a single junction. We define a junction J as the set of n incoming and m outgoing branches that meet at a single point (namely the junction point supposed to be located at x = 0) such that J = n+m i=1 J i · e i where e i ∈ R n+m are unit vectors and the branch J i for any i ∈ {1, . . . , n + m} is defined as follows:] − ∞, 0[, for any i = 1, . . . , n, ]0, +∞[, for any i = n + 1, . . . , n + m.In the remaining, we will mainly focus on the cases of a 1-to-1 junction (n = m = 1), a merge (n = 2 and m = 1) and a diverge (n = 1 and m = 2).
In this paper, we consider first order Hamilton-Jacobi (HJ) equations posed on a "junction", that is to say the union of a finite number of half-lines with a unique common point. For this continuous HJ problem, we propose a finite difference scheme and prove two main results. As a first result, we show bounds on the discrete gradient and time derivative of the numerical solution. Our second result is the convergence (for a subsequence) of the numerical solution towards a viscosity solution of the continuous HJ problem, as the mesh size goes to zero. When the solution of the continuous HJ problem is unique, we recover the full convergence of the numerical solution. We apply this scheme to compute the densities of cars for a traffic model. We recover the well-known Godunov scheme outside the junction point and we give a numerical illustration.
In this work, we derive first order continuum traffic flow models from a microscopic delayed follow-the-leader model. Those are applicable in the context of vehicular traffic flow as well as pedestrian traffic flow. The microscopic model is based on an optimal velocity function and a reaction time parameter. The corresponding macroscopic formulations in Eulerian or Lagrangian coordinates result in first order convection-diffusion equations. More precisely, the convection is described by the optimal velocity while the diffusion term depends on the reaction time. A linear stability analysis for homogeneous solutions of both continuous and discrete models are provided. The conditions match the ones of the car-following model for specific values of the space discretization. The behavior of the novel model is illustrated thanks to numerical simulations. Transitions to collision-free self-sustained stop-and-go dynamics are obtained if the reaction time is sufficiently large. The results show that the dynamics of the microscopic model can be well captured by the macroscopic equations. For non-zero reaction times we observe a scattered fundamental diagram. The scattering width is compared to real pedestrian and road traffic data.
This paper deals with numerical methods providing semi-analytic solutions to a wide class of macroscopic traffic flow models for piecewise affine initial and boundary conditions. In a very recent paper, a variational principle has been proved for models of the Generic Second Order Modeling (GSOM) family, yielding an adequate framework for effective numerical methods. Any model of the GSOM family can be recast into its Lagrangian form as a Hamilton-Jacobi equation (HJ) for which the solution is interpreted as the position of vehicles. This solution can be computed thanks to Lax-Hopf like formulas and a generalization of the inf-morphism property. The efficiency of this computational method is illustrated through a numerical example and finally a discussion about future developments is provided.Keywords: Traffic flow, Hamilton-Jacobi equation, Lax-Hopf algorithm, Lagrangian.
Introduction
General backgroundMacroscopic traffic flow modeling. In order to get a realistic estimation of the real-time traffic states on networks, traffic operators and managers need macroscopic traffic flow models. These models must be simple, robust, allowing to get solutions at a low computational cost. The main macroscopic models are based on conservation laws or hyperbolic systems (see [30,19] for a review). The seminal LWR model (for Lighthill-Whitham and Richards) was proposed in [42,51] as a single conservation law with unknown the vehicles density. This model based on a first order Partial Differential Equation (PDE) is very simple and robust but it fails to recapture some empirical features of traffic. In particular, it does not allow to take into account non-equilibrium traffic states mainly in congested situation. More sophisticated models referred to as higher order models were developed to encompass kinematic constraints of real vehicles or also the wide variety of driver behaviors, even at the macroscopic level. In this paper we deal with models of the Generic Second Order Modeling (GSOM) family. Even if these models are more complicated to deal with, they permit to reproduce traffic instabilities (such as the so-called stop-and-go waves, the hysteresis phenomenon or capacity drop) which move at the traffic speed and differ from kinematic waves [53] Traffic flow monitoring. Before the wide propagation of internet handsets, traffic monitoring has mainly been built on dedicated infrastructure which imply quite important installation and maintenance costs. Traffic flow monitoring and management has been deeply modified with the development of new technologies in mobile sensing aiming to provide a quite important quantity of floating car data. Traffic flow models are needed to be well suited such that managers could use both Eulerian and Lagrangian data for improving traffic state estimation. The term Eulerian refers to "classical" fixed equipment giving records of occupancy or flow of vehicles on a freeway section. This kind of measurements come from e.g. fixed inductive loop detectors, Radio Frequency Identification (R...
This paper details a new macroscopic traffic flow model accounting for the boundedness of traffic acceleration, which is required for physical realism. Our approach relies on the coupling between a scalar conservation law, which refers to the seminal LWR model, and a system of Ordinary Differential Equations describing the trajectories of accelerating vehicles, which we treat as moving constraints. We propose a Wave-Front Tracking Algorithm to construct approximate solutions. We use this algorithm to prove the existence of entropy weak solutions to the associated Cauchy Problem, and provide some numerical simulations illustrating the solution behaviour.
International audienceThis paper revisits the variational theory of traffic flow, now under the presence of continuum lateral inflows and outflows to the freeway say Eulerian source terms. It is found that a VT solution can be easily exhibited only in Eulerian coordinates when source terms are exogenous meaning that they only depend on time and space, but not when they are a function of traffic conditions, as per a merge model. In discrete time, however, these dependencies become exogenous, which allowed us to propose improved numerical solution methods. In Lagrangian and vehicle number-space coordinates, VT solutions may not exist even if source terms are exogenous
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.