The optimal sequenced route query

Sharifzadeh, Mehdi; Kolahdouzan, Mohammad R.; Shahabi, Cyrus

doi:10.1007/s00778-006-0038-6

Cited by 160 publications

(172 citation statements)

References 12 publications

(7 reference statements)

Supporting

Mentioning

172

Contrasting

Order By: Relevance

“…Earlier works on route-search queries dealt either with non-probabilistic datasets (e.g., [1,3,7,8,9]), or with the non-interactive version of the problem (e.g., [5,6]). Those results cannot be used to solve the interactive route-search problem that we address in this paper, since they are not designed to take user feedback into account.…”

Section: Related Workmentioning

confidence: 99%

Interactive route search in the presence of order constraints

et al. 2010

View full text Add to dashboard Cite

A route search is an enhancement of an ordinary geographic search. Instead of merely returning a set of entities, the result is a route that goes via entities that are relevant to the search. The input to the problem consists of several search queries, and each query defines a type of geographical entities. When visited, some of the entities succeed in satisfying the user while others fail to do so; however, only the probability of success is known prior to arrival. The main task is to find a route that visits at least one satisfying entity of each type. In an interactive search, the route is computed in steps. In each step, only the next entity of the route is given to the user, and after visiting that entity, the user provides a feedback specifying whether the entity satisfies her. This paper investigates interactive route search in the presence of order constraints that specify that some types of entities should be visited before others. We present heuristic algorithms for interactive route search for two cases, depending on whether the constraints define a complete order or a partial one. The main challenge is to utilize the feedback in order to compute a route that is shorter and has a higher degree of success, compared to routes that are computed non-interactively. We also discuss how to compare the results of the algorithms and introduce suitable measures for doing so. Experiments on real-world data illustrate the efficiency and effectiveness of our algorithms.

show abstract

Section: Related Workmentioning

confidence: 99%

Interactive route search in the presence of order constraints

et al. 2010

View full text Add to dashboard Cite

show abstract

“…Several papers [3,10,11,14] study route-search queries over datasets in which objects have neither scores nor probabilities. The work of [15] investigates two variants of the shortest-route problem.…”

Section: Related Workmentioning

confidence: 99%

Route Search over Probabilistic Geospatial Data

Kanza

Safra

Sagiv

2009

Advances in Spatial and Temporal Databases

View full text Add to dashboard Cite

Abstract. In a route search over geospatial data, a user provides terms for specifying types of geographical entities that she wishes to visit. The goal is to find a route that (1) starts at a given location, (2) ends at a given location, and (3) travels via geospatial entities that are relevant to the provided search terms. Earlier work studied the problem of finding a route that is effective in the sense that its length does not exceed a given limit, the relevancy of the objects is as high as possible, and the route visits a single object from each specified type. This paper investigates route search over probabilistic geospatial data. It is shown that the notion of an effective route requires a new definition and, specifically, two alternative semantics are proposed. Computing an effective route is more complicated, compared to the non-probabilistic case, and hence necessitates new algorithms. Heuristic methods for computing an effective route, under either one of the two semantics, are developed. (Note that the problem is NP-hard.) These methods are compared analytically and experimentally. In particular, experiments on both synthetic and realworld data illustrate the efficiency and effectiveness of these methods in computing a route under the two semantics.

show abstract

“…Given the hardness of TSP, TSP query is not well studied in database community. Recently, there are TSPlike problems being studied for LBS, which are with constraints to reduce the search space [6,23,33], and find a tour by adding nearest neighbors one by one in a manner of expanding the partial result found. In other words, the work reported [6,23,33] only use one heuristic, namely the nearest neighbor, among many possible heuristics.…”

Section: Introductionmentioning

confidence: 99%

Investigating TSP Heuristics for Location-Based Services

Huang

2017

Data Sci. Eng.

View full text Add to dashboard Cite

Travel planning is one of the important issues in the location-based services (LBS). Traveling salesman problem (TSP) is to find the optimal tour that traverses points exactly once in the minimum total distance. Given the hardness of TSP (NP-hard), TSP query for a given set of points, Q, is not widely studied for online LBS, and the nearest-neighbor heuristic is the only heuristic adapted to find TSP-like tours with additional constraints for LBS. The questions to ask are: Is the nearest-neighbor the best in terms of accuracy? Which heuristics among many should we use to process TSP queries online for LBS? In the literature, TSPLIB benchmarks are designed for special cases where the number of points used is large, and the existing synthetic datasets are based on uniform/normal distributions. Both do not reflect the real datasets used in real applications. Therefore, the best heuristics suggested by the TSPLIB and the existing benchmarks need to be reconsidered for LBS setting. In this work, we investigate 22 heuristics and show that the best heuristics in terms of accuracy for LBS are not the ones suggested by the existing work, and identify several heuristics by extensive performance studies over real datasets, TSPLIB benchmarks, the existing synthetic datasets and our new synthetic datasets. Among many issues, we also show that it is possible to get high-quality TSP by precomputing/indexing, even though it is hard to prove by theorem.

show abstract

The optimal sequenced route query

Cited by 160 publications

References 12 publications

Interactive route search in the presence of order constraints

Interactive route search in the presence of order constraints

Route Search over Probabilistic Geospatial Data

Investigating TSP Heuristics for Location-Based Services

Contact Info

Product

Resources

About