Estimation of Origin-Destination Matrix with Tolling Data

Abstract:

Prior matrix and surveyed link volumes were, in most cases, employed to estimate origin-destination matrix. With the development of BOT and of congestion pricing, charged links become an important component of road network, due to the fact that the tolling data: volumes and travel time on pricing entry-exit are traffic information, both cost-free and accurate. In this paper, we put forward a bi-level programming model, taking account of data on charging entry-exit to estimate OD matrix based upon the traditional model. Meanwhile, a heuristic method -the simulated annealing approach - is utilized to solve the OD estimation problem. Results of examples indicate that the accuracy of estimation will be improved while adding the tolling data, and that it is feasible to calculate OD matrix by combining the volumes and travel time on entry-exit with partial common link flows. In this light, this way can be applied to enhance accuracy, and also to reduce the cost spent on surveying the link flows in common OD matrix estimation.

• Periodical: Applied Mechanics and Materials (Volumes 50-51)
• Pages: 239-244
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.50-51.239
• Online since: February 2011
• Authors: Hua Wang, Xiao Ning Zhang
• Keywords: Bi-Level Programming, Origin-Destination Matrix Estimation, Tolling Data, Travel Time, Volumes on Pricing Entry-Exit

References

[1] H.P. LO, N. ZHANG, W.H.K. LAM. Estimation of an Origin-Destination Matrix with Random Link Choice Proportions: A Statistical Approach. Transportation Research Part B. 30(1996): 309-324.

DOI: 10.1016/0191-2615(95)00036-4

[2] Wang Wei, Sun Jun. Research on Method of Estimating O-D Matrices for Large-Sized Transportation Network[J]. Journal of Southeast University. 1996, 26(6A): 49-54.

[3] Martin L. Hazelton. Estimation of origin-destination matrices from link flows on uncongested networks. Transportation Research Part B 34 (2000) 549-566.

DOI: 10.1016/s0191-2615(99)00037-5

[4] Javier Doblas, Francisco G. Benitez. An Approach to Estimating and Updating Origin-Destination Matrices Based upon Traffic Counts Preserving the Prior Structure of A Survey Matrix[J]. Transportation Research Part B, 2004, 39(2005): 565-591.

DOI: 10.1016/j.trb.2004.06.006

[5] Fisk CS. Trip matrix estimation from link traffic counts: the congested network case[J]. Transportation Research, 1989, 23(B): 331-336.

DOI: 10.1016/0191-2615(89)90009-x

[6] Hai Yang. Heuristic algorithms for the bilevel origin-destination matrix estimation problem. Transportation research, 1995(29B): 231-242.

DOI: 10.1016/0191-2615(95)00003-v

[7] Jan T. Lundgren, Anders Peterson. A heuristic for the bilevel origin–destination-matrix estimation problem. Transportation Research Part B 42 (2008) 339–354.

DOI: 10.1016/j.trb.2007.09.005

[8] Michael J. Maher, Xiaoyan Zhang, Dirck Van Vliet. A bi-level programming approach for trip matrix estimation and traffic control problems with stochastic user equilibrium link flows. Transportation Research Part B 35 (2001) 23-40.

DOI: 10.1016/s0191-2615(00)00017-5

[9] Chang Yun-tao, Peng Guo-xiong, Yang Xiao-guang. Freeway OD matrices estimation with on/off ramps traffic counts[J]. Journal of Traffic and Transportation Engineering, 2003, 3(4): 89-94.

[10] Sheffi Y. Urban Transportation Networks: Equilibrium Analysis with Mathematical Programming Methods. Prentice-Hall, Englewood Cliffs, NJ, 1985: 116-122.

[11] Zhang Xiaoning. Theories of Congestion Pricing in Transportation Networks[M]. Hefei: Heifei University of Technology Press, (2009).