Uncoupled method for equilibrium-based linear path flow estimator for origin-destination trip matrices

Transportation Research Record

Volumn , Issue 1783, 2002, Pages 72-74

  Nie, Yu ^a   Lee, Der Horng ^b  

^a University of California Davis   (United States)

^b NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; ESTIMATION; ITERATIVE METHODS; MATHEMATICAL MODELS; MATRIX ALGEBRA; VECTORS;

PATH FLOW ESTIMATORS;

MOTOR TRANSPORTATION;

EID: 0036954418     PISSN: 03611981     EISSN: None     Source Type: Journal    
DOI: 10.3141/1783-10     Document Type: Article

References (32)

1. Willumsen, L. G. Simplified Transport Models Based Traffic Counts. Transportation, Vol. 10, 1981, pp. 257-278.
2. Van Zuylen, J. H., and L. G. Willumsen. The Most Likely Trip Matrix Estimated from Traffic Counts. Transportation Research, Vol. 14B, 1980, pp. 281-293.
3. Cascetta, E. Estimation of Trip Matrices from Traffic Counts and Survey Data: A Generalized Least Squares Estimator. Transportation Research, Vol. 18B, 1984, pp. 289-299.
4. Maher, M. Inferences on Trip Matrices from Observations on Link Volumes: A Bayesian Statistical Approach. Transportation Research, Vol. 17B, 1983, pp. 435-447.
5. McNeil, S., and C. Hendrickson. A Regression Formulation of the Matrix Estimation Problem. Transportation Science, Vol. 19, 1985, pp. 278-292.
6. Bell, M. G. H. The Estimation of an Origin-Destination Matrix from Traffic Counts. Transportation Science, Vol. 17, 1983, pp. 198-217.
7. Brenninger-Göthe, M., K. O. Jörnsten, and J. T. Lundgren. Estimation of Origin-Destination Matrices from Traffic Counts Using Multi-Objective Programming Formulations. Transportation Research, Vol. 23B, 1989, pp. 257-269.
8. Lo, H. P., N. Zhang, and W. H. K. Lam. Estimation of an Origin-Destination Matrix with Random Link Choice Proportions: A Statistical Approach. Transportation Research, Vol. 30B, 1996, pp. 309-324.
9. Nguyen, S. Estimating an OD Matrix from Network Data: A Network Equilibrium Approach. University of Montreal Publication 60. University of Montreal, Quebec, Canada, 1977.
10. Fisk, C. S., and D. E. Boyce. A Note on Trip Matrix Estimation from Link Traffic Count Data. Transportation Research, Vol. 17B, 1983, pp. 245-250.
11. Fisk, C. S. On Combining Maximum Entropy Trip Estimation with User Optional Assignment. Transportation Research, Vol. 22B, No. 1, 1988, pp. 69-79.
12. Fisk, C. S. Trip Matrix Estimation from Link Traffic Counts: The Congested Network Case. Transportation Research, Vol. 23B, 1989, pp. 331-336.
13. Yang, H, T. Sasaki, Y. Iida, and Y. Asakura. Estimation of Origin-Destination Matrices from Link Traffic Counts on Congested Networks. Transportation Research, Vol. 26B, 1992, pp. 417-434.
14. Yang, H. Heuristic Algorithms for the Bilevel Origin-Destination Matrix Estimation Problem. Transportation Research, Vol. 29B, 1995, pp. 231-242.
15. Sherali, H. D., R. Sivanandan, and A. G. Hobeika. A Linear Programming Approach for Synthesizing Origin-Destination Trip Tables from Link Traffic Volumes. Transportation Research, Vol. 28B, 1994, pp. 213-233.
16. Bell, M. G. H., C. M. Shield, F. Busch, and K. Kruse. A Stochastic User Equilibrium Path Flow Estimator. Transportation Research, Vol. 5C, 1997, pp. 197-210.
17. Bell, M. G. H., and Y. Iida. Transportation Network Analysis. John Wiley & Sons, Inc., New York, 1997.
18. Eppstein, D. Finding the K Shortest Paths. SIAM Journal of Computing, Vol. 28, No. 2, 1999, pp. 652-673.
19. Dreyfus, S. E. An Appraisal of Some Shortest Path Algorithms. Operations Research, Vol. 17, 1969, pp. 395-412.
20. Shier, D. On Algorithms for Finding the K-Shortest Paths in a Network. Networks, Vol. 9, 1979, pp. 195-214.
21. Martins, E. Q. V. An Algorithm for Ranking Paths That May Contain Cycles. European Journal of Operations Research, Vol. 18, 1984, pp. 123-130.
22. Azevedo, J. A., J. J. E. R. S. Madeira, E. Q. V. Martins, and F. P. A. Pires. A Computational Improvement for a Shortest Paths Ranking Algorithm. European Journal of Operations Research, Vol. 73, 1994, pp. 188-191.
23. Martins, E. Q. V., and J. L. E. Santos. A New Shortest Path Ranking Algorithm. Technical Report. University de Coimbra, Portugal, 1996. http://www.mat.uc.pt/̃eqvm. Accessed June 6, 2001.
24. Yen, J. Y. Finding the K Shortest Loopless Paths in a Network. Management Science, Vol. 17, 1971, pp. 712-716.
25. Martins, E. Q. S., M. M. B. Pascoal, and J. L. E. Santos. The K Shortest Paths Problem. Research Report. CISUC, Portugal, 1998. http://www.mat.uc.pt/̃eqvm/cientificos/investigacao/r_papers.html. Accessed Jun. 6, 2001.
26. Jiménez, V. M., and A. Marzal. Computing the K Shortest Paths: A New Algorithm and An Experimental Comparison. Algorithm Engineering, Lecture Notes in Computer Science Series, Vol. 1668, 1999, pp. 15-29.
27. Wardrop, J. G. Some Theoretical Aspects of Road Traffic Research. Proceedings of the Institute of Civil Engineers, Part II, Vol. 1, 1952, pp. 325-378.
28. Baszraa, M. S., J. J. Jarvis, and H. D. Sherali. Linear Programming and Network Flows. John Wiley & Sons, Inc., New York, 1990.
29. Gur, Y., M. Turnquist, M. Schneider, L. LeBlanc, and D. Kurth. Estimation of an Origin-Destination Trip Table Based on Observed Link Volumes and Turning Movements, Volume 1: Technical Report. Report FHWA/RD-80/034. FHWA, U.S. Department of Transportation, 1980.
30. Beagan, D. F. Maximum Entropy Matrix Estimation (ME2). Memorandum, Central Transportation Planning Staff, Boston, Mass., 1990.
31. Bromage, E. J. The Highway Emulator, Release 3.0. Central Transportation Planning Staff, Boston, Mass., 1988.
32. Hearn, D., and D. Kim. RSDTA User Manual. Center for Applied Optimization, Department of Industrial and Systems Engineering, University of Florida, Gainesville, 1995.