Finding the Time-Period-Based Most Frequent Path from Trajectory–Topology

The Time-Period-Based Most Frequent Path (TPMFP) problem has been a hot topic in traffic studies for many years. The TPMFP problem involves finding the most frequent path between two locations by observing the travelling behaviors of drivers in a specific time period. However, the previous researche...

Olles dieđut

Bibliográfalaš dieđut
Váldodahkkit: Jianing Ding, Xin Jin, Zhiheng Li
Materiálatiipa: Artihkal
Giella:English
Almmustuhtton: MDPI AG 2023-05-01
Ráidu:Big Data and Cognitive Computing
Fáttát:
Liŋkkat:https://www.mdpi.com/2504-2289/7/2/88