Estimation of Turning Movements at Intersections: Joint Trip Distribution and Traffic Assignment Program Combined with a Genetic Algorithm

The availability of turning movement data at intersections is essential in carrying out traffic simulations with software such as NETSIM. However, data collection is very time-consuming even for a small network. To estimate turning movements at intersections, a logit-based stochastic user equilibrium (SUE) model was integrated into a genetic algorithm. Three derivative models were developed: (a) a doubly constrained estimator, (b) a singly constrained estimator, and (c) an origin-destination (O-D)-based estimator. In the first and second estimators, the SUE model was formulated as a joint trip distribution and traffic assignment (TD-TA) program, whereas in the third estimator, the SUE model was based on a standard O-D distribution program. These turning movement estimator models were examined by applying them to three road networks: a virtual road network with simulated data, a small road network in the field with data obtained by manual counting, and a road network with data measured with traffic detectors. Application of the models to the virtual road network proves that if prior information on the O-D distribution is available, the O-D-based estimator is most effective in estimating turning movements. Application of the models to real networks for which no prior information on the O-D flows is available shows that the doubly constrained TD-TA-based model is the most accurate and efficient. The turning movements on major links estimated with this model were in relatively good agreement with those actually measured. The correlation coefficient of link flow exceeded 0.90. However, the rationale of the range of unknown variables remains unresolved.

[1]  Hani S. Mahmassani,et al.  ESTIMATION OF DYNAMIC ORIGIN-DESTINATION FLOWS FROM SENSOR DATA USING BI-LEVEL OPTIMIZATION METHOD , 2001 .

[2]  Michael G.H. Bell,et al.  A STOCHASTIC USER EQUILIBRIUM PATH FLOW ESTIMATOR , 1997 .

[3]  Hyunmyung Kim,et al.  Origin-Destination Matrices Estimated with a Genetic Algorithm from Link Traffic Counts , 2001 .

[4]  M. Florian,et al.  A COORDINATE DESCENT METHOD FOR THE BILEVEL O-D MATRIX ADJUSTMENT PROBLEM , 1992 .

[5]  Michael G.H. Bell,et al.  Transportation Network Analysis: Bell/Transportation Network Analysis , 1997 .

[6]  Hai Yang,et al.  The equilibrium-based origin-destination matrix estimation problem , 1994 .

[7]  Y Iida,et al.  Transportation Network Analysis , 1997 .

[8]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1996, Springer Berlin Heidelberg.

[9]  T. Abrahamsson,et al.  IR-98-021 / May Estimation of Origin-Destination Matrices Using Traffic Counts – A Literature Survey , 1998 .

[10]  M G H Bell STOCHASTIC USER EQUILIBRIUM ASSIGNMENT AND ITERATIVE BALANCING. , 1993 .

[11]  M. Bell,et al.  A TIME-DEPENDENT MULTI-CLASS PATH FLOW ESTIMATOR , 1996 .

[12]  H. M. Zhang,et al.  A Decoupled GLS-Based Path Flow Estimator For Inferring Origin-Destination Matrices , 2003 .

[13]  DERIVING INTERSECTION TURNING MOVEMENTS VIA PATH FLOW ESTIMATOR , 2003 .

[14]  Hai Yang Heuristic algorithms for the bilevel origin-destination matrix estimation problem , 1995 .