Skyline Trips of Multiple POIs Categories

Many people take the same path every day, such as taking a specific autobahn to get home from work. However, one needs to frequently divert from this path, e.g., to visit a Point of Interest (POI) from a category like the category of restaurants or ATMs. Usually, people want to minimize not only their overall travel cost but also their detour cost, i.e., one wants to return to the known path as fast as possible. Finding such a POI minimizing both costs efficiently is highly challenging in case one considers time-dependent road networks which are the case in real-world scenarios. For such road networks time decency means the time a user needs to traverse a road, heavily depends on the user's arrival time on that road. Prior works have several limitations, such as assuming that travel costs are coming from a metric space and do not change over time. Both assumptions hardly match real-world requirements: Just think of traffic jams at the rush hour. To overcome these limitations, we study how to solve this problem considering time-dependent road networks relying on linear skylines. Our main contribution is an efficient algorithm called STACY to find all non-dominated paths. A large-scale empirical evaluation on real-world data reveals that STACY is accurate, efficient and effective in real-world settings.

show abstract

“…Since the introduction of skylines [3], it has become a key approach in the field of route planning [2,11,13,15,18,21,22].…”

Section: Related Workmentioning

confidence: 99%

Visit Places on Your Way: A Skyline Approach in Time-Dependent Networks

Taghizadeh¹,

Elekes²,

Schäler³

2021

2021 22nd IEEE International Conference on Mobile Data Management (MDM)

View full text Add to dashboard Cite

show abstract

“…Few studies have considered the skyline concept for route searches. Recently, the skyline route (or skyline path) has received considerable attention [1,6,8,13,17,18,20]. A skyline route assumes that edges on road networks are associated with multiple costs, such as distance, travel time, and tolls.…”

Section: Related Workmentioning

confidence: 99%

Sequenced Route Query with Semantic Hierarchy

Sasaki,

Ishikawa,

Fujiwara

et al. 2020

Preprint

View full text Add to dashboard Cite

The trip planning query searches for preferred routes starting from a given point through multiple Point-of-Interests (PoI) that match user requirements. Although previous studies have investigated trip planning queries, they lack flexibility for finding routes because all of them output routes that strictly match user requirements. We study trip planning queries that output multiple routes in a flexible manner. We propose a new type of query called skyline sequenced route (SkySR) query, which searches for all preferred sequenced routes to users by extending the shortest route search with the semantic similarity of PoIs in the route. Flexibility is achieved by the semantic hierarchy of the PoI category. We propose an efficient algorithm for the SkySR query, bulk SkySR algorithm that simultaneously searches for sequenced routes and prunes unnecessary routes effectively. Experimental evaluations show that the proposed approach significantly outperforms the existing approaches in terms of response time (up to four orders of magnitude). Moreover, we develop a prototype service that uses the SkySR query, and conduct a user test to evaluate its usefulness.

show abstract

“…Many researchers have looked to broaden the works in [15] and [21]. Aljubayrin et al [1] examined the issue of skyline trips on different POI classes. Hsu et al [10] connected the possibility of a skyline path to the arranging of treks to beat the conventional problem of acquiring multicriteria answers.…”

Section: Related Workmentioning

confidence: 99%

“…Such skyline results are important for users to take effective decisions over complex data having many conflicting criteria. A number of efficient algorithms for computing skylines from the database have been demonstrated in the literature [1,2,3,4,5,6].…”

Section: Introductionmentioning

confidence: 99%

Skyline Path Queries for Location-based Services

Chowdhury¹,

Shamsul²

2019

IJACSA

View full text Add to dashboard Cite

A skyline query finds objects that are not dominated by another object from a given set of objects. Skyline queries help us to filter unnecessary information efficiently and provide us clues for various decision making tasks. In this paper, we consider skyline queries for location-based services and proposed a framework that can efficiently compute all nondominated paths in road networks. A path p is said to dominate another path q if p is not worse than q in any of the k dimensions and p is better than q in at least one of the k dimensions. Our proposed skyline framework considers several features related to road networks and return all non-dominated paths from the road networks. In our work, we compute skylines considering two different perspectives: business perspective and individual user's perspective. We have conducted several experiments to show the effectiveness of our method. From the experimental results, we can say that our system can perform efficient computation of skyline paths from road networks.

show abstract

Skyline Trips of Multiple POIs Categories

Cited by 13 publications

References 27 publications

Visit Places on Your Way: A Skyline Approach in Time-Dependent Networks

Visit Places on Your Way: A Skyline Approach in Time-Dependent Networks

Sequenced Route Query with Semantic Hierarchy

Skyline Path Queries for Location-based Services

Contact Info

Product

Resources

About