Dynamic traffic metering in urban street networks: Formulation and solution algorithm

Mohebifard, Rasool; Hajbabaie, Ali

doi:10.1016/j.trc.2018.04.027

Cited by 24 publications

(10 citation statements)

References 36 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…where u i (t) ∈ Z ≥0 is the inlet flow which is defined as the number of vehicles entering the traffic network through inlet i during the time interval [t, t + 1). The computed optimal inflows can be implemented by means of network gates, i.e., ramp meters [37], [38] for highways and metering gates [39] for urban streets). In (4), q j,i λ(t) is the fraction of outflow of lane j directed toward lane i during the time interval [t, t + 1), which is…”

Section: Macroscopic Traffic Flow Modelmentioning

confidence: 99%

MPC-Based Emergency Vehicle-Centered Multi-Intersection Traffic Control

Hosseinzadeh

Sinopoli

Kolmanovsky

et al. 2023

IEEE Trans. Contr. Syst. Technol.

View full text Add to dashboard Cite

This paper proposes a traffic control scheme to alleviate traffic congestion in a network of interconnected signaled lanes/roads. The proposed scheme is emergency vehicle-centered, meaning that it provides an efficient and timely routing for emergency vehicles. In the proposed scheme, model predictive control is utilized to control inlet traffic flows by means of network gates, as well as configuration of traffic lights across the network. Two schemes are considered in this paper: i) centralized; and ii) decentralized. In the centralized scheme, a central unit controls the entire network. This scheme provides the optimal solution, even though it might not fulfil real-time computation requirements for large networks. In the decentralized scheme, each intersection has its own control unit, which sends local information to an aggregator. The main responsibility of this aggregator is to receive local information from all control units across the network as well as the emergency vehicle, to augment the received information, and to share it with the control units. Since the decision-making in decentralized scheme is local and the aggregator should fulfil the above-mentioned tasks during a traffic cycle which takes a long period of time, the decentralized scheme is suitable for large networks, even though it may provide a sub-optimal solution. Extensive simulation studies are carried out to validate the proposed schemes, and assess their performance. Notably, the obtained results reveal that traveling times of emergency vehicles can be reduced up to ∼50% by using the centralized scheme and up to ∼30% by using the decentralized scheme, without causing congestion in other lanes.

show abstract

Section: Macroscopic Traffic Flow Modelmentioning

confidence: 99%

MPC-Based Emergency Vehicle-Centered Multi-Intersection Traffic Control

Hosseinzadeh

Sinopoli

Kolmanovsky

et al. 2023

IEEE Trans. Contr. Syst. Technol.

View full text Add to dashboard Cite

show abstract

“…The algorithm iterates between the two sub-problems until the convergence criteria is met. For more details see Mohebifard and Hajbabaie [46].…”

Section: E Benchmarkmentioning

confidence: 99%

Network-Level Coordinated Speed Optimization and Traffic Light Control for Connected and Automated Vehicles

Tajalli

Mehrabipour

Hajbabaie

2021

IEEE Trans. Intell. Transport. Syst.

Self Cite

View full text Add to dashboard Cite

This study develops a methodology for coordinated speed optimization and traffic light control in urban street networks. We assume that all vehicles are connected and automated. The signal controllers collect vehicle data through vehicle to infrastructure communications and find optimal signal timing parameters and vehicle speeds to maximize network throughput while harmonizing speeds. Connected and automated vehicles receive these dynamically assigned speeds, accept them, and implement them. The problem is formulated as a mixed-integer non-linear program and accounts for the trade-offs between maximizing the network throughput and minimizing speed variations in the network to improve the network operational performance and at the same time smoothen the traffic flow by harmonizing the speed and reducing the number of stops at signalized intersections. A distributed optimization scheme is developed to reduce the computational complexity of the proposed program, and effective coordination ensures nearoptimality of the solutions. The case study results show that the proposed algorithm works in real-time and provides nearoptimal solutions with a maximum optimality gap of 5.4%. The proposed algorithm is implemented in Vissim. The results show that coordinated signal timing and speed optimization improved network performance in comparison with cases that either signal timing parameters or average speed of vehicles are optimized. The coordinated approach reduced the travel time, average delay, average number of stops, and average delay at stops by 1.9%, 5.3%, 28.5%, and 5.4%, respectively compared to the case that only signal timing parameters are optimized.

show abstract

“…This section presents a linearized formulation for the SODTA problem based on the CTM network loading concept. We have used the CTM in our previous work for signal timing optimization (Mehrabipour & Hajbabaie, ; Mehrabipour, ), speed harmonization (Tajalli & Hajbabaie, , ), and traffic metering (Mohebifard & Hajbabaie, , ; Mohebifard, Islam, & Hajbabaie, ). We first define the temporal and spatial distribution of the problem.…”

Section: Problem Formulationmentioning

confidence: 99%

A decomposition scheme for parallelization of system optimal dynamic traffic assignment on urban networks with multiple origins and destinations

Mehrabipour

Hajibabai

Hajbabaie

2019

Computer aided Civil Eng

Self Cite

View full text Add to dashboard Cite

This paper presents a decomposition scheme to find near‐optimal solutions to a cell transmission model‐based system optimal dynamic traffic assignment problem with multiple origin‐destination pairs. A linear and convex formulation is used to define the problem characteristics. The decomposition is designed based on the Dantzig–Wolfe technique that splits the set of decision variables into subsets through the construction of a master problem and subproblems. Each subproblem includes only a single origin‐destination pair with significantly less computational burden compared to the original problem. The master problem represents the coordination between subproblems through the design of interactive flows between the pairs. The proposed methodology is implemented in two case study networks of 20 and 40 intersections with up to 25 origin‐destination pairs. The numerical results show that the decomposition scheme converges to the optimal solution, within 2.0% gap, in substantially less time compared to a benchmark solution, which confirms the computational efficiency of the proposed algorithm. Various network performance measures have been assessed based on different traffic state scenarios to draw managerial insights.

show abstract

Dynamic traffic metering in urban street networks: Formulation and solution algorithm

Cited by 24 publications

References 36 publications

MPC-Based Emergency Vehicle-Centered Multi-Intersection Traffic Control

MPC-Based Emergency Vehicle-Centered Multi-Intersection Traffic Control

Network-Level Coordinated Speed Optimization and Traffic Light Control for Connected and Automated Vehicles

A decomposition scheme for parallelization of system optimal dynamic traffic assignment on urban networks with multiple origins and destinations

Contact Info

Product

Resources

About