Conference Proceeding Article
Historical traffic information is valuable for transportation analysis and planning, as well as for route search services. In view of these applications, we propose the k traffic-tolerant paths problem (TTP) on road networks, which takes a source-destination pair and historical traffic information as input, and returns k paths that minimize the aggregate (historical) travel time. Unlike the shortest path problem, the TTP problem has a combinatorial search space that renders the optimal solution expensive to compute. We propose an exact algorithm and a heuristic algorithm for this problem. Experiments on real traffic data demonstrate the effectiveness of TTP paths and the efficiency of our proposed algorithms.
Road networks, Road traffic
Databases and Information Systems | Transportation
Data Management and Analytics
SIGSPATIAL '14: Proceedings of the 22nd ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems: 4-7 November 2014, 2014, Dallas
City or Country
LI, Pui Hang; YIU, Man Lung; and MOURATIDIS, Kyriakos.
Historical Traffic-Tolerant Paths in Road Networks. (2014). SIGSPATIAL '14: Proceedings of the 22nd ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems: 4-7 November 2014, 2014, Dallas. 477-480. Research Collection School Of Information Systems.
Available at: http://ink.library.smu.edu.sg/sis_research/2327
Creative Commons License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License.