Dynamic assignment, surveillance and control for traffic network with uncertainties

Pao Yue-kong Library Electronic Theses Database

Dynamic assignment, surveillance and control for traffic network with uncertainties

 

Author: Zhong, Renxin
Title: Dynamic assignment, surveillance and control for traffic network with uncertainties
Degree: Ph.D.
Year: 2011
Subject: Traffic engineering -- Management
Traffic flow -- Mathematical models
Electronic traffic controls -- Mathematical models
Hong Kong Polytechnic University -- Dissertations
Department: Dept. of Civil and Structural Engineering
Pages: xiii, 272 leaves : ill. ; 30 cm.
InnoPac Record: http://library.polyu.edu.hk/record=b2441565
URI: http://theses.lib.polyu.edu.hk/handle/200/6098
Abstract: This dissertation involves the development of three key components of advanced traffic management information systems (ATMIS), i.e. real-time traffic surveillance, dynamic traffic assignment with traffic volume (queue) control, and traffic management under demand and supply uncertainties. The traffic volume (or queue) control scheme is widely used in traffic control practice and has been proven to be effective in managing congestion or gridlock. However, dynamic traffic assignment (DTA) considering the effects of traffic volume control schemes has been missing from literature. To fill this gap, this dissertation considers the analytical traffic volume (queue) control for traffic networks under two route choice behavior assumptions, i.e. dynamic user equilibrium (DUE) and dynamic system optimum (DSO). The traffic volume controls are related to the desired temporal traffic volumes on certain links, which can be set according to safety or environmental requirements. Both the DUE and DSO traffic assignment with traffic volume control are analyzed utilizing the optimal control theory. The existence of equilibrium to the DUE with traffic volume control is proven in this thesis. The DSO analysis highlights the differences between the dynamic externalities of the two vertical queue models, i.e. the whole link model and the deterministic queuing model. The results obtained from the DSO analysis are applied to investigate the traffic induced air pollution pricing.
For the surveillance part, this thesis concentrates on the development of a macroscopic traffic flow model to capture traffic dynamics on networks influenced by demand and supply uncertainties that are suitable for real-time traffic monitoring and control applications. To fulfill these objectives, a stochastic macroscopic dynamic traffic model, the stochastic cell transmission model (SCTM), which is based on the modified cell transmission model (MCTM) and the switching mode model (SMM), is proposed. The SCTM inherits the advantages of the MCTM and the SMM. However, there are several key differences between them, e.g. the MCTM and the SMM admit deterministic demand and stationary flow-density fundamental diagram while the SCTM accepts the random inflows (uncertain demand) as well as random parameters of the fundamental flow-density diagram (uncertain supply functions) with known means and variances of the freeway segment as exogenous inputs. Under the SCTM framework, the uncertain wavefronts are captured by probabilities of occurrence of operational modes which describe different congestion levels. The SCTM is calibrated and validated by several empirical studies. We also compare the performance of the SCTM with Monte Carlo Simulation of the MCTM (MCS-MCTM). The results confirm that the SCTM outperforms the MCS-MCTM. We apply the SCTM to estimate the queues and delays at signalized intersections and compare the results with some well-known delay and queue estimation formulas, e.g., Webster, Beckmann, McNeil, and Akcelik. The comparison results show a good consistency between the SCTM and these formulas. In addition, the SCTM describes the temporal behavior of the queue and delay distributions at signalized junctions with stochastic supply functions and (non-stationary) arrivals. In the traffic management part, optimal and robust decision making problems for managing uncertain network traffic are investigated. The proposed SCTM is applied to describe traffic dynamics on networks influenced by demand and supply uncertainties. The traffic management problems are formulated as stochastic dynamic programming problems. A closed form of optimal control law is derived in terms of a set of coupled generalized recursive Riccati equations. The robust decision making problem, which aims to act robustly with respect to the supply uncertainty and to attenuate the effect of demand uncertainty, can be recognized as an equivalent optimal decision making problem. Another implication of the proposed methodology is to make benefit from the inherent uncertainties, which is achieved by extending the conventional LQ optimal control theory to consider the indefinite terms of the state and input weighting matrices. The multiagent system (MAS) approach to access the traffic management for a general traffic network is discussed. The applications of the proposed methods to incident management are also highlighted. In conclusion, this thesis contributes to the literature on dynamic traffic assignment, stochastic dynamic traffic modeling and management, and to support further analysis and development in this area.

Files in this item

Files Size Format
b24415650.pdf 9.587Mb PDF
Copyright Undertaking
As a bona fide Library user, I declare that:
  1. I will abide by the rules and legal ordinances governing copyright regarding the use of the Database.
  2. I will use the Database for the purpose of my research or private study only and not for circulation or further reproduction or any other purpose.
  3. I agree to indemnify and hold the University harmless from and against any loss, damage, cost, liability or expenses arising from copyright infringement or unauthorized usage.
By downloading any item(s) listed above, you acknowledge that you have read and understood the copyright undertaking as stated above, and agree to be bound by all of its terms.

     

Quick Search

Browse

More Information