Dynamics of heterogeneity in urban networks: aggregated traffic modeling and hierarchical control

Real traffic data and simulation analysis reveal that for some urban networks a well-defined Macroscopic Fundamental Diagram (MFD) exists, which provides a unimodal and low-scatter relationship between the network vehicle density and outflow. Recent studies demonstrate that link density heterogeneity plays a significant role in the shape and scatter level of MFD and can cause hysteresis loops that influence the network performance. Evidently, a more homogeneous network in terms of link density can result in higher network outflow, which implies a network performance improvement. In this article, we introduce two aggregated models, region- and subregion-based MFDs, to study the dynamics of heterogeneity and how they can affect the accuracy scatter and hysteresis of a multi-subregion MFD model. We also introduce a hierarchical perimeter flow control problem by integrating the MFD heterogeneous modeling. The perimeter flow controllers operate on the border between urban regions, and manipulate the percentages of flows that transfer between the regions such that the network delay is minimized and the distribution of congestion is more homogeneous. The first level of the hierarchical control problem can be solved by a model predictive control approach, where the prediction model is the aggregated parsimonious region-based MFD and the plant (reality) is formulated by the subregion-based MFDs, which is a more detailed model. At the lower level, a feedback controller of the hierarchical structure, tries to maximize the outflow of critical regions, by increasing their homogeneity. With inputs that can be observed with existing monitoring techniques and without the need for detailed traffic state information, the proposed framework succeeds to increase network flows and decrease the hysteresis loop of the MFD. Comparison with existing perimeter controllers without considering the more advanced heterogeneity modeling of MFD highlights the importance of such approach for traffic modeling and control.     

Recent developments in traffic flow modeling using macroscopic fundamental diagram

ABSTRACT

This paper presents an overview of the recent developments in traffic flow modelling and analysis using macroscopic fundamental diagram (MFD) as well as their applications. In recent literature, various aggregated traffic models have been proposed and studied to analyse traffic flow while enhancing network efficiency. Many of these studies have focused on models based on MFD that describes the relationship between aggregated flow and aggregated density of transport networks. The analysis of MFD has been carried out based on experimental data collected from sensors and GPS, as well as simulation models. Several factors are found to influence the existence and shape of MFD, including traffic demand, network and signal settings, and route choices. As MFD can well express the traffic dynamics of large urban transport networks, it has been extensively applied to traffic studies, including the development of network-wide control strategies, network partitioning, performance evaluation, and road pricing. This work also presents future extensions and research directions for MFD-based traffic modelling and applications.     

Modeling and optimization of multimodal urban networks with limited parking and dynamic pricing

Cruising-for-parking constraints mobility in urban networks. Car-users may have to cruise for on-street parking before reaching their destinations. The accessibility and the cost of parking significantly influence people's travel behavior (such as mode choice, or parking facility choice between on-street and garage). The cruising flow causes delays eventually to everyone, even users with destinations outside limited parking areas. It is therefore important to understand the impact of parking limitation on mobility, and to identify efficient parking policies for travel cost reduction. Most existing studies on parking fall short in reproducing the dynamic spatiotemporal features of traffic congestion in general, lack the treatment of dynamics of the cruising-for-parking phenomenon, or require detailed input data that are typically costly and difficult to collect. In this paper, we propose an aggregated and dynamic approach for modeling multimodal traffic with the treatment on parking, and utilize the approach to design dynamic parking pricing strategies. The proposed approach is based on the Macroscopic Fundamental Diagram (MFD), which can capture congestion dynamics at network-level for single-mode and bi-modal (car and bus) systems. A parsimonious parking model is integrated into the MFD-based multimodal modeling framework, where the dynamics of vehicular and passenger flows are considered with a change in the aggregated behavior (e.g. mode choice and parking facility choice) caused by cruising and congestion. Pricing strategies are developed with the objective of reducing congestion, as well as lowering the total travel cost of all users. A case study is carried out for a bi-modal city network with a congested downtown region. An elegant feedback dynamic parking pricing strategy can effectively reduce travel delay of cruising and the generic congestion. Remarkably, such strategy, which is applicable in real-time management with limited available data, is fairly as efficient as a dynamic pricing scheme obtained from system optimum conditions and a global optimization with full information about the future states of the system. Stackelberg equilibrium is also investigated in a competitive behavior between different parking facility operators. Policy indications on on-street storage capacity management and pricing are provided.     

A three-dimensional macroscopic fundamental diagram for mixed bi-modal urban networks

Recent research has studied the existence and the properties of a macroscopic fundamental diagram (MFD) for large urban networks. The MFD should not be universally expected as high scatter or hysteresis might appear for some type of networks, like heterogeneous networks or freeways. In this paper, we investigate if aggregated relationships can describe the performance of urban bi-modal networks with buses and cars sharing the same road infrastructure and identify how this performance is influenced by the interactions between modes and the effect of bus stops. Based on simulation data, we develop a three-dimensional vehicle MFD (3D-vMFD) relating the accumulation of cars and buses, and the total circulating vehicle flow in the network. This relation experiences low scatter and can be approximated by an exponential-family function. We also propose a parsimonious model to estimate a three-dimensional passenger MFD (3D-pMFD), which provides a different perspective of the flow characteristics in bi-modal networks, by considering that buses carry more passengers. We also show that a constant Bus–Car Unit (BCU) equivalent value cannot describe the influence of buses in the system as congestion develops. We then integrate a partitioning algorithm to cluster the network into a small number of regions with similar mode composition and level of congestion. Our results show that partitioning unveils important traffic properties of flow heterogeneity in the studied network. Interactions between buses and cars are different in the partitioned regions due to higher density of buses. Building on these results, various traffic management strategies in bi-modal multi-region urban networks can then be integrated, such as redistribution of urban space among different modes, perimeter signal control with preferential treatment of buses and bus priority.     

Cooperative traffic control of a mixed network with two urban regions and a freeway

Currently most optimization methods for urban transport networks (i) are suited for networks with simplified dynamics that are far from real-sized networks or (ii) apply decentralized control, which is not appropriate for heterogeneously loaded networks or (iii) investigate good-quality solutions through micro-simulation models and scenario analysis, which make the problem intractable in real time. In principle, traffic management decisions for different sub-systems of a transport network (urban, freeway) are controlled by operational rules that are network specific and independent from one traffic authority to another. In this paper, the macroscopic traffic modeling and control of a large-scale mixed transportation network consisting of a freeway and an urban network is tackled. The urban network is partitioned into two regions, each one with a well-defined Macroscopic Fundamental Diagram (MFD), i.e. a unimodal and low-scatter relationship between region density and outflow. The freeway is regarded as one alternative commuting route which has one on-ramp and one off-ramp within each urban region. The urban and freeway flow dynamics are formulated with the tool of MFD and asymmetric cell transmission model, respectively. Perimeter controllers on the border of the urban regions operating to manipulate the perimeter interflow between the two regions, and controllers at the on-ramps for ramp metering are considered to control the flow distribution in the mixed network. The optimal traffic control problem is solved by a Model Predictive Control (MPC) approach in order to minimize total delay in the entire network. Several control policies with different levels of urban-freeway control coordination are introduced and tested to scrutinize the characteristics of the proposed controllers. Numerical results demonstrate how different levels of coordination improve the performance once compared with independent control for freeway and urban network. The approach presented in this paper can be extended to implement efficient real-world control strategies for large-scale mixed traffic networks.     

A dynamic cordon pricing scheme combining the Macroscopic Fundamental Diagram and an agent-based traffic model

Pricing is considered an effective management policy to reduce traffic congestion in transportation networks. In this paper we combine a macroscopic model of traffic congestion in urban networks with an agent-based simulator to study congestion pricing schemes. The macroscopic model, which has been tested with real data in previous studies, represents an accurate and robust approach to model the dynamics of congestion. The agent-based simulator can reproduce the complexity of travel behavior in terms of travelers’ choices and heterogeneity. This integrated approach is superior to traditional pricing schemes. On one hand, traffic simulators (including car-following, lane-changing and route choice models) consider travel behavior, i.e. departure time choice, inelastic to the level of congestion. On the other hand, most congestion pricing models utilize supply models insensitive to demand fluctuations and non-stationary conditions. This is not consistent with the physics of traffic and the dynamics of congestion. Furthermore, works that integrate the above features in pricing models are assuming deterministic and homogeneous population characteristics. In this paper, we first demonstrate by case studies in Zurich urban road network, that the output of a agent-based simulator is consistent with the physics of traffic flow dynamics, as defined by a Macroscopic Fundamental Diagram (MFD). We then develop and apply a dynamic cordon-based congestion pricing scheme, in which tolls are controlled by an MFD. And we investigate the effectiveness of the proposed pricing scheme. Results show that by applying such a congestion pricing, (i) the savings of travel time at both aggregated and disaggregated level outweigh the costs of tolling, (ii) the congestion inside the cordon area is eased while no extra congestion is generated in the neighbor area outside the cordon, (iii) tolling has stronger impact on leisure-related activities than on work-related activities, as fewer agents who perform work-related activities changed their time plans. Future work can apply the same methodology to other network-based pricing schemes, such as area-based or distance-traveled-based pricing. Equity issues can be investigated more carefully, if provided with data such as income of agents. Value-of-time-dependent pricing schemes then can also be determined.     

Traffic guidance–perimeter control coupled method for the congestion in a macro network

Macroscopic fundamental diagram (MFD) describes the macro relationship between a network vehicle density and a network space mean flow, without requiring the mastery of complex origin to destination data. Thus, MFD provides an opportunity for the macro control of urban road network. However, most of the existing MFD control methods ignore the active role of traffic guidance in solving congestion problems. This study presents a traffic guidance–perimeter control coupled (TGPCC) method to improve the performance of macroscopic traffic networks. The method considers the optimal cumulative volume of a network as the goal and establishes a programming function according to the network equilibrium rule of traffic flow amongst multiple MFD sub-regions, which regards the minimum delay of network, as the objective. The Logit model for the compliance rate of driver route guidance is established by the stated preference survey. Moreover, the perimeter control (PC) method is proposed for adjusting the phase split of intersections. Finally, three schemes, namely, the TGPCC, PC and the method without PC and guidance are tested on a network with four well-defined MFD sub-regions. Results show that the TGPCC addresses the issue of congestion and decreases the total delay accordingly.     

A day-to-day route flow evolution process towards the mixed equilibria

This study investigates a travelers’ day-to-day route flow evolution process under a predefined market penetration of advanced traveler information system (ATIS). It is assumed that some travelers equipped with ATIS will follow the deterministic user equilibrium route choice behavior due to the complete traffic information provided by ATIS, while the other travelers unequipped with ATIS will follow the stochastic user equilibrium route choice behavior. The interaction between these two groups of travelers will result in a mixed equilibrium state. We first propose a discrete day-to-day route flow adjustment process for this mixed equilibrium behavior by specifying the travelers’ route adjustment principle and adjustment ratio. The convergence of the proposed day-to-day flow dynamic model to the mixed equilibrium state is then rigorously demonstrated under certain assumptions upon route adjustment principle and adjustment ratio. In addition, without affecting the convergence of the proposed day-to-day flow dynamic model, the assumption concerning the adjustment ratio is further relaxed, thus making the proposed model more appealing in practice. Finally, numerical experiments are conducted to illustrate and evaluate the performance of the proposed day-to-day flow dynamic model.     

Hierarchical network-based equilibrium model and algorithm for a mixed-traffic urban transport system

Abstract

Many equilibrium models and algorithms based on homogeneous motorized traffic have been devised to model urban transport systems in developed countries, but they are inadequate when it comes to represent mixed-traffic urban transport systems, including automobiles, transit, bicycles, and pedestrians, in developing countries such as China or India. In these cases, traffic flow on a road segment is an aggregated result of travellers' combined mode/route choices and corresponding interactions. Therefore, a special assignment model and algorithm are needed for modeling these distinct behaviors. In this article, the structure of a mixed-traffic urban transport system is analyzed and then expanded and represented using a hierarchical network model based on graph theory. Based on the analysis of travelers' combined mode/route choices, generalized travel cost functions and link impedance functions for different modes are formulated, where the interferences between different modes on the same road segments are taken into account. Due to the ‘asymmetric’ nature of these functions, a variational inequality model is proposed to represent the equilibrium assignment problem in a mixed-traffic urban transport system. The corresponding solution algorithm is also presented. Finally, a numerical example is provided to illustrate the practicality of the proposed model and algorithm.     

Repeated anticipatory network traffic control using iterative optimization accounting for model bias correction

Anticipatory signal control in traffic networks adapts the signal timings with the aim of controlling the resulting (equilibrium) flows and route choice patterns in the network. This study investigates a method to support control decisions for successful applications in real traffic systems that operate repeatedly, for instance from day to day, month to month, etc. The route choice response to signal control is usually predicted through models; however this leads to suboptimality because of unavoidable prediction errors between model and reality. This paper proposes an iterative optimizing control method to drive the traffic network towards the real optimal performance by observing modeling errors and correcting for them. Theoretical analysis of this Iterative Optimizing Control with Model Bias Correction (IOCMBC) on matching properties between the modeled optimal solution and the real optimum is presented, and the advantages over conventional iterative schemes are demonstrated. A local convergence analysis is also elaborated to investigate conditions required for a convergent scheme. The main innovation is the calculation of the sensitivity (Jacobian) information of the real route choice behavior with respect to signal control variables. To avoid performing additional perturbations, we introduce a measurement-based implementation method for estimating the operational Jacobian that is associated with the reality. Numerical tests confirm the effectiveness of the proposed IOCMBC method in tackling modeling errors, as well as the influence of the optimization step size on the reality-tracking convergence.     

Agent-based network transmission model using the properties of macroscopic fundamental diagram

The field of research that has recently come to the fore is the perimeter control, which aims to control traffic demand for a large urban area prior to controlling internal flow inside the area. Such control concept needs to be tested by simulations, hence, it is necessary to develop a model that can appropriately estimate the network-wide flow dynamics. In this paper, agent-based network transmission model (ANTM) is proposed for describing the aggregated flow dynamics over an urban area of multiple large-scale networks. The proposed model is the combination of the cell transmission model (CTM), macroscopic fundamental diagram (MFD), and agent concept. The CTM-based simulation is adopted for the simplicity considering the computation requirements for real-time feasibility. The MFD concept is applied for representing the network properties, and a new approach is taken particularly for estimating network outflow affected by both demand patterns and boundary capacity. The agent concept is applied for representing drivers’ travel behaviors. The model is compared with microscopic simulations and shows reasonable accuracy for large areas. In addition, various travel direction choice behaviors are applicable to this model. Various perimeter control policies are applicable as well, thus, the proposed model can be a useful tool for testing various control methods, in terms of reducing the congestion in urban areas.     

Agent-based en-route diversion: Dynamic behavioral responses and network performance represented by Macroscopic Fundamental Diagrams

This paper focuses on modeling agents’ en-route diversion behavior under information provision. The behavior model is estimated based on naïve Bayes rules and re-calibrated using a Bayesian approach. Stated-preference driving simulator data is employed for model estimation. Bluetooth-based field data is employed for re-calibration. Then the behavior model is integrated with a simulation-based dynamic traffic assignment model. A traffic incident scenario along with variable message signs (VMS) is designed and analyzed under the context of a real-world large-scale transportation network to demonstrate the integrated model and the impact of drivers’ dynamic en-route diversion behavior on network performance. Macroscopic Fundamental Diagram (MFD) is employed as a measurement to represent traffic dynamics. This research has quantitatively evaluated the impact of information provision and en-route diversion in a VMS case study. It proposes and demonstrates an original, complete, behaviorally sound, and cost-effective modeling framework for potential analyses and evaluations related to Advanced Traffic Information System (ATIS) and real-time operational applications.     

Routing aspects of electric vehicle drivers and their effects on network performance

This study investigates the routing aspects of battery electric vehicle (BEV) drivers and their effects on the overall traffic network performance. BEVs have unique characteristics such as range limitation, long battery recharging time, and recuperation of energy lost during the deceleration phase if equipped with regenerative braking system (RBS). In addition, the energy consumption rate per unit distance traveled is lower at moderate speed than at higher speed. This raises two interesting questions: (i) whether these characteristics of BEVs will lead to different route selection compared to conventional internal combustion engine vehicles (ICEVs), and (ii) whether such route selection implications of BEVs will affect the network performance. With the increasing market penetration of BEVs, these questions are becoming more important. This study formulates a multi-class dynamic user equilibrium (MCDUE) model to determine the equilibrium flows for mixed traffic consisting of BEVs and ICEVs. A simulation-based solution procedure is proposed for the MCDUE model. In the MCDUE model, BEVs select routes to minimize the generalized cost which includes route travel time, energy related costs and range anxiety cost, and ICEVs to minimize route travel time. Results from numerical experiments illustrate that BEV drivers select routes with lower speed to conserve and recuperate battery energy while ICEV drivers select shortest travel time routes. They also illustrate that the differences in route choice behavior of BEV and ICEV drivers can synergistically lead to reduction in total travel time and the network performance towards system optimum under certain conditions.     

Route swapping in dynamic traffic networks

A dynamic traffic assignment (DTA) model typically consists of a traffic performance model and a route choice model. The traffic performance model describes how traffic propagates (over time) along routes connecting origin-destination (OD) pairs, examples being the cell transmission model, the vertical queueing model and the travel time model. This is implemented in a dynamic network loading (DNL) algorithm, which uses the given route inflows to compute the link inflows (and hence link costs), which are then used to compute the route travel times (and hence route costs). A route swap process specifies the route inflows for tomorrow (at the next iteration) based on the route inflows today (at the current iteration). A dynamic user equilibrium (DUE), where each traveller on the network cannot reduce his or her cost of travel by switching to another route, can be sought by iterating between the DNL algorithm and the route swap process. The route swap process itself takes up very little computational time (although route set generation can be very computationally intensive for large networks). However, the choice of route swap process dramatically affects convergence and the speed of convergence. The paper details several route swap processes and considers whether they lead to a convergent system, assuming that the route cost vector is a monotone function of the route inflow vector.     

A systematic analysis of multimodal transport systems with road space distribution and responsive bus service

A smart design of transport systems involves efficient use and allocation of the limited urban road capacity in the multimodal environment. This paper intends to understand the system-wide effect of dividing the road space to the private and public transport modes and how the public transport service provider responds to the space changes. To this end, the bimodal dynamic user equilibrium is formulated for separated road space. The Macroscopic Fundamental Diagram (MFD) model is employed to depict the dynamics of the automobile traffic for its state-dependent feature, its inclusion of hypercongestion, and its advantage of capturing network topology. The delay of a bus trip depends on the running speed which is in turn affected by bus lane capacity and ridership. Within the proposed bimodal framework, the steady-state equilibrium traffic characteristics and the optimal bus fare and service frequency are analytically derived. The counter-intuitive properties of traffic condition, modal split, and behavior of bus operator in the hypercongestion are identified. To understand the interaction between the transport authority (for system benefit maximization) and the bus operator (for its own benefit maximization), we examine how the bus operator responds to space changes and how the system benefit is influenced with the road space allocation. With responsive bus service, the condition, under which expanding bus lane capacity is beneficial to the system as a whole, has been analytically established. Then the model is applied to the dynamic framework where the space allocation changes with varying demand and demand-responsive bus service. We compare the optimal bus services under different economic objectives, evaluate the system performance of the bimodal network, and explore the dynamic space allocation strategy for the sake of social welfare maximization.     

Multi-scale perimeter control approach in a connected-vehicle environment

This paper proposes a novel approach to integrate optimal control of perimeter intersections (i.e. to minimize local delay) into the perimeter control scheme (i.e. to optimize traffic performance at the network level). This is a complex control problem rarely explored in the literature. In particular, modeling the interaction between the network level control and the local level control has not been fully considered. Utilizing the Macroscopic Fundamental Diagram (MFD) as the traffic performance indicator, we formulate a dynamic system model, and design a Model Predictive Control (MPC) based controller coupling two competing control objectives and optimizing the performance at the local and the network level as a whole. To solve this highly non-linear optimization problem, we employ an approximation framework, enabling the optimal solution of this large-scale problem to be feasible and efficient. Numerical analysis shows that by applying the proposed controller, the protected network can operate around the desired state as expressed by the MFD, while the total delay at the perimeter is minimized as well. Moreover, the paper sheds light on the robustness of the proposed controller. This multi-scale hybrid controller is further extended to a stochastic MPC scheme, where connected vehicles (CV) serve as the only data source. Hence, low penetration rates of CVs lead to strong noises in the controller. This is a first attempt to develop a network-level traffic control methodology by using the emerging CV technology. We consider the stochasticity in traffic state estimation and the shape of the MFD. Simulation analysis demonstrates the robustness of the proposed stochastic controller, showing that efficient controllers can indeed be designed with this newly-spread vehicle technology even in the absence of other data collection schemes (e.g. loop detectors).     

A comparative study of Macroscopic Fundamental Diagrams of arterial road networks governed by adaptive traffic signal systems

Using a stochastic cellular automaton model for urban traffic flow, we study and compare Macroscopic Fundamental Diagrams (MFDs) of arterial road networks governed by different types of adaptive traffic signal systems, under various boundary conditions. In particular, we simulate realistic signal systems that include signal linking and adaptive cycle times, and compare their performance against a highly adaptive system of self-organizing traffic signals which is designed to uniformly distribute the network density. We find that for networks with time-independent boundary conditions, well-defined stationary MFDs are observed, whose shape depends on the particular signal system used, and also on the level of heterogeneity in the system. We find that the spatial heterogeneity of both density and flow provide important indicators of network performance. We also study networks with time-dependent boundary conditions, containing morning and afternoon peaks. In this case, intricate hysteresis loops are observed in the MFDs which are strongly correlated with the density heterogeneity. Our results show that the MFD of the self-organizing traffic signals lies above the MFD for the realistic systems, suggesting that by adaptively homogenizing the network density, overall better performance and higher capacity can be achieved.     

On the allocation of city space to multiple transport modes

Abstract

This paper analyzes urban multimodal transportation systems in an aggregated way. To describe the aggregate behavior of traffic in cities, use is made of an idea that is now receiving some attention: the macroscopic fundamental diagram (MFD). We demonstrate through simulation how the MFD can be used to monitor and control a real network, in this case a portion of San Francisco, using readily available input data. We then show how different modes interact on the same network and discuss how these interactions might be incorporated into an MFD for multimodal networks. The work unveils two main results: first, it confirms recent results showing that restricting access to a city's congested areas can improve mobility for all travelers, including those who endure the restrictions; and second, that dedicating street space to collective transport modes can improve accessibility for all modes, even those from which space is taken away.     

First-best marginal cost toll for a traffic network with stochastic demand

First-best marginal cost pricing (MCP) in traffic networks has been extensively studied with the assumption of deterministic travel demand. However, this assumption may not be realistic as a transportation network is exposed to various uncertainties. This paper investigates MCP in a traffic network under stochastic travel demand. Cases of both fixed and elastic demand are considered. In the fixed demand case, travel demand is represented as a random variable, whereas in the elastic demand case, a pre-specified random variable is introduced into the demand function. The paper also considers a set of assumptions of traveler behavior. In the first case, it is assumed that the traveler considers only the mean travel time in the route choice decision (risk-neutral behavior), and in the second, both the mean and the variance of travel time are introduced into the route choice model (risk-averse behavior). A closed-form formulation of the true marginal cost toll for the stochastic network (SN-MCP) is derived from the variational inequality conditions of the system optimum and user equilibrium assignments. The key finding is that the calculation of the SN-MCP model cannot be made by simply substituting related terms in the original MCP model by their expected values. The paper provides a general function of SN-MCP and derives the closed-form SN-MCP formulation for specific cases with lognormal and normal stochastic travel demand. Four numerical examples are explored to compare network performance under the SN-MCP and other toll regimes.     

Hierarchical perimeter control with guaranteed stability for dynamically coupled heterogeneous urban traffic

Perimeter control based on the Macroscopic Fundamental Diagram (MFD) is widely developed for alleviating or postponing congestion in a protected region. Recent studies reveal that traffic conditions might not be improved if the perimeter control strategies are applied to unstable systems where high demand generates heavy and heterogeneously distributed traffic congestion. Therefore, considering stability of the targeted traffic system is essential, for the sake of developing a feasible and then optimal control strategy. This paper sheds light on this direction. It integrates a stability characterization algorithm of MFD system equations into the Model Predictive Control (MPC) scheme, and features respectively an upper and a lower bound of the feasible control inputs, to guarantee system stability. Firstly, the dynamics of traffic heterogeneity and its effect on the MFD are analyzed, using real data from Guangzhou in China. Piecewise affine functions of average flow are proposed to capture traffic heterogeneity in both regional and subregional MFDs. Secondly, stability of a three-state two-region system is investigated via stable equilibrium and surface boundaries analysis. Finally, a three-layer hierarchical control strategy is introduced for the studied two-region heterogeneous urban networks. The first layer of the controller calculates the stable surface boundaries for the given traffic demands and then determines the bounds of control input (split rate). An MPC approach in the second layer is used to solve an optimization problem with two objectives of minimizing total network delay and maximizing network throughput. Heterogeneity among the subregions is minimized in the last layer by implementing simultaneously a subregional perimeter flow control and an internal flow control. The effectiveness and stability of the proposed control approach are verified by comparison with four existing perimeter control strategies.