Multi-type nearest neighbor queries in road networks with time window constraints

Xiaobin Ma, Shashi Shekhar, Hui Xiong

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Scopus citations

Abstract

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.

Original languageEnglish (US)
Title of host publication17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, ACM SIGSPATIAL GIS 2009
Pages484-487
Number of pages4
DOIs
StatePublished - 2009
Event17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, ACM SIGSPATIAL GIS 2009 - Seattle, WA, United States
Duration: Nov 4 2009Nov 6 2009

Publication series

NameGIS: Proceedings of the ACM International Symposium on Advances in Geographic Information Systems

Conference

Conference17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, ACM SIGSPATIAL GIS 2009
Country/TerritoryUnited States
CitySeattle, WA
Period11/4/0911/6/09

ASJC Scopus subject areas

  • Earth-Surface Processes
  • Computer Science Applications
  • Modeling and Simulation
  • Computer Graphics and Computer-Aided Design
  • Information Systems

Keywords

  • GIS
  • Location-based service
  • MTNN query

Fingerprint

Dive into the research topics of 'Multi-type nearest neighbor queries in road networks with time window constraints'. Together they form a unique fingerprint.

Cite this