IDEAS home Printed from https://ideas.repec.org/a/gam/jsusta/v15y2023i13p9881-d1176088.html
   My bibliography  Save this article

Residual Neural Networks for Origin–Destination Trip Matrix Estimation from Traffic Sensor Information

Author

Listed:
  • Abdullah Alshehri

    (Department of Civil and Environmental Engineering, College of Engineering, Majmaah University, Majmaah 11952, Saudi Arabia)

  • Mahmoud Owais

    (Civil Engineering Department, Faculty of Engineering, Assiut University, Assiut 71516, Egypt
    Civil Engineering Department, Faculty of Engineering, Sphinx University, New Assiut 71515, Egypt)

  • Jayadev Gyani

    (Department of Computer Science, College of Computer and Information Sciences, Majmaah University, Majmaah 11952, Saudi Arabia)

  • Mishal H. Aljarbou

    (Department of Civil and Environmental Engineering, College of Engineering, Majmaah University, Majmaah 11952, Saudi Arabia)

  • Saleh Alsulamy

    (Department of Architecture and Planning, College of Engineering, King Khalid University, Abha 61421, Saudi Arabia)

Abstract

Traffic management and control applications require comprehensive knowledge of traffic flow data. Typically, such information is gathered using traffic sensors, which have two basic challenges: First, it is impractical or impossible to install sensors on every arc in a network. Second, sensors do not provide direct information on origin-to-destination (O–D) demand flows. Consequently, it is essential to identify the optimal locations for deploying traffic sensors and then enhance the knowledge gained from this link flow sample to forecast the network’s traffic flow. This article presents residual neural networks—a very deep set of neural networks—to the problem for the first time. The suggested architecture reliably predicts the whole network’s O–D flows utilizing link flows, hence inverting the standard traffic assignment problem. It deduces a relevant correlation between traffic flow statistics and network topology from traffic flow characteristics. To train the proposed deep learning architecture, random synthetic flow data was generated from the historical demand data of the network. A large-scale network was used to test and confirm the model’s performance. Then, the Sioux Falls network was used to compare the results with the literature. The robustness of applying the proposed framework to this particular combined traffic flow problem was determined by maintaining superior prediction accuracy over the literature with a moderate number of traffic sensors.

Suggested Citation

  • Abdullah Alshehri & Mahmoud Owais & Jayadev Gyani & Mishal H. Aljarbou & Saleh Alsulamy, 2023. "Residual Neural Networks for Origin–Destination Trip Matrix Estimation from Traffic Sensor Information," Sustainability, MDPI, vol. 15(13), pages 1-21, June.
  • Handle: RePEc:gam:jsusta:v:15:y:2023:i:13:p:9881-:d:1176088
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2071-1050/15/13/9881/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2071-1050/15/13/9881/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Fisk, Caroline, 1980. "Some developments in equilibrium traffic assignment," Transportation Research Part B: Methodological, Elsevier, vol. 14(3), pages 243-255, September.
    2. Warren B. Powell & Yosef Sheffi, 1982. "The Convergence of Equilibrium Algorithms with Predetermined Step Sizes," Transportation Science, INFORMS, vol. 16(1), pages 45-55, February.
    3. Heinz Spiess, 1990. "Technical Note—Conical Volume-Delay Functions," Transportation Science, INFORMS, vol. 24(2), pages 153-158, May.
    4. S. F. A. Batista & Ludovic Leclercq, 2019. "Regional Dynamic Traffic Assignment Framework for Macroscopic Fundamental Diagram Multi-regions Models," Transportation Science, INFORMS, vol. 53(6), pages 1563-1590, November.
    5. F. Benjamin Zhan & Charles E. Noon, 1998. "Shortest Path Algorithms: An Evaluation Using Real Road Networks," Transportation Science, INFORMS, vol. 32(1), pages 65-73, February.
    6. Hu, Shou-Ren & Peeta, Srinivas & Chu, Chun-Hsiao, 2009. "Identification of vehicle sensor locations for link-based network traffic applications," Transportation Research Part B: Methodological, Elsevier, vol. 43(8-9), pages 873-894, September.
    7. Lan, Guanghui & DePuy, Gail W. & Whitehouse, Gary E., 2007. "An effective and simple heuristic for the set covering problem," European Journal of Operational Research, Elsevier, vol. 176(3), pages 1387-1403, February.
    8. Maher, Michael J. & Zhang, Xiaoyan & Vliet, Dirck Van, 2001. "A bi-level programming approach for trip matrix estimation and traffic control problems with stochastic user equilibrium link flows," Transportation Research Part B: Methodological, Elsevier, vol. 35(1), pages 23-40, January.
    9. Wang, Jian & Peeta, Srinivas & He, Xiaozheng, 2019. "Multiclass traffic assignment model for mixed traffic flow of human-driven vehicles and connected and autonomous vehicles," Transportation Research Part B: Methodological, Elsevier, vol. 126(C), pages 139-168.
    10. Hadavi, Majid & Shafahi, Yousef, 2016. "Vehicle identification sensor models for origin–destination estimation," Transportation Research Part B: Methodological, Elsevier, vol. 89(C), pages 82-106.
    11. Maher, M. J., 1983. "Inferences on trip matrices from observations on link volumes: A Bayesian statistical approach," Transportation Research Part B: Methodological, Elsevier, vol. 17(6), pages 435-447, December.
    12. He, Sheng-xue, 2013. "A graphical approach to identify sensor locations for link flow inference," Transportation Research Part B: Methodological, Elsevier, vol. 51(C), pages 65-76.
    13. Nie, Yu & Zhang, H. M. & Lee, Der-Horng, 2004. "Models and algorithms for the traffic assignment problem with link capacity constraints," Transportation Research Part B: Methodological, Elsevier, vol. 38(4), pages 285-312, May.
    14. Spiess, Heinz, 1987. "A maximum likelihood model for estimating origin-destination matrices," Transportation Research Part B: Methodological, Elsevier, vol. 21(5), pages 395-412, October.
    15. Yang, Hai, 1995. "Heuristic algorithms for the bilevel origin-destination matrix estimation problem," Transportation Research Part B: Methodological, Elsevier, vol. 29(4), pages 231-242, August.
    16. Yang, Hai & Iida, Yasunori & Sasaki, Tsuna, 1991. "An analysis of the reliability of an origin-destination trip matrix estimated from traffic counts," Transportation Research Part B: Methodological, Elsevier, vol. 25(5), pages 351-363, October.
    17. Nie, Yu & Zhang, H.M. & Recker, W.W., 2005. "Inferring origin-destination trip matrices with a decoupled GLS path flow estimator," Transportation Research Part B: Methodological, Elsevier, vol. 39(6), pages 497-518, July.
    18. Lo, Hong K. & Chen, Anthony & Castillo, Enrique, 2016. "Robust network sensor location for complete link flow observability under uncertaintyAuthor-Name: Xu, Xiangdong," Transportation Research Part B: Methodological, Elsevier, vol. 88(C), pages 1-20.
    19. M. Gentili & P. Mirchandani, 2005. "Locating Active Sensors on Traffic Networks," Annals of Operations Research, Springer, vol. 136(1), pages 229-257, April.
    20. Fu, Chenyi & Zhu, Ning & Ling, Shuai & Ma, Shoufeng & Huang, Yongxi, 2016. "Heterogeneous sensor location model for path reconstruction," Transportation Research Part B: Methodological, Elsevier, vol. 91(C), pages 77-97.
    21. Bierlaire, Michel, 2002. "The total demand scale: a new measure of quality for static and dynamic origin-destination trip tables," Transportation Research Part B: Methodological, Elsevier, vol. 36(9), pages 837-850, November.
    22. Lo, Hing-Po & Chan, Chi-Pak, 2003. "Simultaneous estimation of an origin-destination matrix and link choice proportions using traffic counts," Transportation Research Part A: Policy and Practice, Elsevier, vol. 37(9), pages 771-788, November.
    23. Ehlert, Anett & Bell, Michael G.H. & Grosso, Sergio, 2006. "The optimisation of traffic count locations in road networks," Transportation Research Part B: Methodological, Elsevier, vol. 40(6), pages 460-479, July.
    24. Castillo, Enrique & Menéndez, José María & Sánchez-Cambronero, Santos, 2008. "Predicting traffic flow using Bayesian networks," Transportation Research Part B: Methodological, Elsevier, vol. 42(5), pages 482-509, June.
    25. V. Chvatal, 1979. "A Greedy Heuristic for the Set-Covering Problem," Mathematics of Operations Research, INFORMS, vol. 4(3), pages 233-235, August.
    26. Yang, Hai & Zhou, Jing, 1998. "Optimal traffic counting locations for origin-destination matrix estimation," Transportation Research Part B: Methodological, Elsevier, vol. 32(2), pages 109-126, February.
    27. Cascetta, Ennio, 1984. "Estimation of trip matrices from traffic counts and survey data: A generalized least squares estimator," Transportation Research Part B: Methodological, Elsevier, vol. 18(4-5), pages 289-299.
    28. Enrique Castillo & Pilar Jiménez & José Menéndez & María Nogal, 2013. "A Bayesian method for estimating traffic flows based on plate scanning," Transportation, Springer, vol. 40(1), pages 173-201, January.
    29. Mahmoud Owais & Abdou S. Ahmed & Ghada S. Moussa & Ahmed A. Khalil, 2020. "An Optimal Metro Design for Transit Networks in Existing Square Cities Based on Non-Demand Criterion," Sustainability, MDPI, vol. 12(22), pages 1-28, November.
    30. Maher, Mike, 1998. "Algorithms for logit-based stochastic user equilibrium assignment," Transportation Research Part B: Methodological, Elsevier, vol. 32(8), pages 539-549, November.
    31. Beasley, J. E. & Chu, P. C., 1996. "A genetic algorithm for the set covering problem," European Journal of Operational Research, Elsevier, vol. 94(2), pages 392-404, October.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Owais, Mahmoud & Moussa, Ghada S. & Hussain, Khaled F., 2019. "Sensor location model for O/D estimation: Multi-criteria meta-heuristics approach," Operations Research Perspectives, Elsevier, vol. 6(C).
    2. Yang, Yudi & Fan, Yueyue, 2015. "Data dependent input control for origin–destination demand estimation using observability analysis," Transportation Research Part B: Methodological, Elsevier, vol. 78(C), pages 385-403.
    3. Simonelli, Fulvio & Marzano, Vittorio & Papola, Andrea & Vitiello, Iolanda, 2012. "A network sensor location procedure accounting for o–d matrix estimate variability," Transportation Research Part B: Methodological, Elsevier, vol. 46(10), pages 1624-1638.
    4. Fu, Hao & Lam, William H.K. & Shao, Hu & Ma, Wei & Chen, Bi Yu & Ho, H.W., 2022. "Optimization of multi-type sensor locations for simultaneous estimation of origin-destination demands and link travel times with covariance effects," Transportation Research Part B: Methodological, Elsevier, vol. 166(C), pages 19-47.
    5. Viti, Francesco & Rinaldi, Marco & Corman, Francesco & Tampère, Chris M.J., 2014. "Assessing partial observability in network sensor location problems," Transportation Research Part B: Methodological, Elsevier, vol. 70(C), pages 65-89.
    6. Louis Grange & Felipe González & Shlomo Bekhor, 2017. "Path Flow and Trip Matrix Estimation Using Link Flow Density," Networks and Spatial Economics, Springer, vol. 17(1), pages 173-195, March.
    7. Salari, Mostafa & Kattan, Lina & Lam, William H.K. & Lo, H.P. & Esfeh, Mohammad Ansari, 2019. "Optimization of traffic sensor location for complete link flow observability in traffic network considering sensor failure," Transportation Research Part B: Methodological, Elsevier, vol. 121(C), pages 216-251.
    8. Rinaldi, Marco & Viti, Francesco, 2017. "Exact and approximate route set generation for resilient partial observability in sensor location problems," Transportation Research Part B: Methodological, Elsevier, vol. 105(C), pages 86-119.
    9. Hai Yang & Qiang Meng & Michael G. H. Bell, 2001. "Simultaneous Estimation of the Origin-Destination Matrices and Travel-Cost Coefficient for Congested Networks in a Stochastic User Equilibrium," Transportation Science, INFORMS, vol. 35(2), pages 107-123, May.
    10. Mínguez, R. & Sánchez-Cambronero, S. & Castillo, E. & Jiménez, P., 2010. "Optimal traffic plate scanning location for OD trip matrix and route estimation in road networks," Transportation Research Part B: Methodological, Elsevier, vol. 44(2), pages 282-298, February.
    11. Xuesong Zhou & George F. List, 2010. "An Information-Theoretic Sensor Location Model for Traffic Origin-Destination Demand Estimation Applications," Transportation Science, INFORMS, vol. 44(2), pages 254-273, May.
    12. Fu, Hao & Lam, William H.K. & Shao, Hu & Kattan, Lina & Salari, Mostafa, 2022. "Optimization of multi-type traffic sensor locations for estimation of multi-period origin-destination demands with covariance effects," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 157(C).
    13. Castillo, Enrique & Menéndez, José María & Jiménez, Pilar, 2008. "Trip matrix and path flow reconstruction and estimation based on plate scanning and link observations," Transportation Research Part B: Methodological, Elsevier, vol. 42(5), pages 455-481, June.
    14. Bera, Sharminda & Rao, K. V. Krishna, 2011. "Estimation of origin-destination matrix from traffic counts: the state of the art," European Transport \ Trasporti Europei, ISTIEE, Institute for the Study of Transport within the European Economic Integration, issue 49, pages 2-23.
    15. Hadavi, Majid & Shafahi, Yousef, 2016. "Vehicle identification sensor models for origin–destination estimation," Transportation Research Part B: Methodological, Elsevier, vol. 89(C), pages 82-106.
    16. Tao Li, 2017. "A Demand Estimator Based on a Nested Logit Model," Transportation Science, INFORMS, vol. 51(3), pages 918-930, August.
    17. Gunnar Flötteröd & Michel Bierlaire & Kai Nagel, 2011. "Bayesian Demand Calibration for Dynamic Traffic Simulations," Transportation Science, INFORMS, vol. 45(4), pages 541-561, November.
    18. Fu, Chenyi & Zhu, Ning & Ma, Shoufeng, 2017. "A stochastic program approach for path reconstruction oriented sensor location model," Transportation Research Part B: Methodological, Elsevier, vol. 102(C), pages 210-237.
    19. Yang, Yudi & Fan, Yueyue & Wets, Roger J.B., 2018. "Stochastic travel demand estimation: Improving network identifiability using multi-day observation sets," Transportation Research Part B: Methodological, Elsevier, vol. 107(C), pages 192-211.
    20. Castillo, Enrique & Menéndez, José María & Sánchez-Cambronero, Santos, 2008. "Predicting traffic flow using Bayesian networks," Transportation Research Part B: Methodological, Elsevier, vol. 42(5), pages 482-509, June.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jsusta:v:15:y:2023:i:13:p:9881-:d:1176088. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.