Heuristic algorithms for route-search queries over geographical data

Yaron Kanza*, Eliyahu Safra, Yehoshua Sagiv, Yerach Doytsher

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

16 Scopus citations

Abstract

In a geographical route search, given search terms, the goal is to find an effective route that (1) starts at a given location, (2) ends at a given location, and (3) travels via geographical entities that are relevant to the given terms. A route is effective if it does not exceed a given distance limit whereas the ranking scores of the visited entities, with respect to the search terms, are maximal. This paper introduces route-search queries, suggests three semantics for such queries and deals with the problem of e ciently answering queries under the different semantics. Since the problem of answering route-search queries is a generalization of the traveling salesman problem, it is unlikely to have an e cient solution, i.e., there is no polynomial-time algorithm that solves the problem (unless P=NP). Hence, in this work we consider heuristics for the problem. Methods for effectively computing routes are presented. The methods are compared analytically and experimentally. For these methods, experiments on both synthetic and real-world data illustrate their efficiency and their effectiveness in computing a route that satisfies the constraints of a route-search query.

Original languageEnglish
Title of host publicationProceedings of the 16th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, ACM GIS 2008
Pages75-84
Number of pages10
DOIs
StatePublished - 2008
Event16th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, ACM GIS 2008 - Irvine, CA, United States
Duration: 5 Nov 20087 Nov 2008

Publication series

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

Conference

Conference16th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, ACM GIS 2008
Country/TerritoryUnited States
CityIrvine, CA
Period5/11/087/11/08

Keywords

  • Approximation algorithms
  • Geographic information system
  • Heuristic algorithms
  • Path
  • Route
  • Search

Fingerprint

Dive into the research topics of 'Heuristic algorithms for route-search queries over geographical data'. Together they form a unique fingerprint.

Cite this