TY - GEN
T1 - Multi-type nearest neighbor queries in road networks with time window constraints
AU - Ma, Xiaobin
AU - Shekhar, Shashi
AU - Xiong, Hui
PY - 2009
Y1 - 2009
N2 - This paper presents a study of Multi-type Nearest Neighbor (MTNN) Queries in road networks with time window constraints. Specifically, we provide a label correcting algorithm, which is based on a time aggregated multi-type graph. This algorithm gives the best start time, a turn-by-turn route, and the shortest path in terms of least travel time for a given MTNN query.
AB - This paper presents a study of Multi-type Nearest Neighbor (MTNN) Queries in road networks with time window constraints. Specifically, we provide a label correcting algorithm, which is based on a time aggregated multi-type graph. This algorithm gives the best start time, a turn-by-turn route, and the shortest path in terms of least travel time for a given MTNN query.
KW - GIS
KW - Location-based service
KW - MTNN query
UR - http://www.scopus.com/inward/record.url?scp=74049148777&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=74049148777&partnerID=8YFLogxK
U2 - 10.1145/1653771.1653850
DO - 10.1145/1653771.1653850
M3 - Conference contribution
AN - SCOPUS:74049148777
SN - 9781605586496
T3 - GIS: Proceedings of the ACM International Symposium on Advances in Geographic Information Systems
SP - 484
EP - 487
BT - 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, ACM SIGSPATIAL GIS 2009
T2 - 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, ACM SIGSPATIAL GIS 2009
Y2 - 4 November 2009 through 6 November 2009
ER -
