Historic traffic information is valuable in transportation analysis and planning, e.g., evaluating the reliability of routes for representative source-destination pairs. Also, it can be utilized to provide efficient and effective route-search services. In view of these applications, we propose the k traffic-tolerant paths (TTP) problem on road networks, which takes a source-destination pair and historic traffic information as input, and returns k paths that minimize the aggregate (historic) travel time. Unlike the shortest path problem, the TTP problem has a combinatorial search space that renders the optimal solution expensive to find. First, we propose an exact algorithm with effective pruning rules to reduce the search time. Second, we develop an anytime heuristic algorithm that makes ‘best-effort’ to find a low-cost solution within a given time limit. Extensive experiments on real and synthetic traffic data demonstrate the effectiveness of TTP and the efficiency of our proposed algorithms.
Road networks, Road traffic
Theory and Algorithms
Data Management and Analytics
Springer Verlag (Germany)
LI, Pui Hang; YIU, Man Lung; and MOURATIDIS, Kyriakos.
Discovering Historic Traffic-tolerant Paths in Road Networks. (2017). GeoInformatica. 21, (1), 1-32. Research Collection School Of Information Systems.
Available at: http://ink.library.smu.edu.sg/sis_research/3430
Creative Commons License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License.