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.
Historical traffic-tolerant paths in road networks
Pui Hang Li,Man Lung Yiu,K. Mouratidis
Published 2014 in SIGSPATIAL/GIS
ABSTRACT
PUBLICATION RECORD
- Publication year
2014
- Venue
SIGSPATIAL/GIS
- Publication date
2014-11-04
- Fields of study
Computer Science, Engineering
- Identifiers
- External record
- Source metadata
Semantic Scholar
CITATION MAP
EXTRACTION MAP
CLAIMS
- No claims are published for this paper.
CONCEPTS
- No concepts are published for this paper.
REFERENCES
Showing 1-6 of 6 references · Page 1 of 1
CITED BY
Showing 1-6 of 6 citing papers · Page 1 of 1