{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,5]],"date-time":"2026-07-05T10:49:26Z","timestamp":1783248566445,"version":"3.54.6"},"reference-count":24,"publisher":"MDPI AG","issue":"9","license":[{"start":{"date-parts":[[2022,8,28]],"date-time":"2022-08-28T00:00:00Z","timestamp":1661644800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Natural Science Fund for Colleges and Universities in Jiangsu Province","award":["20KJB580016"],"award-info":[{"award-number":["20KJB580016"]}]},{"name":"Natural Science Fund for Colleges and Universities in Jiangsu Province","award":["2020SJA0133"],"award-info":[{"award-number":["2020SJA0133"]}]},{"name":"Natural Science Fund for Colleges and Universities in Jiangsu Province","award":["202102055014"],"award-info":[{"award-number":["202102055014"]}]},{"name":"Natural Science Fund for Colleges and Universities in Jiangsu Province","award":["CX2018011"],"award-info":[{"award-number":["CX2018011"]}]},{"name":"General Program of Philosophy and Social Science Research in Jiangsu Universities","award":["20KJB580016"],"award-info":[{"award-number":["20KJB580016"]}]},{"name":"General Program of Philosophy and Social Science Research in Jiangsu Universities","award":["2020SJA0133"],"award-info":[{"award-number":["2020SJA0133"]}]},{"name":"General Program of Philosophy and Social Science Research in Jiangsu Universities","award":["202102055014"],"award-info":[{"award-number":["202102055014"]}]},{"name":"General Program of Philosophy and Social Science Research in Jiangsu Universities","award":["CX2018011"],"award-info":[{"award-number":["CX2018011"]}]},{"name":"MOE of PRC Industry-University Collaborative Education Program","award":["20KJB580016"],"award-info":[{"award-number":["20KJB580016"]}]},{"name":"MOE of PRC Industry-University Collaborative Education Program","award":["2020SJA0133"],"award-info":[{"award-number":["2020SJA0133"]}]},{"name":"MOE of PRC Industry-University Collaborative Education Program","award":["202102055014"],"award-info":[{"award-number":["202102055014"]}]},{"name":"MOE of PRC Industry-University Collaborative Education Program","award":["CX2018011"],"award-info":[{"award-number":["CX2018011"]}]},{"name":"Science and Technology Innovation Fund for Youth Scientists of Nanjing Forestry University","award":["20KJB580016"],"award-info":[{"award-number":["20KJB580016"]}]},{"name":"Science and Technology Innovation Fund for Youth Scientists of Nanjing Forestry University","award":["2020SJA0133"],"award-info":[{"award-number":["2020SJA0133"]}]},{"name":"Science and Technology Innovation Fund for Youth Scientists of Nanjing Forestry University","award":["202102055014"],"award-info":[{"award-number":["202102055014"]}]},{"name":"Science and Technology Innovation Fund for Youth Scientists of Nanjing Forestry University","award":["CX2018011"],"award-info":[{"award-number":["CX2018011"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>Traffic parameter characteristics in congested road networks are explored based on traffic flow theory, and observed variables are transformed to a uniform format. The Gaussian mixture model is used to reconstruct route trajectories based on data regarding travel routes containing only the origin and destination information. Using a bi-level optimization framework, a Bayesian traffic demand estimation model was built using route trajectory reconstruction in congested networks. Numerical examples demonstrate that traffic demand estimation errors, without considering a congested network, are within \u00b112; whereas estimation demands considering traffic congestion are close to the real values. Using the Gaussian mixture model\u2019s technology of trajectory reconstruction, the mean of the traffic demand root mean square error can be stabilized to approximately 1.3. Traffic demand estimation accuracy decreases with an increase in observed data usage, and the designed iterative algorithm can predict convergence with 0.06 accuracy. The evolution rules of urban traffic demands and road flows in congested networks are uncovered, and a theoretical basis for alleviating urban traffic congestion is provided to determine traffic management and control strategies.<\/jats:p>","DOI":"10.3390\/a15090307","type":"journal-article","created":{"date-parts":[[2022,8,28]],"date-time":"2022-08-28T21:22:56Z","timestamp":1661721776000},"page":"307","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Traffic Demand Estimations Considering Route Trajectory Reconstruction in Congested Networks"],"prefix":"10.3390","volume":"15","author":[{"given":"Wenyun","family":"Tang","sequence":"first","affiliation":[{"name":"College of Automobile and Traffic Engineering, Nanjing Forestry University, Nanjing 210037, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jiahui","family":"Chen","sequence":"additional","affiliation":[{"name":"College of Automobile and Traffic Engineering, Nanjing Forestry University, Nanjing 210037, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chao","family":"Sun","sequence":"additional","affiliation":[{"name":"School of Automotive and Traffic Engineering, Jiangsu University, Zhenjiang 212013, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hanbing","family":"Wang","sequence":"additional","affiliation":[{"name":"College of Automobile and Traffic Engineering, Nanjing Forestry University, Nanjing 210037, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5535-6467","authenticated-orcid":false,"given":"Gen","family":"Li","sequence":"additional","affiliation":[{"name":"College of Automobile and Traffic Engineering, Nanjing Forestry University, Nanjing 210037, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"1968","published-online":{"date-parts":[[2022,8,28]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/j.trb.2009.06.004","article-title":"Robust congestion pricing under boundedly rational user equilibrium","volume":"44","author":"Lou","year":"2010","journal-title":"Transp. Res. Part B Methodol."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"3987278","DOI":"10.1155\/2019\/3987278","article-title":"Lagrangian relaxation for the multiple constrained robust shortest path problem","volume":"2019","author":"Pan","year":"2019","journal-title":"Math. Probl. Eng."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"823","DOI":"10.1016\/j.trb.2007.02.004","article-title":"A structural state space model for real-time traffic origin\u2013destination demand estimation and prediction in a day-to-day learning framework","volume":"41","author":"Zhou","year":"2007","journal-title":"Transp. Res. Part B Methodol."},{"key":"ref_4","unstructured":"Willumsen, L.G. (1978). Estimation of OD matrix from traffic counts\u2014A review. Working Paper. Inst. Transp. Stud. Univ. Leeds., Available online: https:\/\/www.semanticscholar.org\/paper\/ESTIMATION-OF-AN-O-D-MATRIX-FROM-TRAFFIC-COUNTS-A-Willumsen\/87d6a7d6d04bc27ad23f422ae471f3d888481a8f."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"674","DOI":"10.1016\/j.trb.2010.01.006","article-title":"Bayesian inference for network-based models with a linear inverse structure","volume":"44","author":"Hazelton","year":"2010","journal-title":"Transp. Res. Part B Methodol."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/j.trb.2011.09.009","article-title":"Estimation of origin-destination matrices from link counts and sporadic routing data","volume":"46","author":"Parry","year":"2012","journal-title":"Transp. Res. Part B Methodol."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"9717582","DOI":"10.1155\/2016\/9717582","article-title":"Three revised kalman filtering models for short-term rail transit passenger flow prediction","volume":"2016","author":"Jiao","year":"2016","journal-title":"Math. Probl. Eng."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1016\/j.trb.2017.10.007","article-title":"Stochastic travel demand estimation: Improving network identifiability using multi-day observation sets","volume":"107","author":"Yang","year":"2018","journal-title":"Transp. Res. Part B Methodol."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"6699674","DOI":"10.1155\/2021\/6699674","article-title":"Do the Effects of ICT Use on Trip Generation Vary across Travel Modes? Evidence from Beijing","volume":"2021","author":"Yin","year":"2021","journal-title":"J. Adv. Transp."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/s11067-016-9322-1","article-title":"Path flow and trip matrix estimation using link flow density","volume":"17","author":"Grange","year":"2017","journal-title":"Netw. Spat. Econ."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"72","DOI":"10.3141\/2669-08","article-title":"Sensitivity-based linear approximation method to estimate time-dependent origin-destination demand in congested networks","volume":"2669","author":"Shafiei","year":"2017","journal-title":"Transp. Res. Rec."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"102747","DOI":"10.1016\/j.trc.2020.102747","article-title":"Estimating multi-class dynamic origin-destination demand through a forward-backward algorithm on computational graphs","volume":"119","author":"Ma","year":"2020","journal-title":"Transp. Res. Part C"},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"27","DOI":"10.3141\/2498-04","article-title":"Flow-based and density-based time-dependent demand estimation for congested urban transportation networks","volume":"2498","author":"Abdelghany","year":"2020","journal-title":"Transp. Res. Rec."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"1123","DOI":"10.1007\/s11067-019-09449-6","article-title":"Subnetwork origin-destination matrix estimation under travel demand constraints","volume":"19","author":"Sun","year":"2019","journal-title":"Netw. Spat. Econ."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1016\/j.trc.2019.05.014","article-title":"A Data driven method for OD matrix estimation","volume":"113","author":"Krishnakumari","year":"2020","journal-title":"Transp. Res. Part C Emerg. Technol."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"103044","DOI":"10.1016\/j.trc.2021.103044","article-title":"Transit OD matrix estimation using smartcard data: Recent developments and future research challenges","volume":"125","author":"Hussain","year":"2021","journal-title":"Transp. Res. Part C"},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"114554","DOI":"10.1016\/j.eswa.2020.114554","article-title":"Bi-objective traffic count location model for mean and covariance of origin-destination estimation","volume":"170","author":"Sun","year":"2021","journal-title":"Expert Syst. Appl."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1287\/trsc.30.1.32","article-title":"Non-convex traffic assignment on a rectangular grid network","volume":"30","author":"Newell","year":"1996","journal-title":"Transp. Sci."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"178","DOI":"10.3141\/2124-17","article-title":"Analysis of traffic flow characteristics on ring road expressways in Beijing: Using floating car data and remote traffic microwave sensor data","volume":"2124","author":"Zhao","year":"2009","journal-title":"Transp. Res. Rec."},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Zivkovic, Z. (2004). Improved adaptive Gaussian mixture model for background subtraction. Proceedings of the International Conference on Pattern Recognition, IEEE Computer Society.","DOI":"10.1109\/ICPR.2004.1333992"},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.2517-6161.1977.tb01600.x","article-title":"Maximum likelihood from incomplete data via the EM algorithm","volume":"39","author":"Dempster","year":"1977","journal-title":"J. R. Stat. Soc."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1016\/0191-2615(83)90030-9","article-title":"Inferences on trip matrices from observations on link volumes: A Bayesian statistical approach","volume":"17","author":"Maher","year":"1983","journal-title":"Transp. Res. Part B Methodol."},{"key":"ref_23","first-page":"185","article-title":"An efficient method for computing traffic equilibria in networks with asymmetric transportation costs","volume":"18","author":"Nguyen","year":"1984","journal-title":"Transp."},{"key":"ref_24","unstructured":"Leblanc, L.J. (1973). Mathematical Programming Algorithms for Large Scale Network Equilibrium and Network Design Problems. [Ph.D. Thesis, Northwestern University]."}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/15\/9\/307\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T00:19:08Z","timestamp":1760141948000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/15\/9\/307"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,28]]},"references-count":24,"journal-issue":{"issue":"9","published-online":{"date-parts":[[2022,9]]}},"alternative-id":["a15090307"],"URL":"https:\/\/doi.org\/10.3390\/a15090307","relation":{},"ISSN":["1999-4893"],"issn-type":[{"value":"1999-4893","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,8,28]]}}}