Using stop bar detector information to determine turning movement proportions in shared lanes

Turning vehicle volumes at signalized intersections are critical inputs for various transportation studies such as level of service, signal timing, and traffic safety analysis. There are various types of detectors installed at signalized intersections for control and operation. These detectors have the potential of producing volume estimates. However, it is quite a challenge to use such detectors for conducting turning movement counts in shared lanes. The purpose of this paper was to provide three methods to estimate turning movement proportions in shared lanes. These methods are characterized as flow characteristics (FC), volume and queue (VQ) length, and network equilibrium (NE). FC and VQ methods are based on the geometry of an intersection and behavior of drivers. The NE method does not depend on these factors and is purely based on detector counts from the study intersection and the downstream intersection. These methods were tested using regression and genetic programming (GP). It was found that the hourly average error ranged between 4 and 27% using linear regression and 1 to 15% using GP. A general conclusion was that the proposed methods have the potential of being applied to locations where appropriate detectors are installed for obtaining the required data. Copyright © 2016 John Wiley & Sons, Ltd.     

Dynamic network equilibrium for daily activity-trip chains of heterogeneous travelers: application to large-scale networks

Applications of dynamic network equilibrium models have, mostly, considered the unit of traffic demand either as one-way trip, or as multiple independent trips. However, individuals’ travel patterns typically follow a sequence of trips chained together. In this study we aim at developing a general simulation-based dynamic network equilibrium algorithm for assignment of activity-trip chain demand. The trip chain of each individual trip maker is defined by the departure time at origin, sequence of activity destination locations, including the location of their intermediate destinations and their final destination, and activity duration at each of the intermediate destinations. Spatial and temporal dependency of subsequent trips on each other necessitate time and memory consuming calculations and storage of node-to-node time-dependent least generalized cost path trees, which is not practical for very large metropolitan area networks. We first propose a reformulation of the trip-based demand gap function formulation for the variational inequality formulation of the Bi-criterion Dynamic User Equilibrium (BDUE) problem. Next, we propose a solution algorithm for solving the BDUE problem with daily chain of activity-trips. Implementation of the algorithm for very large networks circumvents the need to store memory-intensive node-to-node time-dependent shortest path trees by implementing a destination-based time-dependent least generalized cost path finding algorithm, while maintaining the spatial and temporal dependency of subsequent trips. Numerical results for a real-world large scale network suggest that recognizing the dependency of multiple trips of a chain, and maintaining the departure time consistency of subsequent trips provide sharper drops in gap values, hence, the convergence could be achieved faster (compared to when trips are considered independent of each other).