Citation map · Study

SZodixStudyAcademic Library

Shelves Open access

Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated

New algorithmic alternatives for the O–D matrix adjustment problem on traffic networks

10 references·4 citing·40 second hop

FromToDepth

this work references cited by second hop

References

1984An Efficient Method for Computing Traffic Equilibria in Networks with Asymmetric Transportation Costs440 cited
1993Dynamic Estimators of Origin-Destination Matrices Using Traffic Counts368 cited
1992Estimation of origin-destination matrices from link traffic counts on congested networks366 cited
1988Sensitivity Analysis for Equilibrium Network Flow339 cited
1987A maximum likelihood model for estimating origin-destination matrices310 cited
1995Heuristic algorithms for the bilevel origin-destination matrix estimation problem282 cited
1992Simplicial Decomposition with Disaggregated Representation for the Traffic Assignment Problem265 cited
1995A Coordinate Descent Method for the Bi‐level O–D Matrix Adjustment Problem108 cited
1990A GRADIENT APPROACH FOR THE O-D MATRIX ADJUSTMENT PROBLEM94 cited
1980Optimal Traffic Assignment with Elastic Demands: A Review Part II. Algorithmic Approaches90 cited

Cited by

2007A column generation algorithm for the estimation of origin–destination matrices in congested traffic networks15 cited
2017Two Methods to Calibrate the Total Travel Demand and Variability for a Regional Traffic Network9 cited
2012On the evaluation of a public transportation network quality: Criteria validation methodology6 cited
2018

Only edges whose both ends are imported exist here. Widen the year window, or show the whole map. Back to the work

Penalization and augmented Lagrangian for O-D demand matrix estimation from transit segment counts

6 cited