2013 Session: 231

• Reserve Capacity on Multiphase Signalized Road Network with Stochastic User Equilibrium
  Abstract: In this paper, a mathematical programming is firstly formulated to describe drivers¡¯ route choice behavior on multi-phase signalized road network based on stochastic user principles while taking signal delays into account. Then, an integrated method is used to maximize the reserve capacity of multi-phase signalized road network with Stochastic User Equation (SUE). The sensitivity analysis algorithm based on difference is presented to find maximum increase in travel demands at different level of knowledge the drivers have about route travel costs. The application of the proposed model on an example network indicates that the put forward algorithm can efficiently solve the bi-level problems and the transportation decision makers can adjust the signal plans and ATIS (Advanced Traveler Information System) information simultaneously to maximize the reserve capacity on multi-phase signalized road network.
  Authors: Wang, Jian; Deng, Wei
  Authors: Wang, Jian; Deng, Wei
  Year: 2013
  Document Type: Paper
  Subject: Planning and Forecasting
  Session: 231
  Paper Number: 13-0836
• Null-Space Metric for Analysis of Partial Network Observability in Sensor Location Problems
  Abstract: This paper presents a new methodology and an intuitive metric for assessing the information quality of a set of (link) sensors in a network. This methodology is based on the concept of network observability, i.e. given a set of sensors covering a few links, what is the amount of information obtained on the rest of the network, where sensors are not installed.Existing approaches can efficiently find solutions for complete network observability, which means that through these methods one can identify the smallest number of links needed to fully determine the flows on the remaining set of links. Similar approaches can be found using route and OD pairs as variables. However, no comprehensive metric is found in literature that can quantify the quality of a solution in case of partial observability. This paper aims to fill this gap. This is a crucial contribution in this field, since even in small size networks the solution for full observability requires an exceedingly large amount of sensors.We tested this new methodology both on small toy networks, in order to analyze the properties of the metric and to explain and test the local search algorithms for optimal sensor positioning, and on real-sized networks. Comparison with partial observability methods proposed in other studies shows the benefits of the new methodology in finding the links that contain the largest deal of information in a network.
  Authors: Rinaldi, Marco; Corman, Francesco; Viti, Francesco
  Authors: Rinaldi, Marco; Corman, Francesco; Viti, Francesco
  Year: 2013
  Document Type: Paper
  Subject: Planning and Forecasting
  Session: 231
  Paper Number: 13-1671
• Reliability-Based Modeling of Park-and-Ride Service on a Linear Travel Corridor
  Abstract: This paper studies the modeling of multimodal choice in a railway/highway system with single park-and-ride service on a linear travel corridor. Commuters choose either auto or railway to directly travel from home to city center, or drive to the park-and-ride facility and transfer to railway transit service. Both the traffic congestion on highway and crowding effect on rail transit are considered. The highway capacity is assumed to be stochastic to take into account the travel time reliability for using auto mode. Commuters are assumed to be uniformly distributed along the corridor. A linear complementarity system is proposed to model the commuters’ modal choice along the corridor and solve the spatial equilibrium pattern. The formulated linear complementarity system is transformed into a mixed integer linear program to be solved. The modeling approach and solution algorithm are implemented in a small numerical example.
  Authors: Wang, David Zhiwei; Du, Bo
  Authors: Wang, David Zhiwei; Du, Bo
  Year: 2013
  Document Type: Paper
  Subject: Planning and Forecasting
  Session: 231
  Paper Number: 13-1481
• Price of Anarchy for Reliability-Based Traffic Assignment and Network Design
  Abstract: In recent years, price of anarchy (PoA) in transportation engineering has recent great attention. Apart from the traditional user-equilibrium traffic assignment problem, scholars also studied PoA in other transportation engineering problems such as stochastic user equilibrium traffic assignment problems and road pricing problems. In this paper, PoA in a reliability-based user-equilibrium traffic assignment problem is investigated. A definition of PoA for a reliability-based user-equilibrium traffic assignment problem is proposed, and an analytical formula for the PoA for general transportation networks is derived. This formula is extended to reliability-based transportation network design problems. Numerical examples are given to illustrate the effect of the value of the risk-aversion parameter on PoA.
  Authors: Szeto, Wai Yuen; Wang, Bei; Wong, S. C.
  Authors: Szeto, Wai Yuen; Wang, Bei; Wong, S. C.
  Year: 2013
  Document Type: Paper
  Subject: Planning and Forecasting
  Session: 231
  Paper Number: 13-1617
• Algebraic Approach for Performance-Bound Calculus on Transportation Networks
  Abstract: We propose in this article an adaptation of the basic techniques of the deterministic network calculus theory to the road traffic flow theory. Network calculus is a theory based on min-plus algebra. It uses algebraic techniques to compute performance bounds in communication networks, such as maximum end-to-end delays and backlogs. The objective of this article is to investigate the application of such techniques for determining performance bounds on road networks, such as maximum bounds on travel times. The main difficulty to apply the network calculus theory on road networks is the modeling of interaction of cars inside one road, or more precisely the congestion phase. We propose a traffic model for a single-lane road without passing, which is compatible with the network calculus theory. The model permits to derive a maximum bound of the travel time of cars through the road. Then, basing on that model, we explain how to extend the approach to model intersections and large-scale networks.
  Authors: Farhi, Nadir; Haj-Salem, Habib; Lebacque, Jean-Patrick
  Authors: Farhi, Nadir; Haj-Salem, Habib; Lebacque, Jean-Patrick
  Year: 2013
  Document Type: Paper
  Subject: Planning and Forecasting
  Session: 231
  Paper Number: 13-4659
• Reliability assessment of dynamic OD estimation methods based on structural similarity index
  Abstract: The statistical measures used for quality assessment of estimated OD matrices typically quantify the difference between the estimated OD matrix and available true/reference OD matrix. Although the underlying rational makes sense intuitively, the actual statistical measures in literature, such as MSE, do not capture the most important aspect: the structural similarity of the estimated and reference OD matrix. In this paper we propose a new quality measure that does incorporate such a term, so-called Structural SIMilarity (SSIM) index.In this paper we explore the application perspectives of SSIM index for this purpose. First, we investigate the properties of SSIM index compared to some statistical measures. Then, we show how SSIM index can be used as additional performance measure for benchmarking the dynamic OD estimation methods. More over, we provide insight into how SSIM index can be used further as a new performance function to estimate dynamic OD matrices.
  Authors: Djukic, Tamara; Hoogendoorn, Serge; Van Lint, Hans
  Authors: Djukic, Tamara; Hoogendoorn, Serge; Van Lint, Hans
  Year: 2013
  Document Type: Paper
  Subject: Planning and Forecasting
  Session: 231
  Paper Number: 13-4851
• Development and Calibration of Daily Regional Dynamic Traffic Assignment Model: Case Study for Denver, Colorado, Region
  Abstract: This paper presented computationally effective approaches to enable the development and calibration of a large-scale 24-hour regional simulation-based dynamic traffic assignment (DTA) model. The efficiency and effectiveness of the proposed approach was demonstrated on a large-scale regional model in the Denver Regional Council of Government (DRCOG) metropolitan area. Not only the demonstrated model adopted the state-of-the-art assignment methodologies, and but was also shown to incorporate dynamic Synchro signal control data. The developed model was validated, and further calibrated, by field collected sensors data on a set of screen lines. We showed a range of time-varying measurement of effectiveness (MOE) along with time-space speed contour diagrams to depict much richer presentations of the dynamic model over the static model.
  Authors: Zheng, Hong; Nava, Eric Joseph; Chiu, Yi-Chang; Xyntarakis, Michail; Sabina, Erik E.
  Authors: Zheng, Hong; Nava, Eric Joseph; Chiu, Yi-Chang; Xyntarakis, Michail; Sabina, Erik E.
  Year: 2013
  Document Type: Paper
  Subject: Planning and Forecasting
  Session: 231
  Paper Number: 13-5048
• Delays Caused by Incidents: Data-Driven Approach
  Abstract: Road networks are becoming more and more vulnerable for incidents as a result of an increasing level of congestion. In this paper an innovative empirical method is proposed and applied to analyze the delays caused by about 490.000 incidents that occurred in the Netherlands in the period 2007-2009. The method has been applied to the motorway network of the Netherlands for which detailed loop detector data is available and for which incidents are registered. The method contributes to the existing literature by explaining how delays that are caused by incidents can be computed by selecting a reference day and by tracing the effects of incidents. The method considers upstream delays on the road where the incident occurred, spillback effects to other roads and rubbernecking effects. The method provides insight in the locations that are most vulnerable for incidents and provides a basis for taking robustness measures and understanding the potential benefits of these measures.
  Authors: Snelder, Maaike; Bakri, Taoufik; van Arem, Bart
  Authors: Snelder, Maaike; Bakri, Taoufik; van Arem, Bart
  Year: 2013
  Document Type: Paper
  Subject: Planning and Forecasting
  Session: 231
  Paper Number: 13-0758
  Practice-Ready: Yes
• Bilevel Generalized Least-Square Estimation of Dynamic Origin-Destination Matrix for Urban Network Using Probe Vehicle Data
  Abstract: Methods of estimating dynamic origin-destination (OD) matrices for urban networks from probe vehicle data are explored. A speed-density function is derived and fitted for different types of roads using the maximum likelihood method. A Bayesian method (BM) that carefully incorporates prior information and an ordinary method (OM) are both used to estimate link flows from probe vehicle speed. A DTA-based bi-level generalized least-square (GLS) estimator considering the distance between the estimated and target OD matrices as well as the distance between the calculated and observed link flows is formulated so as to estimate dynamic OD matrices from estimated link flows. In the iterative solution procedure, the upper level is solved using the extended Bell algorithm, while the commercial DTA system VISSIM is applied to produce the assignment matrix in the lower level. A medium-size signalized network in Tokyo is modeled in a case study, in which BM and OM are compared both in link flow estimation and OD matrix estimation. Further, the bi-level GLS estimator and bi-level OLS (ordinary least-square) estimator are implemented and then compared in OD estimation. The results validate the proposed bi-level GLS estimator.
  Authors: Cao, Peng; Miwa, Tomio; Yamamoto, Toshiyuki; Morikawa, Takayuki
  Authors: Cao, Peng; Miwa, Tomio; Yamamoto, Toshiyuki; Morikawa, Takayuki
  Year: 2013
  Document Type: Paper
  Subject: Planning and Forecasting
  Session: 231
  Paper Number: 13-2466
  Practice-Ready: Yes
• Development and Calibration of Long-Distance Passenger Traffic Assignment Model
  Abstract: This paper studies the assignment of long distance passenger traffic on a highway corridor network. First, we propose a traditional model for the long distance traffic assignment considering interactions with local commuter traffic. It addresses the effect of local sub-networks on highway corridors. An interactive algorithm is developed to solve for the exact solution. Then, to address the potential computational issues that arise therein, a decomposition method is proposed by introducing a new concept of corridor elasticity. An assignment procedure for long distance passenger traffic is developed accordingly. Numerical tests show that the proposed decomposition method makes significant improvements in computational performance at a small loss of optimality. This decomposition method well approximates the exact assignment from the traditional formulation, especially when the highway corridors are near-saturation. The proposed decomposition method appears practical for application.
  Authors: Wang, Wen; Wang, Bruce; Dong, Jing
  Authors: Wang, Wen; Wang, Bruce; Dong, Jing
  Year: 2013
  Document Type: Paper
  Subject: Planning and Forecasting
  Session: 231
  Paper Number: 13-4108
  Practice-Ready: Yes
• Sensor Location Model to Optimize Origin-Destination Estimation Using a Bayesian Statistical Procedure
  Abstract: For transportation planning and operations decisions, static origin-destination (OD) matrices, which specify the number of trips between each OD pair, is an essential input. One approach to estimate the OD matrices is to use data from traditional counting sensors on links with assumptions or models on how drivers choose routes on the network. The inverse problem is to locate a given number of counting sensors to obtain good OD matrices estimation. In this paper, a new model for locating sensors to minimize the uncertainties in route flows estimates is presented. The model assumes the route choice set from each O to each D is known and the prior estimates of route flows are given. The reliabilities for each OD route prior and the link flow observation are assumed to be given as well. The sensors in this problem scenario are not necessary perfect and measurement errors can occur; however the reliabilities of the sensors are assumed known. Extensive computational experiments and comparisons with some existing sensor location models indicate that the proposed model consistently gives more reliable estimate of OD flows.
  Authors: Wang, Ning; Mirchandani, Pitu B.
  Authors: Wang, Ning; Mirchandani, Pitu B.
  Year: 2013
  Document Type: Paper
  Subject: Planning and Forecasting
  Session: 231
  Paper Number: 13-5010
  Practice-Ready: Yes
• Integrated Control Model for Managing Network Congestion
  Abstract: An integrated control model is proposed in this paper to manage traffic congestion along a freeway and a parallel signalized arterial. This model focuses on diversion control, which seeks to utilize available capacity along parallel routes. It specifically considers the potential impact of diverting traffic to the performance of diverting route. For signalized arterial, the caused congestion can be reduced or eliminated by a maximum flow based signal control model. The integrated control model does not need the time-dependent traffic demand or O-D matrix as most of previous approaches do and it is suitable for online applications because of its extremely low computation burden. The model is tested using microscopic traffic simulation in the I-394 and TH 55 corridor in Minneapolis, MN. The results indicate the model can effectively and efficiently reduce network congestion and improve system performance.
  Authors: Hu, Heng; Liu, Henry X.
  Authors: Hu, Heng; Liu, Henry X.
  Year: 2013
  Document Type: Paper
  Subject: Planning and Forecasting
  Session: 231
  Paper Number: 13-5003
  Practice-Ready: Yes
• Primal-Dual Heuristic for Path Flow Estimation in Medium-Sized to Large Networks
  Abstract: The Path Flow Estimator (PFE), an Origin-Destination (O-D) demand estimation algorithm that relies on the computation of path flows, can be slow when applied to medium to large networks. We develop a primal-dual heuristic that can significantly improve the efficiency of the algorithm, and enables its application in medium to large networks with considerably less computational time. Numerical examples are provided to show the performance improvement of this primal-dual heuristic over the original PFE algorithm.
  Authors: Tang, Shikai; Zhang, H. Michael
  Authors: Tang, Shikai; Zhang, H. Michael
  Year: 2013
  Document Type: Paper
  Subject: Planning and Forecasting
  Session: 231
  Paper Number: 13-3451
  Practice-Ready: Yes
• Reliability-Based Modeling of Park-and-Ride Service on a Linear Travel Corridor
  Authors: Du, Bo
  Authors: Du, Bo
  Year: 2013
  Document Type: Presentation
  Subject: Planning and Forecasting
  Session: 231
  Paper Number: 13-1481
• Price of Anarchy for Reliability-Based Traffic Assignment and Network Design
  Authors: Wang, Bei
  Authors: Wang, Bei
  Year: 2013
  Document Type: Presentation
  Subject: Planning and Forecasting
  Session: 231
  Paper Number: 13-1617
• Null-Space Metric for Analysis of Partial Network Observability in Sensor Location Problems
  Authors: Rinaldi, Marco
  Authors: Rinaldi, Marco
  Year: 2013
  Document Type: Presentation
  Subject: Planning and Forecasting
  Session: 231
  Paper Number: 13-1671
• Delays Caused by Incidents: Data-Driven Approach
  Authors: Snelder, Maaike
  Authors: Snelder, Maaike
  Year: 2013
  Document Type: Presentation
  Subject: Planning and Forecasting
  Session: 231
  Paper Number: 13-0758
• Price of Anarchy for Reliability-Based Traffic Assignment and Network Design
  Authors: Szeto, Wai Yuen
  Authors: Szeto, Wai Yuen
  Year: 2013
  Document Type: Presentation
  Subject: Planning and Forecasting
  Session: 231
  Paper Number: 13-1617
• Bilevel Generalized Least-Square Estimation of Dynamic Origin-Destination Matrix for Urban Network Using Probe Vehicle Data
  Authors: Cao, Peng
  Authors: Cao, Peng
  Year: 2013
  Document Type: Presentation
  Subject: Planning and Forecasting
  Session: 231
  Paper Number: 13-2466
• Development and Calibration of Long-Distance Passenger Traffic Assignment Model
  Authors: Wang, Wen
  Authors: Wang, Wen
  Year: 2013
  Document Type: Presentation
  Subject: Planning and Forecasting
  Session: 231
  Paper Number: 13-4108
• Algebraic Approach for Performance-Bound Calculus on Transportation Networks
  Authors: Farhi, Nadir
  Authors: Farhi, Nadir
  Year: 2013
  Document Type: Presentation
  Subject: Planning and Forecasting
  Session: 231
  Paper Number: 13-4659
• Development and Calibration of Daily Regional Dynamic Traffic Assignment Model: Case Study for Denver, Colorado, Region
  Authors: Zheng, Hong
  Authors: Zheng, Hong
  Year: 2013
  Document Type: Presentation
  Subject: Planning and Forecasting
  Session: 231
  Paper Number: 13-5048
• Sensor Location Model to Optimize Origin-Destination Estimation Using a Bayesian Statistical Procedure
  Authors: Wang, Ning
  Authors: Wang, Ning
  Year: 2013
  Document Type: Presentation
  Subject: Planning and Forecasting
  Session: 231
  Paper Number: 13-5010
• Primal-Dual Heuristic for Path Flow Estimation in Medium-Sized to Large Networks
  Authors: Tang, Shikai
  Authors: Tang, Shikai
  Year: 2013
  Document Type: Presentation
  Subject: Planning and Forecasting
  Session: 231
  Paper Number: 13-3451
• Reliability assessment of dynamic OD estimation methods based on structural similarity index
  Authors: Djukic, Tamara
  Authors: Djukic, Tamara
  Year: 2013
  Document Type: Presentation
  Subject: Planning and Forecasting
  Session: 231
  Paper Number: 13-4851
• Integrated Control Model for Managing Network Congestion
  Authors: Hu, Heng
  Authors: Hu, Heng
  Year: 2013
  Document Type: Presentation
  Subject: Planning and Forecasting
  Session: 231
  Paper Number: 13-5003
• Sensor Location Model to Optimize Origin-Destination Estimation Using a Bayesian Statistical Procedure
  Authors: Mirchandani, Pitu
  Authors: Mirchandani, Pitu
  Year: 2013
  Document Type: Presentation
  Subject: Planning and Forecasting
  Session: 231
  Paper Number: 13-5010
• Presiding Officer
  Authors: Hu, Shou-Ren
  Authors: Hu, Shou-Ren
  Year: 2013
  Document Type: Presentation
  Subject: Planning and Forecasting
  Session: 231
  Paper Number: Z13-231