.png){kind=icon}
.png){kind=icon}
Return
A Primal-Dual Algorithm for Link Dependent Origin Destination Matrix Estimation
.png){kind=icon}
OA
AI
DOI：10.1109/TSIPN.2016.2623094.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Origin-destination matrix (ODM) estimation is a classical problem in transport engineering aiming to recover flows from every Origin to every Destination from measured traffic counts and a priori model information. Taking advantage of probe trajectories, whose capture is made possible by new measurement technologies, the present contribution extends the concept of ODM to that of link-dependent ODM (LODM). LODM also contains the flow distribution on links making specification of assignment models, e.g., by means of routing matrices, unnecessary. An original formulation of LODM estimation, from traffic counts and probe trajectories is presented as an optimization problem, where the functional to be minimized consists of five convex functions, each modeling a constraint or property of the transport problem: consistency with traffic counts, consistency with sampled probe trajectories, consistency with traffic conservation (Kirchhoff's law), similarity of flows having similar origins and destinations, and positivity of traffic flows. A proximal primal-dual algorithm is devised to minimize the designed functional, as the corresponding objective functions are not necessarily differentiable. A case study, on a simulated network and traffic, validates the feasibility of the procedure and details its benefits for the estimation of an LODM matching real-network constraints and observations.
Keywords:
Convex optimisation
origin destination matrices
proximal primal-dual algorithm
traffic flows
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.9
Papers:
726
Citations:
1.9K