Multiclass Probit-Based Origin–Destination Estimation Using Multiple Data Types
Publication: Journal of Transportation Engineering, Part A: Systems
Volume 144, Issue 6
Abstract
This paper proposes a bilevel optimization model for multiclass origin–destination (O–D) estimation using various types of data. The multiclass character of the model, a new feature and major contribution to the literature, is important because of increasing interest in simultaneous estimation of O–D tables for various classes of trucks and automobiles. The upper-level optimization is used to derive O–D table entries by minimizing the sum of squared differences between observations from different data sources and the predictions of those values. A probit model is assumed in the lower-level stochastic user equilibrium problem for flow prediction. Extensive experiments have been performed on a test network with different types of link count sensors and turning movements. The tests verify the problem formulation and solution algorithm and offer important insights into the multiclass O–D estimation process with the different types of available data. Adding turning movement data can improve O–D estimation by 71%. Furthermore, classification information is interchangeable among different types of sensors.
Formats available
You can view the full content in the following formats:
Acknowledgments
This research was supported in part by Xerox Corporation and the U.S. Department of Transportation through the Region II University Transportation Research Center. This support is gratefully acknowledged, but the authors are solely responsible for the content and findings of the paper.
References
Al-Battaineh, O., and Kaysi, I. A. (2007). “Genetically-optimized origin-destination estimation (GOODE) model: Application to regional commodity movements in Ontario.” Can. J. Civ. Eng., 34(2), 228–238.
Byrd, R. H., Lu, P., Nocedal, J., and Zhu, C. (1995). “A limited memory algorithm for bound constrained optimization.” SIAM. J. Sci. Comput., 16(5), 1190–1208.
Byrd, R. H., Lu, P., Nocedal, J., and Zhu, C. (1997). “Algorithm 778: L-BFGS-B: Fortran subroutines for large-scale bound-constrained optimization.” ACM. T. Math. Software, 23(4), 550–560.
Daganzo, C. F. (1982). “Unconstrained extremal formulation of some transportation equilibrium problems.” Transp. Sci., 16(3), 332–360.
Dial, R. B. (1971). “A probabilistic multipath traffic assignment algorithm which obviates path enumeration.” Transp. Res., 5(2), 83–111.
FHWA (Federal Highway Administration). (2007). “Quick response freight manual II.”, Washington, DC.
Garcia, C. B., and Zangwill, W. I. (1981). Pathways to solutions, fixed points and equilibria, Prentice-Hall, Englewood Cliffs, NJ.
Ha, T.-J., Lee, S., Kim, J., and Lee, C. (2007). “Gradient method for the estimation of travel demand using traffic counts on a large scale network.” Int. Conf. on Multimedia Modeling, T.-J. Cham, et al., eds., Vol. 4352, Springer, Berlin, 599–605.
LeBlanc, L. J., Morlok, E. K., and Pierskalla, W. (1975). “An efficient approach to solving the road network equilibrium traffic assignment problem.” Transp. Res., 9(5), 309–318.
List, G. F., Konieczny, L. A., Durnford, C. L., and Papayanoulis, V. (2002). “Best-practice truck-flow estimation model for the New York City region.” Transp. Res. Rec., 1790, 97–103.
List, G. F., and Turnquist, M. A. (1994). “Estimating truck travel patterns in urban areas.” Transp. Res. Rec., 1430, 1–9.
List, G. F., and Turnquist, M. A. (1995). “A GIS-based approach for estimating truck flow patterns in urban settings.” J. Adv. Transp., 29(3), 281–298.
Maher, M. J. (1992). “SAM—A stochastic assignment model.” Mathematics in transport planning and control, Oxford University Press, New York, 121–133.
Maher, M. J., Zhang, X., and Van Vliet, D. (2001). “A bi-level programming approach for trip matrix estimation and traffic control problems with stochastic user equilibrium link flows.” Transp. Res., 35B(1), 23–40.
Mendell, N. R., and Elston, R. C. (1974). “Multifactorial qualitative traits: Genetic analysis and prediction of recurrence risks.” Biometrics, 30(1), 41–57.
Morales, J. L., and Nocedal, J. (2011). “Remark on ‘algorithm 778: L-BFGS-B: Fortran subroutines for large-scale bound constrained optimization.’” ACM. T. Math. Software, 23(4), 550–560.
Nihan, N. L., Zhang, X., and Wang, Y. (2002). “Evaluation of dual-loop data accuracy using video ground truth data.”, Univ. of Washington, Seattle.
Raothanachonkun, P., Sano, K., and Matsumoto, S. (2005). “Estimation of multiclass time-varying origin-destination matrices from traffic counts.” Proc. Infrastruct. Plann., 32.
Raothanachonkun, P., Sano, K., and Matsumoto, S. (2006). “Estimation of multiclass origin-destination matrices using genetic algorithm.” Infrastruct. Plann. Rev., 23, 423–432.
Rosa, A., and Maher, M. J. (2002). “Algorithms for solving the probit path-based stochastic user equilibrium traffic assignment problem with one or more user classes.” Proc., 15th Int. Symp. on Transportation and Traffic Theory, Univ. of South Australia, Adelaide.
Wei, H. (2011). “Optimal loop placement and models for length-based vehicle classification and stop-and-go traffic.”, Univ. of Cincinnati, Cincinnati.
Wong, S. C., et al. (2005). “Estimation of multiclass origin-destination matrices from traffic counts.” J. Urban Plann. Dev., 19–29.
Yi, P., Shao, C., and Mao, J. (2010). “Development and preliminary testing of an automatic turning movements identification system.” Ohio Transportation Consortium, Akron, OH.
Yu, X., Prevedouros, P. D., and Sulijoadikusumo, G. (2010). “Evaluation of autoscope, SmartSensor HD, and infra-red traffic logger for vehicle classification.” Transp. Res. Rec., 2160, 77–86.
Information & Authors
Information
Published In
Copyright
This work is made available under the terms of the Creative Commons Attribution 4.0 International license, http://creativecommons.org/licenses/by/4.0/.
History
Received: Jun 13, 2017
Accepted: Oct 20, 2017
Published online: Mar 27, 2018
Published in print: Jun 1, 2018
Discussion open until: Aug 27, 2018
Authors
Metrics & Citations
Metrics
Citations
Download citation
If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.