/ / Article

Research Article | Open Access

Volume 2020 |Article ID 3959613 | https://doi.org/10.1155/2020/3959613

Tolesa Hundesa Muleta, Legesse Lemecha Obsu, "Analysis of Traffic Evolution on Road Networks of a Roundabout", Journal of Applied Mathematics, vol. 2020, Article ID 3959613, 18 pages, 2020. https://doi.org/10.1155/2020/3959613

Accepted11 Sep 2020
Published05 Oct 2020

#### Abstract

In this paper, the analyses of traffic evolution on the road network of a roundabout having three entrances and three exiting legs are conducted from macroscopic point of view. The road networks of roundabouts are modeled as a merging and diverging types and junctions. To study traffic evolution at junction, two cases have been considered, namely, demand and supply limited cases. In each case, detailed mathematical analysis and numerical tests have been presented. The analysis in the case of demand limited showed that rarefaction wave fills the portion of the road network in time. In the contrary, in supply limited case, traffic congestion occurs at merging junctions and shock wave propagating back results in reducing the performance of a roundabout to control traffic dynamics. Also, we illustrate density and flux profiles versus space discretization at different time steps via numerical simulation with the help of Godunov scheme.

#### 1. Introduction

Macroscopic traffic flow model was first introduced in the 1950s due to the seminal work of Lighthill and Whitham  and independently by Richards . The model describes the progression of traffic density by the means of macroscopic characteristic governed by scalar conservation law . Such modeling approach is also known as LWR model in traffic literature and has been extended to road network with incorporating appropriate boundary condition at junction by several authors, see for example in  and references cited therein.

Worldwide, traffic congestion has been a significant challenging problem related to transportation in most urban areas. This is mainly due to rapid increase of motorizations and limited carrying capacity of urban road networks. Congestion is worsen at road intersections during peak hours. Thus, congestion leads to delays in the movement of both goods and passengers [14, 15]. As a result, it affects the development of a national economy . Real-time and precise prediction models are capable of analyzing traffic flow trends and characteristics on urban road network [17, 18].

Roundabouts are special road network with a one-directional circulatory around a central island. It is another means of regulating traffic evolutions at road intersections rendering better safety relative to conventional road intersections . A three entering and three exiting roundabout can be described as a chain of junctions with two incoming and one exiting roads and one incoming and two exiting roads . The dynamics of traffic on the road network of a roundabout is assumed to be governed by nonlinear scalar hyperbolic conservation laws. Usually, vehicles on the main lane of the roundabout have priority over those entering a junction from external entering roads .

The aim of this paper is to investigate traffic evolution on the road networks of a roundabout having three entering and three exiting roads by extending the work introduced in . Then, we analyze the efficiency of a roundabout in regulating traffic dynamics under different priority parameters. We used Godunov scheme  for simulation purposed as detailed in .

The content of this work is structured as follows. In Section 2, we present a mathematical model describing traffic evolution on a road network of a roundabout having three entering and three exiting roads. In Section 3, we discuss Riemann Solver at junctions. In Section 4, we analyze the traffic evolution on the road networks of a roundabout both in demand and supply limited cases, respectively. The obtained analytical results are illustrated through numerical simulations in Section 5. Finally, we give conclusion in Section 6.

#### 2. Mathematical Model

In this section, we describe road networks of a roundabout having three entering and three exiting roads as indicated in Figure 1. As displayed in Figure 1, the road networks of roundabout can be seen as an oriented graph in which roads are represented by arcs and junctions by vertices.

Each road segment forming main lane, entering, and exiting roads of a roundabout can be modeled by intervals , , and , , , where Ii denotes the finite collection of entering and exiting road segments and Si denotes the collection of roads on the main lane of the roundabout as illustrated in Figure 2(a). In this setting, we assume that ai tends to −∞ for all and tends to ∞ for all , . For convenience, we also assume that , , and , . The types of merging and diverging junctions are presented in Figure 2(b).

The dynamics of traffic on each road segment is governed by LWR model given as where is the mean traffic density and is the maximal traffic density allowed on each road. The speed-density relationship is given by where is the maximal speed on each road and is a smooth decreasing function denoting the mean traffic speed. The flux density relationship is defined by

The flux is maximum at . In this paper, we use the normalized form of the vehicle density to be , and we assume the following: (1)(2)The speed depends only on the density (3)The flux is a strictly concave function(4)

Assumptions (A3) and (A4) imply that has a unique maximum point for all .

We briefly recall the following definition to be used in later sections.

Definition 1 (see ). Let be the map such that (i) for every and for every .

Definition 2. Consider a roundabout with 6 road segments on the main lane with 3 entrance and 3 exit links as given in Figure 1(b). A collection of functions is an admissible solution to (1) as in  if (1) is a weak solution on , i.e., , such thatfor every . (2)ρi satisfies the Kruzhkov entropy condition  on , that is(3)At each junctionwhere n,m ∈ {1,2} and i and j indicate all the links belonging to a junction. In particular, i indicates the incoming links, and m indicates the exiting ones. Also, bi − represents left side of bi while ai + denotes the right side of ai.

#### 3. Riemann Problem at Junction

In this section, we briefly describe construction of Riemann solver at junctions.

Definition 3. A Riemann problem at a junction is a Cauchy problem for constant initial data on each road. Consistency condition: The detail analysis can be found in .

Definition 4 (see . A Riemann solver for junction is a map that associates the Riemann data ρ0 = (ρ1,02,03,0) at to a vector such that the solution on the incoming road , is given by the wave and on the exiting road ; the solution is given by the wave .
For the entering road, the solution ρi(t,x) over its particular domain x < bi is given by the solution to the Riemann problem Similarly, for the exiting road, the solution ρj(t,x) over its domain x > aj is given by the solution to the Riemann problem Moreover, there exists a unique such that On the entering road for i =1,2, the solution is given by the wave and On the exiting road for j =3, the solution is given by the wave .
On the incoming road : (i)If and then the solution of the Riemann problem consists of a shock wave with a negative speed(ii)If , then the solution consists of contact waveOn the exiting road : (iii)If , then the solution of the Riemann problem consists of a shock wave with a positive speed. If , then the solution of the Riemann problem consists of a shock wave with a positive speed and contact wave when .

##### 3.1. Conditions for Junction Type

In this case, we apply traffic distribution ratio α ∈ (0,1) which express the distribution of traffic among exiting roads based on the preference of drivers at each junction . The Riemann initial data is also denoted by for entering roads and for exiting roads. We represent the unique solution at junction, i.e., at x = bi for entering and x = ai for exiting roads, by . Traffic flux on the entering road segment is defined by f(ρi,0) = γi,0 satisfying the following Coclite, Garavello, and Piccoli (CGP) conditions [11, 20] at junction for each distribution ratio with and convex set Ωi: (1)(2)Maximize with respect to (1)(3).

Using , we obtain

##### 3.2. Conditions for Junction Type

In this case, traffic distribution matrix and conservation law alone cannot give unique solution at junction. For this reason, we introduce the priority parameters p ∈ (0,1) at junction type, , two entering and one exiting roads. We assume that all cars cannot enter the exiting road at the time. The purpose of priority parameters is to regulate the condition that neither impose insufficient flows nor send excess vehicles than the carrying capacity of the roads. Assume that is the number vehicles that can enter the junction. Then, pN cars come from the first entering road and (1 − p)N cars from the second entering roads. Then, the solution of the Riemann problem (ρ1,0, ρ2,0, ρ3,0) is formed by a single wave on each road connecting the initial states to (ρˆ1, ρˆ2, ρˆ3) be determined in the following way. The aim is to maximize traffic flux satisfying:

Now let and be traffic flux on the exiting road such that Then, it follows that the intersection point of line (16) and is occurred at such that

In the case of Figure 3(a), there is no intersection neither inside nor outside the feasible region. This is occurred in the demand limited case. On the contrary, Figure 3(b) shows intersection occurred inside the feasible region Ω which indicates supply limited. In the case of Figures 3(c) and 3(d), the intersection point is occurred outside Ω which indicates supply limited case. A similar analysis study on Riemann solver also discussed in .

Note that in Figure 3, is the point of segment Ω ∩ {(γˆ1ˆ2): γ1 + γ2 = γˆ3} closest to line in equation (16). We compute fluxes at the junction based on the following cases: (1)If , we have to look for γ1 and γ2 such that

The unique solution is found to be , , and . (2)If c1 + c2 ≥ c3, we have to look for γ1 and γ2 such that

#### 4. Roundabout with Demand and Supply Limited

To study the nature of traffic evolution on the roundabout, we focus separately in the case of light traffic and heavy traffic.

Assumption 5. To avoid unnecessary complexity, we make the following assumptions. (1)Complete turn or U-turn on the roundabout is not allowed(2)There is no obstacle at the exit road of the roundabout(3)Initially, the network of the roundabout is emptyThe model proposed in  is applied to a traffic circle with two entering and two exiting roads. The authors computed asymptotic fluxes and then compared the result with traffic light. Analyzing traffic dynamics in the case of traffic circle with two entering and two exiting is very simple compared to a roundabout with three entering and three exiting roads. Further, the priority parameter is applied only at two junctions which is easily computed. In the case of a roundabout with three entering and three exiting roads, computing shock wave on the roundabout is very complicated. So, in this section, we will analyze shock wave on the roundabout via demand and supply limited cases.

##### 4.1. Demand Limited Case

In this case, we assume that traffic arriving at junctions of a roundabout as illustrated in Figure 1 is less, in the sense that the number of cars reaching the roundabout is less than the optimal carrying capacity of a roundabout. Thus, the junction stays demand limited, and we do not need priority rule in this situation. The traffic evolution is only governed by conservation law. However, we assign traffic distribution matrix to describe how traffic coming from the entering roads , choose to distribute to their corresponding intermediate roads and external exiting roads. Hence, we have the following assumptions .

Assumption 6. We assume three fixed parameter αi ∈ (0,1) for i =1,2,3 such that (a)If cars reach the roundabout from , then drive to road and drive to road (b)If cars reach the roundabout from , then drive to road and drive to road (c)If cars reach the roundabout from , then drive to road and drive to road Let and be constant densities on the external entering roads , respectively. In the demand limited case, this situation is equivalent to equilibrium state. In this setting, we define periodic boundary condition at junction as Further, let denotes traffic flux on the roads network of a roundabout. Then, the constant fluxes on each road do not exceed the maximum flux , that is, If of the flux leaves the roundabout at junction , the remaining will continue on the links of a roundabout until reaching the next exiting road as depicted in Figure 4.

Theorem 7. Consider a roundabout with three entering and three exiting roads as displayed in Figure 4. Then, there exists time dependent coefficient . Provided that the boundary condition hold at and the solution ρ(t) is constantly equal to that of Figure 4 for t ≥ T >0.

Proof. Since by its nature, the traffic behavior is time dependent, and thus, it is common to assume that αi varies with time. This means, we move forward in time to construct the solution of Riemann problem at each junction and joined them together. By assumption, the traffic evolution is light on the roundabout. This implies that the cars from roads I1, I2, and I3 reach either of the existing roads I4, I5, and I6 through rarefaction wave. At each time step, rarefaction waves reach either of the junction J1, J3, or J5. We regulate the corresponding traffic distribution coefficient in such a way that cars reach the correct road. Further, the existence of such coefficient is also depends on driver’s preference. Thus, the crossing coefficients at equilibrium situations are (i)(S1,I4,S2)(ii)(S3,I5,S4)(iii)(S5,I6,S6)A car started from I1 reach I4 and I5. Then, we set αS1,4 = α1 and αS1,S2 = (1 − α1). A car started from I2 reach I5 and I6. Then, we set αS3,5 = α2 and αS3,S4 = (1 − α2). A car started from I3 reach I6 and I4. Then, we put αS5,6 = α3 and αS5,S6 = (1 − α3). Under the given assumption, we modify in time the distribution coefficient. With such choice, one can find a time so that the solution is given by the flux indicated in Figure 4 hold for each t ≥ T. This completes the proof.

##### 4.2. Supply Limited Case

In this case, we have possible traffic jams if the constant fluxes on each road in Figure 4 do exceed the maximum flux f(ρc), such that fρ1) + (1 − α3)fρ3) > f(ρc), fρ2) + (1 − α1)fρ1) > f(ρc), and fρ3) + (1 − α2)fρ2) > f(ρc) conditions hold. Instantaneously, shocks are produced on road networks of the roundabout at junctions J1, J3, and J5.

Now suppose that 0 < pi< 1,i =1,2,3 be the priority parameter applied at merging junctions J1, J3, and J5. Assume further that

For simplicity, we take a: = (1 − α1), b: = (1 − α2), c: = (1 − α3), and fi: = fρi), i =1,2,3 to be used in the following theorem. We summarized junction wave interaction in Table 1.

 Derivation Case 1 Case 2 Case 3 . Interpretation Shock produced on not on Shock produced on and Shock produced on not on Interpretation Shock produced on not on Shock produced on and Shock produced on not on Interpretation Shock produced on not on Shock produced on and Shock produced on not on

Assume that we are in case 1 as given in Table 1 at junctions J1, J3, and J5. Then, rarefaction waves are produced on roads S2, S4, and S6. These rarefaction waves decrease the traffic density at their respective junctions, and thus, the road network of the roundabout is not congested. Thus, we have proved the follow result.

Theorem 8. Suppose that be priority parameters at , and of the roundabout, respectively, such that at these junctions, then traffic flux on the road networks of a roundabout never jammed.

Next, we give detailed analysis at each junction when the situation is fully supply limited.

This corresponds to case 2 of Table 1 at junctions J1, J3, and J5. Since a shock is produced on all entering roads at each junctions, then rarefaction are produced on roads S2, S4, and S6. We present this situation case by case as follows.

###### 4.2.1. Case (i)

The flux on road S1 composed of p1f(ρc) from road I1 and (1 − p1)f(ρc) from road S6. Since α1 of the flux from road S1 exists through roads I4, the part of the flux on S1 is α1p1f(ρc) + (1 − p1)f(ρc) = (1 − ap1)f(ρc) that exits to road I4. All flux from road S6 leave the system through road I4. The remaining flux ap1f(ρc) will proceed to road S2. In terms of traffic distribution matrix, this is equivalent to saying that αS21 = ap1. Since the shock wave produced on the entering road propagates back with negative speed, then the shock produced at junction J3 reaches J2. Thus, we have a shock on S1. We displayed wave junction interaction in Figure 5.

The values of traffic flux on road S1 just after the shock junction interaction are equal to where represents the value of the flux on road after the shock junction intersection. Also, after interaction, the traffic flux on is . All the flux from road leave the network of the roundabout through .

###### 4.2.2. Case (ii)

The flux on S3 is composed of p2f(ρc) from road I2 and (1 − p2) from road S2. Since α2 of the flux exit the system of the roundabout through I5, the flux that leave the network of the roundabout through I5 equal to α2p2f(ρc) + (1 − p2)f(ρc) = (1 − bp2)f(ρc). The remaining flux (1 − α2)p2f(ρc) will go to S4. This is equivalent to saying that αS43 = (1 − α2)p2. As a consequence of backward propagation of shock on the entering road, the shock produced at junction J5 reaches junction J4; then, we have a shock on road S4. On the other hand, the flux on road S5 composed of p3f(ρc) from road I3 and (1 − p3)f(ρc) from road S4. Therefore, the value of traffic flux on road segment S3 just after the shock junction interaction becomes:

Again, just after shock junction interaction, the traffic flux on the entering road is given by . Furthermore, the flux on road contains from the entering road and from road . Thus, the flux on can be expressed as .

###### 4.2.3. Case (iii)

Similarly, the traffic flux on road S5 composed of p3f(ρc) from road I3 and (1 − p3)f(ρc) from main road S4. But α3 of the traffic flux from the entering road I3 leaves the roundabout through I6 which amounts to α3p3f(ρc) + (1 − p3)f(ρc) = (1 − cp3)f(ρc). The remaining traffic flux cp3f(ρc) moves to road S6. In terms of traffic distribution matrix, this amounts to αS56 = (1 − α3)p3, with similar analysis as previous cases, the value of the traffic on road S5 just after wave junction interactions

The traffic flux on road equals to after shock junction interaction. Similarly, on the entering road , we have . Thus, the shocks are produced on the whole roads of the roundabout recursively and compactly in matrix form

Since the new shock induced on the roads S1, S3, and S5 of the roundabout, then we focus only on the matrix formed by , , and denoted by . The eigenvalue of the matrix are

Moreover, at junctions , and , respectively, we can observe that

Furthermore, from

From equations (30) and (31), we obtain

Simplifying, we get

Since all are positive quantities, multiplication does not influence the inequalities. That is,

Equivalently,

From traffic point of view, , and suggest that flow is congested but not jammed. That means, , and , as illustrated in case of , and . Even though excess traffic flux on the entering roads, the roundabout is not stuck. Thus, we proved the following result.

Proposition 9. Assume that
and are satisfied for and for all the right of way parameters . If then the traffic flow on the roundabout does not stuck.

Proposition 10. If then the traffic flow on the roundabout is not jammed.

Proof. From case (iii) we know that , since . Then, . On the other hand, traffic flux on equals , similar for other cases. This implies that all the traffic flux are entered the junction smoothly. Thus, it attains maximum flow.
Finally, we consider case 3 given Table 1. If the strict inequality hold at all junctions , , and , then rarefactions are produced on the roads , and while shocks are produced on roads , and .

Proposition 11. If , then the traffic flux on the roundabout is completely jammed.

Proof. Following the arrangement given under case 2, we get the following inequalities: This is the same as saying From this, we conclude that

#### 5. Numerical Simulations

In this section, we present numerical scheme used to solve problem given in (1). We define a numerical grid in using the following notation: is the fixed grid space, is the time step given by the CFL condition and for and are the grid points. Each road is divided into cells numbered from to . The first and last cells of an edge are always a junction, and we assume that these cells are ghost cells. The scheme used for solving equation (1) is the Godunov scheme as introduced in [20, 23] and it is based on exact solutions to the Riemann problem. The main idea of this method is to approximate the initial datum by a piecewise constant function; then, the corresponding Riemann problems are solved exactly, and a global solution is obtained by piecing them together. Under the CFL (Courant-Friedrichs-Lewy) condition, it holds: where is the speed of the wave of the Riemann problem solution at the interface at the time , the numerical scheme can be written as where the numerical flux for a concave flux function is given by

##### 5.1. Boundary Conditions

Each road is divided in cells numbered from 0 to . For the entering roads, we proceed by setting: while for the exiting ones, we set

##### 5.2. Conditions at the Junctions

From the entering roads which are connected at the junction at the right endpoint, we set while for the exiting ones, connected at the junctions at the left point, we set

##### 5.3. Simulation Results

For simulation purpose, we chose a concave fundamental diagram as introduced in equation (3) with the following values for parameters: , , . We assume that at initial time all the roads are empty and influx at boundary of entering roads are equal to . In the case of demand limited, the traffic evolution is governed by conservation law and the splitting rate to describe how traffic coming from the entering roads choose to distributed to their corresponding intermediate roads and the external exiting roads. Thus, in this case, rarefaction wave fill the portion of the roads of the roundabout. But, in the supply limited case, the traffic congestion can occur at merging junctions and shock wave propagating back, which is the one we simulated in the results.

The results obtained are the evolution of density and flux on entrance roads, on exit roads, roads between merging and diverging junctions, and roads between diverging and merging junctions versus space discretization at different time steps as shown in Figures 68. Figure 9 displays the evolution of traffic density profiles versus priority parameters. In these figures, different colors show different traffic scenarios over simulation time. The blue color corresponds to demand limited case while the red color denotes congested state with value indicated on the color bars. In Figure 6, we illustrate the simulation result corresponds to case 1 at merging junctions and .

Similar to case 1, we performed numerical simulation for case 3. In this case, shock waves are produced on the roads propagating back while rarefaction waves on propagating forward in time. In the next, we describe the simulation results for case 2. In this case, the roundabout under consideration is fully supply limited case as shown in Figures 7 and 8. The shock wave occurred on the entrance roads (), and between diverging and merging junctions of roads () is depicted in Figure 7. As a result, backward propagating shock wave produced between merging and diverging junctions, that is, on the roads () as displayed in Figure 8(a).

Figure 9 shows the evolution of traffic profiles on the entrance road and main roads of a roundabout versus priority parameters for simulation time between . The impact of priority parameters on the external entrance roads is shown in Figure 9(a), and on the main lanes of the roundabout are also displayed in Figure 9(b). Figures 9(c) and 9(d) present density profile on the main lane of a roundabout when priority is given to entering traffic and when priority is also given to traffic on the main lane itself, respectively.

#### 6. Conclusion

In this paper, we presented the analysis of traffic evolution on road network of roundabout with three entering and three exiting roads. The flow of traffic on the whole road network of the roundabout is governed by nonlinear scalar hyperbolic conservation laws or the LWR model. We used traffic distribution matrix at diverging and priority parameters at merging junctions. Also, we investigated the performance of a roundabout in regulating traffic evolution both in the case of demand and supply limited cases with details mathematical analysis. In demand limited case, the number of cars reaching the roundabout is less than the optimal capacity of the roundabout. Thus, the junction stays demand limited, and we did not need priority rule in that situation. The traffic evolution is only governed by hyperbolic conservation laws. However, we assigned traffic distribution ratio to express how traffic coming from the entering roads choose to distributed to their corresponding intermediate roads and the external exiting roads. Since the number of cars reaching the roundabout was greater than the optimal capacity of the roundabout in supply limited case, we have been used priority rule at merging junctions. We solved the problem using the Godunov scheme. Finally, we presented results of simulations of traffic evolution on road network in terms of density and flux versus space discretization at different time steps. The simulation result indicated that rarefaction waves fill the portion of the roads of the roundabout in demand limited case, and the traffic congestion occurs at merging junctions and shock wave propagating back in supply limited case (congested state) which reduced the efficiency of a roundabout in controlling traffic flow problem. The experiment with field study and validation of the model with real data will be considered in the future work.

#### Data Availability

The current study does not involve any data.

#### Disclosure

The contents of this paper reflect the views of the authors’ contribution to prepare, develop, and carry out this manuscript.

#### Conflicts of Interest

We, the authors of the research article entitled “Analysis of Traffic Evolution on Road Networks of a Roundabout,” declare that there is no conflicts of interest in this article.

#### Acknowledgments

This research work was supported by the Hawassa University and Wolaita Sodo University under the Ministry of Education.

1. M. J. Lighthill and G. B. Whitham, “On kinematic waves II. A theory of traffic flow on long crowded roads,” Proceedings of the Royal Society of London. Series A. Mathematical and Physical Sciences, vol. 229, no. 1178, pp. 317–345, 1955. View at: Google Scholar
2. P. I. Richards, “Shock waves on the highway,” Operations Research, vol. 4, no. 1, pp. 42–51, 1956. View at: Google Scholar
3. M. Burger, S. G. Ttlich, and T. Jung, “Derivation of a first order traffic flow model of Lighthill-Whitham-Richards type,” IFAC-PapersOnLine, vol. 51, no. 9, pp. 49–54, 2018. View at: Google Scholar
4. J. Fang, H. Ye, and S. M. Easa, “Modified traffic flow model with connected vehicle microscopic data for proactive variable speed limit control,” Journal of Advanced Transportation, vol. 2019, Article ID 8151582, 11 pages, 2019. View at: Publisher Site | Google Scholar
5. M. Herty, S. Moutari, and G. Visconti, “Macroscopic modeling of multilane motorways using a two-dimensional second-order model of traffic flow,” SIAM Journal on Applied Mathematics, vol. 78, no. 4, pp. 2252–2278, 2018. View at: Publisher Site | Google Scholar
6. T. Hundesa, L. Lemecha, and P. R. Koya, “One-dimensional explicit tolesa numerical scheme for solving first order hyperbolic equations and its application to macroscopic traffic flow model,” Applied Mathematics, vol. 10, no. 3, pp. 119–137, 2019. View at: Publisher Site | Google Scholar
7. N. Laurent-Brouty, G. Costeseque, and P. Goatin, “A coupled PDE-ODE model for bounded acceleration in macroscopic traffic flow models. ifac-papersonline,” IFAC-PapersOnLine, vol. 51, no. 9, pp. 37–42, 2018. View at: Google Scholar
8. A. Rey, W.-L. Jin, and S. G. Ritchie, “An extension of Newell’s simplified kinematic wave model to account for first-in-first-out violation: with an application to vehicle trajectory estimation,” Transportation Research Part C: Emerging Technologies, vol. 109, pp. 79–94, 2019. View at: Publisher Site | Google Scholar
9. X. Xiao and H. Duan, “A new grey model for traffic flow mechanics,” Engineering Applications of Artificial Intelligence, vol. 88, article 103350, 2020. View at: Publisher Site | Google Scholar
10. G. M. Coclite, M. Garavello, and B. Piccoli, “Traffic flow on a road network,” SIAM Journal on Mathematical Analysis, vol. 36, no. 6, pp. 1862–1886, 2005. View at: Publisher Site | Google Scholar
11. M. Garavello and B. Piccoli, Traffic flow on Networks, Volume 1, Springfield: American institute of mathematical sciences, 2006.
12. Z. Dong, C. Yu, D. Jitamitra, H. Y. K. Lau, and S. Srivathsan, “A time-space network flow approach to dynamic repositioning in bicycle sharing systems,” Transportation Research Part B: Methodological, vol. 103, pp. 188–207, 2017. View at: Publisher Site | Google Scholar
13. R. X. Zhong, Y. P. Huang, C. Chen, W. H. K. Lam, D. B. Xu, and A. Sumalee, “Boundary conditions and behavior of the macroscopic fundamental diagram based network traffic dynamics: a control systems perspective,” Transportation Research Part B: Methodological, vol. 111, pp. 327–355, 2018. View at: Publisher Site | Google Scholar
14. A. Selmoune, Q. Cheng, L. Wang, and Z. Liu, “Influencing factors in congestion pricing acceptability: a literature review,” Journal of Advanced Transportation, vol. 2020, Article ID 4242964, 11 pages, 2020. View at: Publisher Site | Google Scholar
15. M. S. Sheikh, J. Liang, and W. Wang, “An improved automatic traffic incident detection technique using a vehicle to infrastructure communication,” Journal of Advanced Transportation, vol. 2020, Article ID 9139074, 14 pages, 2020. View at: Publisher Site | Google Scholar
16. C. Ma, J. Zhou, X. Xu, and J. Xu, “Evolution regularity mining and gating control method of urban recurrent traffic congestion: a literature review,” Journal of Advanced Transportation, vol. 2020, Article ID 5261580, 13 pages, 2020. View at: Publisher Site | Google Scholar
17. Q. Hou, J. Leng, G. Ma, W. Liu, and Y. Cheng, “An adaptive hybrid model for short-term urban traffic flow prediction,” Physica A: Statistical Mechanics and its Applications, vol. 527, p. 121065, 2019. View at: Publisher Site | Google Scholar
18. M. Repoux, M. Kaspi, B. Boyac, and N. Geroliminis, “Dynamic prediction-based relocation policies in one-way station-based carsharing systems with complete journey reservations,” Transportation Research Part B: Methodological, vol. 130, pp. 82–104, 2019. View at: Publisher Site | Google Scholar
19. Q. Yang, Z. Shi, S. Yu, and J. Zhou, “Analytical evaluation of the use of leftturn phasing for single left-turn lane only,” Transportation Research Part B: Methodological, vol. 111, pp. 266–303, 2018. View at: Publisher Site | Google Scholar
20. L. L. Obsu, A. Meurer, S. M. Kassa, and A. Klar, “Modelling pedestrians’impact on the performance of a roundabout,” Neural, Parallel, and Scientific Computations, vol. 24, pp. 317–334, 2016. View at: Google Scholar
21. X. Chen and M. S. Lee, “A case study on multi-lane roundabouts under congestion: comparing software capacity and delay estimates with field data,” Journal of Traffic and Transportation Engineering (English Edition), vol. 3, no. 2, pp. 154–165, 2016. View at: Publisher Site | Google Scholar
22. Y. Chitour and B. Piccoli, “Traffic circles and timing of traffic lights for cars flow,” Discrete and Continuous Dynamical Systems Series B, vol. 5, no. 3, p. 599, 2005. View at: Google Scholar
23. S. K. Godunov, “A difference method for numerical calculation of discontinuous solutions of the equations of hydrodynamics,” Matematicheskii Sbornik, vol. 89, no. 3, pp. 271–306, 1959. View at: Google Scholar
24. R. J. LeVeque, Finite Volume Methods for Hyperbolic Problems, volume 31, Cambridge University Press, 2002.
25. S. N. Kruzhkov, “First order quasilinear equations in several independent variables,” Matematicheskii Sbornik, vol. 123, no. 2, pp. 228–255, 1970. View at: Google Scholar