Please use this identifier to cite or link to this item:
PIRA download icon_1.1View/Download Full Text
DC FieldValueLanguage
dc.contributorDepartment of Civil and Environmental Engineeringen_US
dc.creatorMa, Wen_US
dc.creatorPi, Xen_US
dc.creatorQian, Sen_US
dc.publisherPergamon Pressen_US
dc.rights© 2020 The Authors. Published by Elsevier Ltd. This is an open access article under the CC BY-NC-ND license (
dc.rightsThe following publication Ma, W., Pi, X., & Qian, S. (2020). Estimating multi-class dynamic origin-destination demand through a forward-backward algorithm on computational graphs. Transportation Research Part C: Emerging Technologies, 119, 102747 is available at
dc.subjectDynamic networksen_US
dc.subjectMachine learningen_US
dc.subjectMulti-source dataen_US
dc.subjectNeural networken_US
dc.subjectO-D estimationen_US
dc.titleEstimating multi-class dynamic origin-destination demand through a forward-backward algorithm on computational graphsen_US
dc.typeJournal/Magazine Articleen_US
dcterms.abstractTransportation networks are unprecedentedly complex with heterogeneous vehicular flow. Conventionally, vehicles are classified by size, the number of axles or engine types, e.g., standard passenger cars versus trucks. However, vehicle flow heterogeneity stems from many other aspects in general, e.g., ride-sourcing vehicles versus personal vehicles, human driven vehicles versus connected and automated vehicles. Provided with some observations of vehicular flow for each class in a large-scale transportation network, how to estimate the multi-class spatio-temporal vehicular flow, in terms of time-varying Origin-Destination (OD) demand and path/link flow, remains a big challenge. This paper presents a solution framework for multi-class dynamic OD demand estimation (MCDODE) in large-scale networks that work for any vehicular data in general. The proposed framework cast the standard OD estimation methods into a computational graph with tensor representations of spatio-temporal flow and all intermediate features involved in the MCDODE formulation. A forward-backward algorithm is proposed to efficiently solve the MCDODE formulation on computational graphs. In addition, we propose a novel concept of tree-based cumulative curves to compute the exact multi-class Dynamic Assignment Ratio (DAR) matrix. A Growing Tree algorithm is developed to construct tree-based cumulative curves. The proposed framework is examined on a small network, a mid-size network as well as a real-world large-scale network. The experiment results indicate that the proposed framework is compelling, satisfactory and computationally plausible.en_US
dcterms.accessRightsopen accessen_US
dcterms.bibliographicCitationTransportation research. Part C, Emerging technologies, Oct 2020, v. 119, 102747, p. 1-30en_US
dcterms.isPartOfTransportation research. Part C, Emerging technologiesen_US
dc.description.validate202009 bcrcen_US
dc.description.oaVersion of Recorden_US
dc.identifier.FolderNumbera0988-n01, OA_Othersen_US
Appears in Collections:Journal/Magazine Article
Files in This Item:
File Description SizeFormat 
Ma_Estimating_multi_class.pdf7.78 MBAdobe PDFView/Open
Open Access Information
Status open access
File Version Version of Record
View full-text via PolyU eLinks SFX Query
Show simple item record

Page views

Citations as of Oct 2, 2022


Citations as of Oct 2, 2022


Citations as of Oct 6, 2022

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.