A New One-Level Convex Optimization Approach For Estimating Origin-Destination Demand

Accurately estimating Origin-Destination (OD) trip tables based on traffic data has become crucial in may real-time traffic applications. The problem of OD estimation is traditionally modeled as a bilevel network design problem (NDP), which is challenging to solve in large-scale networks. In this paper, the authors propose a new one-level convex optimization formulation to reasonably approximate the bilevel structure, thus allowing the development of more efficient solution algorithms. This one-level approach is consistent with user equilibrium conditions and improves previous one-level relaxed OD estimation formulations in the literature by 'equilibrating' path flows using external path cost parameters. This new formulation can, in fact, be viewed as a special case of the user equilibrium assignment problem with elastic demand, and hence can be solved efficiently by standard path-based traffic assignment algorithms with an iterative parameter updating scheme. Numerical experiments indicate that this new one-level approach performs very well. Estimation results are robust to network topology, sensor coverage, and observation error, and can achieve further improvements when additional data sources are included.

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

[2]  Bethany L. Nicholson,et al.  Mathematical Programs with Equilibrium Constraints , 2021, Pyomo — Optimization Modeling in Python.

[3]  Hani S. Mahmassani,et al.  Dynamic Network Traffic Assignment and Simulation Methodology for Advanced System Management Applications , 2001 .

[4]  Larry J. LeBlanc,et al.  Selection of a trip table which reproduces observed link flows , 1982 .

[5]  Torbjörn Larsson,et al.  Simplicial Decomposition with Disaggregated Representation for the Traffic Assignment Problem , 1992, Transp. Sci..

[6]  Hai Yang,et al.  An equivalent continuously differentiable model and a locally convergent algorithm for the continuous network design problem , 2001 .

[7]  E. Cascetta.  Estimation of trip matrices from traffic counts and survey data: A generalized least squares estimator , 1984 .

[8]  C. S. Fisk,et al.  ON COMBINING MAXIMUM ENTROPY TRIP MATRIX ESTIMATION WITH USER OPTIMAL ASSIGNMENT , 1988 .

[9]  C. Fisk.  GAME THEORY AND TRANSPORTATION SYSTEMS MODELLING , 1984 .

[10]  Haris N. Koutsopoulos,et al.  DEVELOPMENT OF A ROUTE GUIDANCE GENERATION SYSTEM FOR REAL-TIME APPLICATION , 1997 .

[11]  Yu Nie,et al.  A Variational Inequality Formulation for Inferring Dynamic Origin-Destination Travel Demands , 2008 .

[12]  Hillel Bar-Gera,et al.  Traffic Assignment by Paired Alternative Segments , 2010 .

[13]  Yosef Sheffi,et al.  Urban Transportation Networks: Equilibrium Analysis With Mathematical Programming Methods , 1985 .

[14]  H. M. Zhang,et al.  A Relaxation Approach for Estimating Origin–Destination Trip Tables , 2010 .

[15]  Luis G. Willumsen,et al.  Simplified transport models based on traffic counts , 1981 .

[16]  Laura Wynter,et al.  Real-time traffic estimation using data expansion , 2011 .

[17]  Peter A. Steenbrink,et al.  Optimization of Transport Networks , 1974 .

[18]  Hai Yang,et al.  Estimation of origin-destination matrices from link traffic counts on congested networks , 1992 .

[19]  Hillel Bar-Gera,et al.  Origin-Based Algorithm for the Traffic Assignment Problem , 2002, Transp. Sci..

[20]  R. Jayakrishnan,et al.  A FASTER PATH-BASED ALGORITHM FOR TRAFFIC ASSIGNMENT , 1994 .

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

[22]  Stephan Dempe,et al.  Foundations of Bilevel Programming , 2002 .

[23]  Henk J van Zuylen,et al.  The most likely trip matrix estimated from traffic counts , 1980 .

[24]  M. Patriksson,et al.  Sensitivity analysis of separable traffic equilibrium equilibria with application to bilevel optimization in network design , 2007 .