
We qualitatively compare the solutions of a multilane model with those produced by the classical Lighthill-Whitham-Richards equation with suitable coupling conditions at simple road junctions. The numerical simulations are based on the Godunov and upwind schemes. Several tests illustrate the models' behaviour in different realistic situations.
Citation: Paola Goatin, Elena Rossi. Comparative study of macroscopic traffic flow models at road junctions[J]. Networks and Heterogeneous Media, 2020, 15(2): 261-279. doi: 10.3934/nhm.2020012
[1] | Emiliano Cristiani, Smita Sahu . On the micro-to-macro limit for first-order traffic flow models on networks. Networks and Heterogeneous Media, 2016, 11(3): 395-413. doi: 10.3934/nhm.2016002 |
[2] | Paola Goatin, Elena Rossi . Comparative study of macroscopic traffic flow models at road junctions. Networks and Heterogeneous Media, 2020, 15(2): 261-279. doi: 10.3934/nhm.2020012 |
[3] | Maya Briani, Emiliano Cristiani . An easy-to-use algorithm for simulating traffic flow on networks: Theoretical study. Networks and Heterogeneous Media, 2014, 9(3): 519-552. doi: 10.3934/nhm.2014.9.519 |
[4] | Abraham Sylla . Influence of a slow moving vehicle on traffic: Well-posedness and approximation for a mildly nonlocal model. Networks and Heterogeneous Media, 2021, 16(2): 221-256. doi: 10.3934/nhm.2021005 |
[5] | Mohamed Benyahia, Massimiliano D. Rosini . A macroscopic traffic model with phase transitions and local point constraints on the flow. Networks and Heterogeneous Media, 2017, 12(2): 297-317. doi: 10.3934/nhm.2017013 |
[6] | Cécile Appert-Rolland, Pierre Degond, Sébastien Motsch . Two-way multi-lane traffic model for pedestrians in corridors. Networks and Heterogeneous Media, 2011, 6(3): 351-381. doi: 10.3934/nhm.2011.6.351 |
[7] | Paola Goatin, Chiara Daini, Maria Laura Delle Monache, Antonella Ferrara . Interacting moving bottlenecks in traffic flow. Networks and Heterogeneous Media, 2023, 18(2): 930-945. doi: 10.3934/nhm.2023040 |
[8] | Benjamin Seibold, Morris R. Flynn, Aslan R. Kasimov, Rodolfo R. Rosales . Constructing set-valued fundamental diagrams from Jamiton solutions in second order traffic models. Networks and Heterogeneous Media, 2013, 8(3): 745-772. doi: 10.3934/nhm.2013.8.745 |
[9] | Bertrand Haut, Georges Bastin . A second order model of road junctions in fluid models of traffic networks. Networks and Heterogeneous Media, 2007, 2(2): 227-253. doi: 10.3934/nhm.2007.2.227 |
[10] | Michael Herty, Adrian Fazekas, Giuseppe Visconti . A two-dimensional data-driven model for traffic flow on highways. Networks and Heterogeneous Media, 2018, 13(2): 217-240. doi: 10.3934/nhm.2018010 |
We qualitatively compare the solutions of a multilane model with those produced by the classical Lighthill-Whitham-Richards equation with suitable coupling conditions at simple road junctions. The numerical simulations are based on the Godunov and upwind schemes. Several tests illustrate the models' behaviour in different realistic situations.
Starting from the well-known Lighthill-Whitham-Richards (LWR) model [19,20], a variety of macroscopic traffic flow models based on hyperbolic balance laws have been proposed to capture traffic behaviour in different situations. In this paper, we focus on the description of traffic dynamics on road networks. More precisely, we investigate the role of coupling conditions at road junctions. To this aim, we compare the behaviour of the multilane junction model introduced in [14], and the classical LWR model at junctions [11,Chapter 5].
The multilane junction model [14] allows to handle in detail various realistic cases of road junctions, with the major exception of the diverging ones, which requires some additional information on drivers' routing preferences upstream. To avoid cumbersome notation, we recap here the main features of the multilane model in the case of a junction consisting of 2 incoming roads and 1 outgoing road, the number of lanes in each road to be specified later.
Let
In order to draw a comparison with the LWR model on networks, we sum the vehicle densities on the various lanes, and we compare the total density profile with the solution given by the LWR model with corresponding maximal density. Notice that, in this way, we are led to consider the LWR model at a 2-to-1 junction with maximal density
The numerical tests described in Sections 4 and 5 point out similarities and differences between the multilane model and its LWR counterpart. Interestingly, in the case of a 1-to-1 junction, the multilane description captures a different behaviour than those commonly described by the classical LWR approach. Merging junctions display pretty the same dynamics with both approaches, while diverging junctions show a more complex behaviour, acting as FIFO (first-in-first-out) when one outgoing road is fully congested, and as non-FIFO otherwise. Further assessment on the validity of the models necessitate the comparison with suitable real data.
Macroscopic traffic flow models on networks have been introduced in the mathematical literature since more than two decades [4,15], see also [9,11] for a detailed overview. We recall here the LWR model on
A road network is modelled by a finite collection of edges and vertices, representing respectively unidirectional roads and junctions. On each edge
{∂tρ+∂xfI(ρ)=0,ρ(0,x)=ρo(x), | (1) |
where
fI(u)=VIu(1−uRI), | (2) |
where
DI(u)={fI(u)if u≤θI,fI(θI)if u≥θI, and SI(u)={fI(θI)if u≤θI,fI(u)if u≥θI. | (3) |
The demand and supply functions introduced above are displayed in Figure 1.
Notice that, as in [13], the flux function
At each junction, the model includes also of the preferences of the drivers, which are prescribed and known a priori. These preferences describe the distribution of traffic from incoming to outgoing roads and are expressed as elements of a matrix
A=(aj,i)∈Rm×n with 0≤aj,i≤1 for all i∈{1,…,n},j∈{n+1,…,n+m} and n+m∑j=n+1aj,i=1 for all i∈{1,…,n}. |
In other words, each element
In view of the examples considered in this paper, we focus on the cases of one-to-one junctions (modeling speed limit or lane number changes), two-to-one (merging) junctions and one-to-two (diverging) junctions, see Figure 2. In the case of merging junctions, where the number of incoming roads is greater than the number of outgoing roads, it is necessary to introduce a priority parameter for each incoming road to single out a unique solution. In particular, for two-to-one junctions, the two incoming roads are characterised by the priority parameters
Consider a one-to-one junction and call
{∂tρ+∂xf(x,ρ)=0,ρ(0,x)=ρo(x), | (4) |
with
v(x,u)= H(x)vr(u)+(1−H(x))vℓ(u), | (5) |
fℓ(u)= uvℓ(u)fr(u)=uvr(u), | (6) |
f(x,u)= uv(x,u)=H(x)fr(u)+(1−H(x))fℓ(u), | (7) |
vd(u)=Vd(1−uRd), | (8) |
for a suitable positive constant
Concerning the initial datum
ρo(x)∈ [0,Rℓ] for x∈]−∞,0[,ρo(x)∈ [0,Rr] for x∈]0,+∞[. |
Hyperbolic conservation laws with discontinuous flux such as (4) arise in the modelling of several phenomena, such as, for instance, two phase flow in heterogeneous media and traffic flow with rough road conditions. Among the rich literature on the subject, we refer the interested reader to [2,3,7,18,23] and the references therein.
The main issue when dealing with conservation laws with discontinuous flux function is the lack of a unique solution, since the classical theory by Kružkov does not apply. Clearly, Kružkov entropy conditions are valid away from the point(s) of discontinuity of the flux, but they are not enough to provide the uniqueness of solution. With the aim of proving the well-posedness of the problem, various notions of solutions have been introduced in the literature, based of different admissibility conditions. We recall for example the minimal variation criterion introduced by Gimse and Risebro [12] and the
In the present study, we will focus on the solutions given by the supply-demand flux maximizing criterion classically used in traffic flow modeling (satisfying the entropy criterion of [1]) and by the vanishing viscosity limit [7].
In the case of merging junctions, a priority parameter has to be assigned to each incoming road, see [11,Section 5.2.2]. Therefore, in the specific situation of a two-to-one junction, the two incoming roads have priority
Clearly, since there is only one outgoing road, the traffic distribution matrix
The initial datum satisfies the following constraints:
ρo,ℓ1(x)∈[0,Rℓ1] for x∈]−∞,0[,ρo,r(x)∈[0,Rr] for x∈]0,+∞[.ρo,ℓ2(x)∈[0,Rℓ2] for x∈]−∞,0[, |
Following [13], denoting by
ˆγℓ1(ρℓ1,ρℓ2,ρr):=min{Dℓ1(ρℓ1),max{PSr(ρr),Sr(ρr)−Dℓ2(ρℓ2)}},ˆγℓ2(ρℓ1,ρℓ2,ρr):=min{Dℓ2(ρℓ2),max{(1−P)Sr(ρr),Sr(ρr)−Dℓ1(ρℓ1)}},ˆγr(ρℓ1,ρℓ2,ρr):=ˆγℓ1(ρℓ1,ρℓ2,ρr)+ˆγℓ2(ρℓ1,ρℓ2,ρr). | (9) |
The one-to-two junction is a particular diverging junction, see [11,Section 5.2.1] for more details. (Since there is only one incoming road, there is no need to prescribe a right of way.) In this case, the traffic distribution matrix
A=[α1−α],withα∈]0,1[. |
In [11] a FIFO (first-in-first-out) rule is applied at the junction. In terms of the demand and supply functions (3), the FIFO rule amounts to the following: denoting by
γℓ(ρℓ,ρr1,ρr2):=min{Dℓ(ρℓ),Sr1(ρr1)α,Sr2(ρr2)1−α},γr1(ρℓ,ρr1,ρr2):=αγℓ(ρℓ,ρr1,ρr2),γr2(ρℓ,ρr1,ρr2):=(1−α)γℓ(ρℓ,ρr1,ρr2). | (10) |
As a consequence, if one of the outgoing roads is fully congested (i.e.
γr1(ρℓ,ρr1,ρr2):=min{αDℓ(ρℓ),Sr1(ρr1)},γr2(ρℓ,ρr1,ρr2):=min{(1−α)Dℓ(ρℓ),Sr2(ρr2)},γℓ(ρℓ,ρr1,ρr2):=γr1(ρℓ,ρr1,ρr2)+γr2(ρℓ,ρr1,ρr2). | (11) |
In the case of a diverging junction, the initial datum satisfies the following constraints:
ρo,r1(x)∈[0,Rr1] for x∈]0,+∞[,ρo,ℓ(x)∈[0,Rℓ] for x∈]−∞,0[,ρo,r2(x)∈[0,Rr2] for x∈]0,+∞[. |
We recall the main features of the multilane junction model introduced in [14], based on the multilane traffic flow model proposed in [17]. The model provides a description of traffic on road networks with several lanes, allowing for lane changes and overtaking, as well as change in the speed laws and in the number of lanes along the road. In particular,
The model reads then as follows: for
{∂tρj+∂xfj(x,ρj)=Gj−1(x,ρj−1,ρj)−Gj(x,ρj,ρj+1),j=…,M,ρj(0,x)=ρo,j(x),j=…,M, | (12) |
with, for
vj(x,u)= H(x)vr,j(u)+(1−H(x))vℓ,j(u), | (13) |
fℓ,j(u)= uvℓ,j(u),fr,j(u)= uvr,j(u), | (14) |
fj(x,u)= uvj(x,u)=H(x)fr,j(u)+(1−H(x))fℓ,j(u), | (15) |
We set
ρo,j(x)= 0for x∈]−∞,0[ and j∉Mℓ, | (16) |
ρo,j(x)= 1for x∈]0,+∞[ and j∉Mr. | (17) |
The source terms, which account for the flow rates across lanes, are defined as in [17]:
Gd,j(ρj,ρj+1)= K[(vd,j+1(ρj+1)−vd,j(ρj))+ρj−(vd,j+1(ρj+1)−vd,j(ρj))−ρj+1]= K(vd,j+1(ρj+1)−vd,j(ρj))⋅{ρjif vd,j+1(ρj+1)≥vd,j(ρj),ρj+1if vd,j+1(ρj+1)<vd,j(ρj), | (18) |
for
Gd,jd(u,w)=0 for some jd∈{1,…,M−1},d=ℓ,r. | (19) |
The functions appearing in the source term of (12) are then defined as follows
Gj(x,u,w)= H(x)Gr,j(u,w)+(1−H(x))Gℓ,j(u,w) for j=1,…,M−1, | (20) |
G0(x,u,w)= GM(x,u,w)=0. | (21) |
For the sake of brevity, we introduce the notation
For simplicity, and with slight abuse of notation, we consider
In order to compare the multilane model to the LWR model at junctions, we make the following choices. In all the numerical experiments, for the multilane model we choose
vI,j(u)=VI(1−u)forj=1,…,M, |
with
vI(u)=VI(1−uMI), |
where
Through our numerical integrations, we show that the outcome may be different when not considering the number of lanes involved.
We compare now numerically the solution given by the multilane
We provide in this section the details on the numerical schemes used throughout the paper.
We introduce a uniform mesh in space, of width
xk= (k+12)Δx,xk−1/2=kΔx, |
where
ρ0j,k=1Δx∫xk+1/2xk−1/2ρo,j(x)dx, | (22) |
recalling that (16) and (17) hold. The approximated initial data for the LWR model is given consequently as the sum of the initial data on various lanes, depending on the configuration under consideration:
● 1-to-1 junction (Section 4.2): the initial data for the LWR model is merely given by the sum, thus
ρ0k= Mℓ∑j=1ρ0j,k for k≤−1;ρ0k= Mr∑j=1ρ0j,k for k≥0. |
● 2-to-1 junction (Section 4.3): for the merging junction, there are two incoming and one outgoing roads:
for k≤−1:ρ0ℓi,k= Mℓi∑j=1ρ0j,k for i=1,2;for k≥0:ρ0r,k= Mr∑j=1ρ0j,k. |
● 1-to-2 junction (Section 5): for the diverging junction, there are one incoming and two outgoing roads:
for k≤−1:ρ0ℓ,k= Mℓ∑j=1ρ0j,k;for k≥0:ρ0ri,k= Mri∑j=1ρ0j,k for i=1,2. |
The solution to the multilane model (12)–(16)–(17)–(19) is obtained through a Godunov type scheme, with fractional step to take into account the source terms, see [14,Algorithm 2.1]:
ρn+1/2j,k= ρnj,k−λ[Fj(xk+1/2,ρnj,k,ρnj,k+1)−Fj(xk−1/2,ρnj,k−1,ρnj,k)],ρn+1j,k= ρn+1/2j,k+ΔtGj−1(xk,ρn+1/2j−1,k,ρn+1/2j,k)−ΔtGj(xk,ρn+1/2j,k,ρn+1/2j+1,k), |
where
Fj(x,u,w)={min{Dj(x,u),Sj(x,w)} if x≠0,min{Dℓ,j(u),Sr,j(w)} if x=0, | (23) |
with
Dj(x,u)= H(x)Dj,r(u)+(1−H(x))Dj,ℓ(u),Sj(x,u)= H(x)Sj,r(u)+(1−H(x))Sj,ℓ(u), |
The LWR model is numerically integrated through a Godunov type scheme, which provides the solution to the Cauchy problem (1) that maximises the flux through the junction:
● 1-to-1 junction (Section 4.2):
ρn+1k=ρnk−λ[F(xk+1/2,ρnk,ρnk+1)−F(xk−1/2,ρnk−1,ρnk)], | (24) |
with
In Section 4.2, we apply also a different strategy for the numerical integration of the LWR model: we make use of an upwind scheme, which provides the solution to the Cauchy problem (1) coming from the vanishing viscosity approach. The numerical scheme reads as in (24), where the numerical flux is now chosen as
● 2-to-1 junction (Section 4.3): we follow [13] so that, exploiting the notation introduced in (9), setting
for k<−1,ℓ=ℓ1,ℓ2:ρn+1ℓ,k= ρnℓ,k−λ[Fℓ(ρnℓ,k,ρnℓ,k+1)−Fℓ(ρnℓ,k−1,ρnℓ,k)],for k>1:ρn+1r,k= ρnr,k−λ[Fr(ρnr,k,ρnr,k+1)−Fr(ρnr,k−1,ρnr,k)],for k=−1,ℓ=ℓ1,ℓ2:ρn+1ℓ,−1= ρnℓ,−1−λ[ˆγnℓ−Fℓ(ρnℓ,−2,ρnℓ,−1)],for k=0:ρn+1r,0= ρnr,0−λ[Fr(ρnr,0,ρnr,1)−ˆγnr]. |
● 1-to-2 junction (Section 5): as already recalled in Section 2.3, we use two different schemes, satisfying different rules at the junction.
For both rules, the scheme amounts to the following:
for k<−1:ρn+1ℓ,k= ρnℓ,k−λ[Fℓ(ρnℓ,k,ρnℓ,k+1)−Fℓ(ρnℓ,k−1,ρnℓ,k)],for k>1,r=r1,r2:ρn+1r,k= ρnr,k−λ[Fr(ρnr,k,ρnr,k+1)−Fr(ρnr,k−1,ρnr,k)],for k=−1:ρn+1ℓ,−1= ρnℓ,−1−λ[γnℓ−Fℓ(ρnℓ,−2,ρnℓ,−1)],for k=0,r=r1,r2:ρn+1r,0= ρnr,0−λ[Fr(ρnr,0,ρnr,1)−γnr], |
with the above choices of
We consider the case of a junction with one incoming road with 2 lanes and one outgoing road with 3 lanes, see Figure 3. For the multilane model, this corresponds to problem (12)–(16)–(19) with
Case 1. We choose
ρo,1(x)= 0.6,ρo,2(x)= 0.4,ρo,3(x)= 0.5∗χ[0,+∞[(x), | (25) |
while the initial datum for the LWR model is given by the sum of the above functions, thus
ρo(x)=1∗χ]−∞,0[(x)+1.5∗χ[0,+∞[(x), |
corresponding to the critical densities of the flux functions
Figure 5, left, displays the solutions of the considered models at time
Concerning the solution of the multilane model, the low value of the sum of the densities right downstream
We make a second comparison between the LWR and the multilane model, namely we take the latter in the form of the average of the densities on the various lanes. In this way, the maximal density for the LWR model equals
ρo(x)=0.5, |
which corresponds to the critical density of the flux function on both incoming and outgoing lanes. Figure 5, right, displays the solutions at time
Recall that, by [14,Lemma 2.3], the multilane model (12)–(16)–(19) preserves the total number of vehicles over time. This property is clearly valid when considering the multilane model in the form of the sum of densities on the various lanes. However, this second type of comparison considering the average of the densities on the various lanes implies that the total number of vehicles is not conserved anymore through the junction: indeed, the total mass is divided by the number of lanes, which is equal to
Case 2. We choose now
We consider the case of a junction consisting of two incoming roads with 2 lanes each and one outgoing road with 2 lanes, that is problem (12)–(17)–(19), with
ρo,1(x)= 0.6χ]−∞,0](x)+1χ]0,+∞[(x),ρo,2(x)= 0.4,ρo,3(x)= 0.6χ]−∞,0](x)+0.8χ]0,+∞[(x),ρo,4(x)= 0.4χ]−∞,0](x)+1χ]0,+∞[(x), | (26) |
with the additional assumption that there is no flow of vehicles between the second and the third lane on
ρo,ℓ1(x)= 1,ρo,ℓ2(x)= 1,ρo,r(x)= 1.2, | (27) |
since road
Figure 10 displays the solution on each road at time
In this section, we aim to compare the LWR model on a one-to-two (diverging) junction with a multilane model different from the one considered in Section 3. Indeed, we need to account for the drivers' routing preferences upstream, a feature that is not included in the multilane model (12)–(18).
The specific multilane junction is displayed in Figure 12: there are one incoming road with two lanes and two outgoing roads, with one lane each. The core idea is to consider a multi-population model [5,10], where each population is identified by its desired final destination. In the particular case under consideration, we have two populations, which coexist upstream
Our multilane multi-population model is the following: given the initial data
ρ1o,1(x)= αρo,1(x)χ]−∞,0](x),ρ2o,1(x)= (1−α)ρo,1(x)χ]−∞,0](x),ρ1o,2(x)= αρo,2(x)χ]−∞,0](x),ρ2o,2(x)= (1−α)ρo,2(x)χ]−∞,0](x), | (28) |
where
{∂tρ11+∂x(ρ11v1(ρ1))= Kρ12max{1−ρ1,0}|x|χ]−∞,0[(x),∂tρ21+∂x(ρ21v1(ρ1))= −Kρ21max{1−ρ2,0}|x|χ]−∞,0[(x),∂tρ12+∂x(ρ12v2(ρ2))= −Kρ12max{1−ρ1,0}|x|χ]−∞,0[(x),∂tρ22+∂x(ρ22v2(ρ2))= Kρ21max{1−ρ2,0}|x|χ]−∞,0[(x), | (29) |
where
We observe that a close model which describes traffic on a multilane highway under the hypotheses that traffic is neither perfectly FIFO nor perfectly non-FIFO has been introduced in [22]. Here, we compare the multilane multi-population model (29) to the LWR model for a diverging junction, both in the case of a FIFO rule and of a non-FIFO rule at the junction, see Section 2.3. The incoming roads are paired together, and denoted by the subscript
ρo,ℓ(x)= (ρo,1(x)+ρo,2(x))χ]−∞,0](x),ρo,r1(x)= ρo,1(x)χ]0,+∞[(x),ρo,r2(x)= ρo,2(x)χ]0,+∞[(x). | (30) |
We detail here the numerical scheme exploited for the integration of the multilane multi-population model (29). The scheme is inspired by that presented in [8,21], and the source terms are treated through fractional step.
The space and time mesh are defined as in Section 4.1. The initial data on each lane,
ρ1,01,k= αρ01,k,ρ2,01,k= (1−α)ρ01,k,ρ1,02,k= αρ02,k,ρ2,02,k= (1−α)ρ02,k. |
The solution to the multilane multi-population model (29) is obtained through a Godunov type scheme, with fractional step to account for the source terms. In particular, set
ˆDj(u,w)= {uvj(u+w) if u<θj(w),θj(w)vj(θj(w)+w) if u≥θj(w). |
Then, for
if k<−1:ρi,n+1/2j,k= ρi,nj,k−λ[ρi,nj,kρnj,kF(ρnj,k,ρnj,k+1)−ρi,nj,k−1ρnj,k−1F(ρnj,k−1,ρnj,k)],if k=−1:ρi,n+1/2j,−1= ρi,nj,−1−λ[γnj−ρi,nj,−2ρnj,−2F(ρnj,−2,ρnj,−1)],if k=0:ρn+1j,0= ρnj,0−λ[F(ρnj,0,ρnj,1)−γnj],if k>0:ρn+1j,k= ρnj,k−λ[F(ρnj,k,ρnj,k+1)−F(ρnj,k−1,ρnj,k)], |
with
G(x,u,w)=wmax{1−u,0}|x|χ]−∞,0[(x) |
so that
ρ1,n+11,k= ρ1,n+1/21,k+ΔtG(xk,ρn+1/21,k,ρ1,n+1/22,k),ρ2,n+11,k= ρ2,n+1/21,k−ΔtG(xk,ρn+1/22,k,ρ2,n+1/21,k),ρ1,n+12,k= ρ1,n+1/22,k−ΔtG(xk,ρn+1/21,k,ρ1,n+1/22,k),ρ2,n+12,k= ρ2,n+1/22,k+ΔtG(xk,ρn+1/22,k,ρ2,n+1/21,k). |
The first example we take into account considers a fully congested outgoing road. We choose
ρo,1(x)= 0.6χ]−∞,0](x)+0.4χ]0,+∞[(x),ρo,2(x)= 0.7χ]−∞,0](x)+1χ]0,+∞[(x), | (31) |
and through (30) we recover the initial data for the corresponding LWR model (1).
Figure 13 displays the solution on each road at time
In this second example, none of the outgoing lane is fully congested. We keep the same parameters as before, thus
ρo,1(x)= 0.6χ]−∞,0](x)+0.4χ]0,+∞[(x),ρo,2(x)= 0.7χ]−∞,0](x)+0.8χ]0,+∞[(x), | (32) |
which differ from (31) only in the density on the second road downstream
Figure 14 displays the solution on each road at time
[1] |
Adimurthi and G. D. V. Gowda, Conservation law with discontinuous flux, J. Math. Kyoto Univ., 43 (2003), 27–70. doi: 10.1215/kjm/1250283740
![]() |
[2] |
Godunov-type methods for conservation laws with a flux function discontinuous in space. SIAM J. Numer. Anal. (2004) 42: 179-208. ![]() |
[3] |
Optimal entropy solutions for conservation laws with discontinuous flux-functions. J. Hyperbolic Differ. Equ. (2005) 2: 783-837. ![]() |
[4] |
Traffic flow on a road network. SIAM J. Math. Anal. (2005) 36: 1862-1886. ![]() |
[5] |
A destination-preserving model for simulating Wardrop equilibria in traffic flow on networks. Netw. Heterog. Media (2015) 10: 857-876. ![]() |
[6] |
On scalar conservation laws with point source and discontinuous flux function. SIAM J. Math. Anal. (1995) 26: 1425-1451. ![]() |
[7] |
Scalar conservation laws with discontinuous flux function. I. The viscous profile condition. Comm. Math. Phys. (1996) 176: 23-44. ![]() |
[8] |
A. Festa and P. Goatin, Modeling the impact of on-line navigation devices in traffic flows, 2019 IEEE 58th Conference on Decision and Control (CDC), Nice, France (2019), 323–328. doi: 10.1109/CDC40024.2019.9030208
![]() |
[9] | M. Garavello, K. Han and B. Piccoli, Models for Vehicular Traffic on Networks, AIMS Series on Applied Mathematics, 9, American Institute of Mathematical Sciences (AIMS), Springfield, MO, 2016. |
[10] |
Source-destination flow on a road network. Commun. Math. Sci. (2005) 3: 261-283. ![]() |
[11] | M. Garavello and B. Piccoli, Traffic Flow on Networks. Conservation Laws Models, AIMS Series on Applied Mathematics, 1, American Institute of Mathematical Sciences (AIMS), Springfield, MO, 2006. |
[12] |
Solution of the Cauchy problem for a conservation law with a discontinuous flux function. SIAM J. Math. Anal. (1992) 23: 635-648. ![]() |
[13] |
Speed limit and ramp meter control for traffic flow networks. Eng. Optim. (2016) 48: 1121-1144. ![]() |
[14] |
A multiLane macroscopic traffic flow model for simple networks. SIAM J. Appl. Math. (2019) 79: 1967-1989. ![]() |
[15] |
A mathematical model of traffic flow on a network of unidirectional roads. SIAM J. Math. Anal. (1995) 26: 999-1017. ![]() |
[16] |
H. Holden and N. H. Risebro, Front Tracking for Hyperbolic Conservation Laws, Applied Mathematical Sciences, 152, Springer, Heidelberg, 2015. doi: 10.1007/978-3-662-47507-2
![]() |
[17] |
Models for dense multilane vehicular traffic. SIAM J. Math. Anal. (2019) 51: 3694-3713. ![]() |
[18] | K. H. Karlsen, N. H. Risebro and J. D. Towers, L1stability for entropy solutions of nonlinear degenerate parabolic convection-diffusion equations with discontinuous coefficients, Skr. K. Nor. Vidensk. Selsk., (2003), 1–49. |
[19] |
On kinematic waves. II. A theory of traffic flow on long crowded roads. Proc. Roy. Soc. London. Ser. A. (1955) 229: 317-345. ![]() |
[20] |
Shock waves on the highway. Operations Res. (1956) 4: 42-51. ![]() |
[21] |
Discrete-time system optimal dynamic traffic assignment (SO-DTA) with partial control for physical queuing networks. Transportation Science (2018) 52: 982-1001. ![]() |
[22] |
A multilane junction model. TRANSPORTMETRICA (2012) 8: 243-260. ![]() |
[23] |
Convergence of a difference scheme for conservation laws with a discontinuous flux. SIAM J. Numer. Anal. (2000) 38: 681-698. ![]() |
1. | John D. Towers, An explicit finite volume algorithm for vanishing viscosity solutions on a network, 2022, 17, 1556-1801, 1, 10.3934/nhm.2021021 | |
2. | D. N. Saliev, I. S. Damyanov, 2024, 3078, 0094-243X, 050004, 10.1063/5.0208304 | |
3. | Pierre Cardaliaguet, Nicolas Forcadel, Régis Monneau, A class of germs arising from homogenization in traffic flow on junctions, 2024, 21, 0219-8916, 189, 10.1142/S0219891624500073 |