By Topic

Estimation of Dynamic Origin–Destination Matrices Using Linear Assignment Matrix Approximations

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Toledo, T. ; Fac. of Civil & Environ. Eng., Technion - Israel Inst. of Technol., Haifa, Israel ; Kolechkina, T.

This paper presents a general solution scheme for the problem of offline estimation of dynamic origin-destination (OD) demand matrices using traffic counts on some of the network links and historical demand information. The proposed method uses linear approximations of the assignment matrix, which maps the OD demand to link traffic counts. Several iterative algorithms that are based on this scheme are developed. The various algorithms are implemented in a tool that uses the mesoscopic traffic simulation model Mezzo to conduct network loadings. A case study network in Stockholm, Sweden, is used to test the proposed algorithms and to compare their performance with current state-of-the-art methods. The results demonstrate the applicability of the proposed methodology to efficiently obtain dynamic OD demand estimates for large and complex networks and that, computationally, this methodology outperforms existing methods.

Published in:

Intelligent Transportation Systems, IEEE Transactions on  (Volume:14 ,  Issue: 2 )