An Efficient Algorithm for Real-Time Estimation and Prediction of Dynamic OD Tables

References

• Antoniou C., Ben-Akiva M., Bierlaire M., Mishalani R. Demand simulation for dynamic traffic assignment. Proc. 8th IFAC Sympos. Transportation Systems (1997) Chania, GreeceCrossref, Google Scholar
• Ashok K. Estimation and prediction of time-dependent origin-destination flows. (1996) . Ph.D. thesis, Massachusetts Institute of Technology, Cambridge, MAGoogle Scholar
• Ashok K., Ben-Akiva M., Daganzo C. Dynamic origin-destination matrix estimation and prediction for real-time traffic management systems. Transportation and Traffic Theory, Proc. 12th ISTTT. (1993) (Elsevier Science Publishing Company, Inc., Berkeley, CA) Google Scholar
• Ashok K., Ben-Akiva M. Alternative approaches for real-time estimation and prediction of time-dependent origin-destination flows. Transportation Sci. (2000) 34(1):21–36Link, Google Scholar
• Barceló J., Casas J., Coder A. The use of neural networks for short-term prediction of traffic demand. Transportation and Traffic Theory, Proc. 14th ISTTT. (1999) (Pergamon, Jerusalem, Israel) 419–443Google Scholar
• Ben-Akiva M., Bierlaire M., Koutsopoulos H. N., Mishalani R., Gendreau M., Marcotte P. Real-time simulation of traffic demand-supply interactions within DynaMIT. Transportation and Network Analysis: Current Trends. Miscellenea in Honor of Michael Florian (2003) (Kluwer Academic Publishers, Boston, MA) Google Scholar
• Ben-Akiva M., Bierlaire M., Burton D., Koutsopoulos H., Mishalani R. Network state estimation and prediction for real-time transportation management applications. Networks Spatial Econom. (2001) 1(3/4):293–318Crossref, Google Scholar
• Bertsekas D. P.Nonlinear Programming (1995) (Athena Scientific, Belmont MA) Google Scholar
• Bierlaire M., Toint P. L. MEUSE: an origin-destination estimator that exploits structure. Transportation Res. B (1995) 29(1):47–60Crossref, Google Scholar
• Bierlaire M., Mishalani R., Ben-Akiva M. General framework for dynamic demand simulation. (2000) . Technical report RO-000223, ROSODMA-EPFL Swiss Institute of Technology, CH-1015 Lausanne, SwitzerlandGoogle Scholar
• Bierlaire M., Toint P. L., Tuyttens D. On iterative algorithms for linear least squares problems with bound constraints. Linear Algebra Appl. (1991) 143:111–143Crossref, Google Scholar
• Bottom J., Ben-Akiva M., Bierlaire M., Chabini I., Koutsopoulos H., Yang Q., Ceder A. Investigation of route guidance generation issues by simulation with DynaMIT. Transportation and Traffic Theory, Proc. 14th ISTTT. (1999) (Pergamon, Jerusalem, Israel) 577–600Google Scholar
• Cascetta E., Inaudi D., Marquis G. Dynamic estimators of origin-destination matrices using traffic counts. Transportation Sci. (1993) 27(4):363–373Link, Google Scholar
• Casey H. J. Applications to traffic engineering of the law of retail gravitation. Traffic Quart. (1955) 9(1):23–35Google Scholar
• Chang G. L., Wu J. Recursive estimation of time-varying OD flows from traffic counts in freeway corridors. Transportation Res. B (1994) 28(8):141–160Crossref, Google Scholar
• Chui C., Chen G.Kalman Filtering with Real-Time Applications (1991) (Spinger-Verlag, Berlin, Germany) Crossref, Google Scholar
• Florian M., Chen Y. A coordinate descent method for the bilevel OD matrix adjutment problem. IFORS Conf. (1993) (Lisbon, Portugal) Google Scholar
• Golub G. H., Van Loan C. F.Matrix Computations (1996) 3rd ed.(Johns Hopkins University Press, Baltimore, MD) Google Scholar
• Kalman R. E. A new approach to linear filtering and prediction problems. J. Basic Engrg., Trans. ASME, Series D (1960) 82(1):33–45Google Scholar
• Okutani I., Gantner N.H., Wilson N.H.M. The Kalman filtering approaches in some transportation and traffic problems. Transportation and Traffic Theory (1987) (Elsevier, New York) 397–416and Proc. Tenth Int. Symposium Transp. and Traffic Theory July 8–10. MIT, Cambridge, MAGoogle Scholar
• Okutani I., Stephanades Y. Dynamic prediction of traffic volume through Kalman filtering theory. Transportation Res. (1984) 18B(1):1–11Crossref, Google Scholar
• Paige C. C., Saunders M. A. LSQR: An algorithm for sparse linear equations and sparse least squares. ACM Trans. Math. Software (1982) 8:43–71Crossref, Google Scholar
• Smith B. L., Pack M. L., Lovell D. J., Sermons M. W. Transportation management applications of anonymous mobile call sampling. Proc. 11th Annual Meeting ITS America (2001) Miami, FLGoogle Scholar
• The Mathworks, Inc. (1994) . Matlab optimization toolbox, The Mathworks Inc., Natick, MAGoogle Scholar
• Van der Zijpp N. Dynamic origin-destination matrix estimation on motorway networks. (1996) . Ph.D. thesis, Department of Civil Engineering Delft University of Technology, Delft, The NetherlandsGoogle Scholar
• Van der Zijpp N., Hammerslag R. Improved Kalman filtering approach for estimating origin-destination matrices for freeway corridors. Transportation Res. Record (1994) 1443:54–64Google Scholar
• Van Zuylen H. J., Willumsen L. G. The most likely trip matrix estimated from traffic counts. Transportation Res. B (1980) 14:281–293Crossref, Google Scholar
• Willumsen L. G. An entropy maximising model for estimating trip matrices from traffic counts. (1996) . Ph.D. thesis, University of Leeds, U.K.Google Scholar
• Wilson A. G.Entropy in Urban and Regional Modelling (1970) (Pion Press, London U.K.) Google Scholar