2017
DOI: 10.3934/dcds.2017225
|View full text |Cite
|
Sign up to set email alerts
|

The Riemann Problem at a Junction for a Phase Transition Traffic Model

Abstract: We extend the Phase Transition model for traffic proposed in [8], by Colombo, Marcellini, and Rascle to the network case. More precisely, we consider the Riemann problem for such a system at a general junction with n incoming and m outgoing roads. We propose a Riemann solver at the junction which conserves both the number of cars and the maximal speed of each vehicle, which is a key feature of the Phase Transition model. For special junctions, we prove that the Riemann solver is well defined.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
17
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 8 publications
(17 citation statements)
references
References 20 publications
(40 reference statements)
0
17
0
Order By: Relevance
“…see Figure 1. As in [6,9], we assume the following hypotheses. Figure 1: The free phase F and the congested phase C resulting from (2.1) in the coordinates, from left to right, (ρ, η) and (ρ, ρv).…”
Section: Notations and The Riemann Problem On A Single Roadmentioning
confidence: 99%
See 4 more Smart Citations
“…see Figure 1. As in [6,9], we assume the following hypotheses. Figure 1: The free phase F and the congested phase C resulting from (2.1) in the coordinates, from left to right, (ρ, η) and (ρ, ρv).…”
Section: Notations and The Riemann Problem On A Single Roadmentioning
confidence: 99%
“…With a limit-average procedure, we are able to find the relation between the incoming maximal speeds and the outgoing one. In this way, the maximal outgoing speed turns out to be a convex combination of the n incoming ones and it satisfies the corresponding condition prescribed by the Riemann solver in [9].…”
Section: Introductionmentioning
confidence: 96%
See 3 more Smart Citations