Author:
Saw Vee-Liem,Vismara Luca,Suryadi ,Yang Bo,Johansson Mikael,Chew Lock Yue
Abstract
AbstractPredicting the origin-destination (OD) probability distribution of agent transfer is an important problem for managing complex systems. However, prediction accuracy of associated statistical estimators suffer from underdetermination. While specific techniques have been proposed to overcome this deficiency, there still lacks a general approach. Here, we propose a deep neural network framework with gated recurrent units (DNNGRU) to address this gap. Our DNNGRU is network-free, as it is trained by supervised learning with time-series data on the volume of agents passing through edges. We use it to investigate how network topologies affect OD prediction accuracy, where performance enhancement is observed to depend on the degree of overlap between paths taken by different ODs. By comparing against methods that give exact results, we demonstrate the near-optimal performance of our DNNGRU, which we found to consistently outperform existing methods and alternative neural network architectures, under diverse data generation scenarios.
Publisher
Springer Science and Business Media LLC
Reference63 articles.
1. Coates, A., Hero, A. III., Nowak, R. & Yu, B. Internet tomography. IEEE Signal Process. Mag. 19, 47–65. https://doi.org/10.1109/79.998081 (2002).
2. Kruithof, J. Telefoonverkeersrekening. De Ingenieur 52, E15–E25 (1937).
3. Tebaldi, C. & West, M. Bayesian inference on network traffic using link count data. J. Am. Stat. Assoc. 93, 557–573. https://doi.org/10.1080/01621459.1998.10473707 (1998).
4. Bera, S. & Rao, K. V. K. Estimation of origin-destination matrix from traffic counts: The state of the art. Eur. Transp. 2011, 2–23 (2011).
5. Dey, S., Winter, S. & Tomko, M. Origin-destination flow estimation from link count data only. Sensors 20, 5869. https://doi.org/10.3390/s20185226 (2020).
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献