research-article

Finding The Most Preferred Path

Authors:

Dimitris Sacharidis,

Panagiotis Bouros,

Theodoros ChondrogiannisAuthors Info & Claims

SIGSPATIAL '17: Proceedings of the 25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems

Article No.: 5, Pages 1 - 10

https://doi.org/10.1145/3139958.3140029

Published: 07 November 2017 Publication History

Abstract

Consider a road network, and let the preferred subnet consist of the roads a driver is more acquainted to and hence tends to follow. In this paper, we study the problem of finding the most preferred path between two network nodes; we consider two variants of this problem. We first target the Most Preferred Unrestricted Path (MPUP) that has the lowest traveling time in the non-preferred subnet; this problem was introduced in the literature as identifying the safest path though safe zones. As MPUP imposes no constraints on the total traveling time, we then introduce the Most Preferred Near Shortest Path (MPNSP) that has the lowest traveling time in the non-preferred subnet among all paths which are not much slower than the shortest path. We focus on the efficient evaluation of both problems by proposing solutions with simple pre-processing steps. An extensive evaluation demonstrates the efficiency of our techniques compared to the existing method for MPUP and to the state-of-the-art on computing multi-criteria shortest paths for MPNSP.

References

[1]

Ittai Abraham, Daniel Delling, Andrew V. Goldberg, and Renato Fonseca F. Werneck. 2011. A Hub-Based Labeling Algorithm for Shortest Paths in Road Networks. In Experimental Algorithms - 10th International Symposium (SEA). 230--241.

Digital Library

[2]

Rakesh Agrawal and H. V. Jagadish. 1989. Materialization and Incremental Update of Path Information. In ICDE. 374--383.

Digital Library

[3]

Saad Aljubayrin, Jianzhong Qi, Christian S. Jensen, Rui Zhang, Zhen He, and Yuan Li. 2017. Finding lowest-cost paths in settings with safe and preferred zones. VLDB J. 26, 3 (2017), 373--397.

Digital Library

[4]

Saad Aljubayrin, Jianzhong Qi, Christian S. Jensen, Rui Zhang, Zhen He, and Zeyi Wen. 2015. The safest path via safe zones. In ICDE. 531--542.

[5]

Hannah Bast, Daniel Delling, Andrew V. Goldberg, Matthias Müller-Hannemann, Thomas Pajor, Peter Sanders, Dorothea Wagner, and Renato F. Werneck. 2016. Route Planning in Transportation Networks. In Algorithm Engineering - Selected Results and Surveys. Vol. 9220. 19--80.

[6]

Scott A. Bortoff. 2000. Path planning for UAVs. In American Control Conference. 364--368.

[7]

Stephan Börzsönyi, Donald Kossmann, and Konrad Stocker. 2001. The Skyline Operator. In ICDE. 421--430.

Digital Library

[8]

Panagiotis Bouros. 2011. Evaluating Queries over Route Collections. Ph.D. Dissertation. NTUA, Greece.

[9]

Thomas H. Byers and Michael S. Waterman. 1984. Determining all optimal and near-optimal solutions when solving shortest path problems by dynamic programming. Operations Research 32 (1984), 1381--1384.

Digital Library

[10]

W. Matthew Carlyle and R. Kevin Wood. 2005. Near-shortest and K-shortest simple paths. Networks 46, 2 (2005), 98--109.

Digital Library

[11]

Robert L. Carraway, Thomas L. Morin, and Herbert Moskowitz. 1990. Generalized dynamic programming for multicriteria optimization. European Journal of Operational Research 44, 1 (January 1990), 95--104.

[12]

Vaida Ceikute and Christian S. Jensen. 2015. Vehicle Routing with User-Generated Trajectory Data. In MDM. 14--23.

Digital Library

[13]

Zaiben Chen, Heng Tao Shen, and Xiaofang Zhou. 2011. Discovering popular routes from trajectories. In ICDE. 900--911.

Digital Library

[14]

Jiefeng Cheng and Jeffrey Xu Yu. 2009. On-line exact shortest distance query processing. In EDBT. 481--492.

Digital Library

[15]

Theodoros Chondrogiannis and Johann Gamper. 2016. ParDiSP: A Partition-Based Framework for Distance and Shortest Path Queries on Road Networks. In MDM. 242--251.

[16]

Edith Cohen, Eran Halperin, Haim Kaplan, and Uri Zwick. 2002. Reachability and distance queries via 2-hop labels. In SODA. 937--946.

Digital Library

[17]

Daniel Delling, Andrew V. Goldberg, Moisés Goldszmidt, John Krumm, Kunal Talwar, and Renato F. Werneck. 2015. Navigation made personal: inferring driving preferences from GPS traces. In SIGSPATIAL GIS. 31:1--31:9.

Digital Library

[18]

Robert Geisberger, Peter Sanders, Dominik Schultes, and Daniel Delling. 2008. Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks. In WEA. 319--333.

Digital Library

[19]

Andrew V. Goldberg and Chris Harrelson. 2005. Computing the shortest path: A search meets graph theory. In SODA. 156--165.

Digital Library

[20]

Andrew V. Goldberg, Haim Kaplan, and Renato F. Werneck. 2006. Reach for A*: Efficient point-to-point shortest path algorithms. In Proceedings of the 8th WS on Algorithm Engineering and Experiments (ALENEX). SIAM, Philadelphia. 129--143.

Digital Library

[21]

Janusz Granat and Francesca Guerriero. 2003. The interactive analysis of the multicriteria shortest path problem by the reference point method. European Journal of Operational Research 151, 1 (November 2003), 103--118.

[22]

F. Guerriero and R. Musmanno. 2001. Label correcting methods to solve multicriteria shortest path problems. Journal of Optimization Theory and Applications 111, 3 (2001), 589--613.

Digital Library

[23]

R. V. Helgason, J. L. Kennington, and K. H. Lewis. 1997. Shortest path algorithms on grid graphs with applications to strike planning. Technical Report. DTIC Document.

[24]

Ning Jing, Yun-Wu Huang, and Elke A. Rundensteiner. 1998. Hierarchical Encoded Path Views for Path Query Processing: An Optimal Model and Its Performance Evaluation. TKDE 10, 3 (1998), 409--432.

Digital Library

[25]

Sungwon Jung and Sakti Pramanik. 2002. An Efficient Path Computation Model for Hierarchically Structured Topographical Road Maps. TKDE 14, 5 (2002), 1029--1046.

Digital Library

[26]

Rahul Kala, Anupam Shukla, and Ritu Tiwari. 2010. Fusion of probabilistic A* algorithm and fuzzy inference system for robotic path planning. Artif. Intell. Rev. 33, 4 (2010), 307--327.

Digital Library

[27]

Hans-Peter Kriegel, Matthias Renz, and Matthias Schubert. 2010. Route skyline queries: A multi-preference path planning approach. In ICDE. 261--272.

[28]

Alain Lambert and Dominique Gruyer. 2003. Safe path planning in an uncertain-configuration space. In ICRA. 4185--4190.

[29]

Louise Leenen, Alexander Terlunen, and Herman Le Roux. 2012. A constraint programming solution for the military unit path finding problem. Mobile Intelligent Autonomous Systems 9, 1 (2012), 225--240.

[30]

Julia Letchner, John Krumm, and Eric Horvitz. 2006. Trip Router with Individualized Preferences (TRIP): Incorporating Personalization into Route Planning. In Proceedings, The Twenty-First National Conference on Artificial Intelligence and the Eighteenth Innovative Applications of Artificial Intelligence. 1795--1800.

Digital Library

[31]

Ying Lu and Cyrus Shahabi. 2015. An arc orienteering algorithm to find the most scenic path on a large-scale road network. In SIGSPATIAL GIS. 46:1--46:10.

Digital Library

[32]

Kayur Patel, Mike Y. Chen, Ian E. Smith, and James A. Landay. 2006. Personalizing routes. In Proceedings of the 19th Annual ACM Symposium on User Interface Software and Technology. 187--190.

Digital Library

[33]

I Pohl. 1971. Bi-directional Search. Machine Intelligence 6 (1971), 127--140.

[34]

Daniele Quercia, Rossano Schifanella, and Luca Maria Aiello. 2014. The shortest path to happiness: recommending beautiful, quiet, and happy routes in the city. In HT. 116--125.

Digital Library

[35]

Michael Shekelyan, Gregor Jossé, and Matthias Schubert. 2015. Linear path skylines in multicriteria networks. In ICDE. 459--470.

[36]

Michael Shekelyan, Gregor Jossé, and Matthias Schubert. 2015. ParetoPrep: Efficient Lower Bounds for Path Skylines and Fast Path Computation. In SSTD. 40--58.

[37]

Christian Sommer. 2014. Shortest-path queries in static networks. ACM Comput. Surv. 46, 4 (2014), 45:1--45:31.

Digital Library

[38]

Yuan Tian, Ken C. K. Lee, and Wang-Chien Lee. 2009. Finding skyline paths in road networks. In SIGSPATIAL GIS. 444--447.

Digital Library

[39]

Chi Tung Tung and Kim Lin Chew. 1992. A multicriteria Pareto-optimal path algorithm. European Journal of Operational Research 62, 2 (1992), 203--209.

[40]

Jur P. van den Berg and Mark H. Overmars. 2006. Planning the Shortest Safe Path Amidst Unpredictably Moving Obstacles. In WAFR. 103--118.

[41]

Lingkun Wu, Xiaokui Xiao, Dingxiong Deng, Gao Cong, Andy Diwen Zhu, and Shuigeng Zhou. 2012. Shortest Path and Distance Queries on Road Networks: An Experimental Evaluation. PVLDB 5, 5 (2012), 406--417.

Digital Library

[42]

Bin Yang, Chenjuan Guo, Yu Ma, and Christian S. Jensen. 2015. Toward personalized, context-aware routing. VLDB J. 24, 2 (2015), 297--318.

Digital Library

[43]

Andy Diwen Zhu, Hui Ma, Xiaokui Xiao, Siqiang Luo, Youze Tang, and Shuigeng Zhou. 2013. Shortest path and distance queries on road networks: towards bridging theory and practice. In SIGMOD. 857--868.

Digital Library

Cited By

Yang MZeng RSharma ASawamura SNorthrop WShekhar S(2024)Towards Pareto-optimality with Multi-level Bi-objective Routing: A Summary of ResultsProceedings of the 17th ACM SIGSPATIAL International Workshop on Computational Transportation Science GenAI and Smart Mobility Session10.1145/3681772.3698215(36-45)Online publication date: 29-Oct-2024
https://dl.acm.org/doi/10.1145/3681772.3698215
Zhang SLuo ZYang LTeng FLi T(2024)A survey of route recommendations: Methods, applications, and opportunitiesInformation Fusion10.1016/j.inffus.2024.102413(102413)Online publication date: Apr-2024
https://doi.org/10.1016/j.inffus.2024.102413
Ghosh DSankaranarayanan JKhatter KSamet H(2023)In-Path Oracles for Road NetworksISPRS International Journal of Geo-Information10.3390/ijgi1207027712:7(277)Online publication date: 13-Jul-2023
https://doi.org/10.3390/ijgi12070277
Show More Cited By

Index Terms

Finding The Most Preferred Path
1. Information systems
  1. Information systems applications
    1. Spatial-temporal systems

Recommendations

A Multiple Pairs Shortest Path Algorithm

The multiple pairs shortest path problem (MPSP) arises in many applications where the shortest paths and distances between only some specific pairs of origin-destination (OD) nodes in a network are desired. The traditional repeated single-source shortest ...
Finding shortest path on land surface
SIGMOD '11: Proceedings of the 2011 ACM SIGMOD International Conference on Management of data

Finding shortest paths is a fundamental operator in spatial databases. Recently, terrain datasets have attracted a lot of attention from both industry and academia. There are some interesting issues to be studied in terrain datasets which cannot be ...
Finding min-sum disjoint shortest paths from a single source to all pairs of destinations
TAMC'06: Proceedings of the Third international conference on Theory and Applications of Models of Computation

Given a graph G = (V, E) with |V| = n, |E| = m, and a source node s, we consider the problem of finding two disjoint paths from s to two destination nodes t₁ and t₂ with minimum total length, for every pair nodes t₁, t₂ ∈ V–{s}. One efficient solution ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

SIGSPATIAL '17: Proceedings of the 25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems

November 2017

677 pages

ISBN:9781450354905

DOI:10.1145/3139958

Copyright © 2017 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

Sponsors

SIGSPATIAL: ACM Special Interest Group on Spatial Information

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 07 November 2017

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article
Research
Refereed limited

Conference

SIGSPATIAL'17

Sponsor:

SIGSPATIAL

SIGSPATIAL'17: 25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems

November 7 - 10, 2017

CA, Redondo Beach, USA

Acceptance Rates

SIGSPATIAL '17 Paper Acceptance Rate 39 of 193 submissions, 20%;

Overall Acceptance Rate 257 of 1,238 submissions, 21%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

14
Total Citations
View Citations
473
Total Downloads

Downloads (Last 12 months)167
Downloads (Last 6 weeks)1

Reflects downloads up to 26 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Yang MZeng RSharma ASawamura SNorthrop WShekhar S(2024)Towards Pareto-optimality with Multi-level Bi-objective Routing: A Summary of ResultsProceedings of the 17th ACM SIGSPATIAL International Workshop on Computational Transportation Science GenAI and Smart Mobility Session10.1145/3681772.3698215(36-45)Online publication date: 29-Oct-2024
https://dl.acm.org/doi/10.1145/3681772.3698215
Zhang SLuo ZYang LTeng FLi T(2024)A survey of route recommendations: Methods, applications, and opportunitiesInformation Fusion10.1016/j.inffus.2024.102413(102413)Online publication date: Apr-2024
https://doi.org/10.1016/j.inffus.2024.102413
Ghosh DSankaranarayanan JKhatter KSamet H(2023)In-Path Oracles for Road NetworksISPRS International Journal of Geo-Information10.3390/ijgi1207027712:7(277)Online publication date: 13-Jul-2023
https://doi.org/10.3390/ijgi12070277
Gao LChen CChu FLiao CHuang HWang Y(2023)MOOP: An Efficient Utility-Rich Route Planning Framework Over Two-Fold Time-Dependent Road NetworksIEEE Transactions on Emerging Topics in Computational Intelligence10.1109/TETCI.2023.32419307:5(1554-1570)Online publication date: Oct-2023
https://doi.org/10.1109/TETCI.2023.3241930
Yamashita OYokoyama S(2022)Preference aware route recommendation using one billion geotagged tweetsProceedings of the 6th ACM SIGSPATIAL International Workshop on Location-based Recommendations, Geosocial Networks and Geoadvertising10.1145/3557992.3565990(1-10)Online publication date: 1-Nov-2022
https://dl.acm.org/doi/10.1145/3557992.3565990
Chondrogiannis TBornholdt JBouros PGrossniklaus MRenz MSarwat M(2022)History oblivious route recovery on road networksProceedings of the 30th International Conference on Advances in Geographic Information Systems10.1145/3557915.3560979(1-10)Online publication date: 1-Nov-2022
https://dl.acm.org/doi/10.1145/3557915.3560979
Liu HLi YFu YMei HXiong H(2022)Polestar++: An Intelligent Routing Engine for National-Wide Public TransportationIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2022.3153711(1-1)Online publication date: 2022
https://doi.org/10.1109/TKDE.2022.3153711
Rathan PReddy PMondal A(2021)A framework for discovering popular paths using transactional modeling and pattern miningDistributed and Parallel Databases10.1007/s10619-021-07366-7Online publication date: 20-Sep-2021
https://doi.org/10.1007/s10619-021-07366-7
Liu HLi YFu YMei HZhou JMa XXiong HGupta RLiu YShah MRajan STang JPrakash B(2020)PolestarProceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining10.1145/3394486.3403281(2321-2329)Online publication date: 23-Aug-2020
https://dl.acm.org/doi/10.1145/3394486.3403281
Zhou FWu HTrajcevski GKhokhar AZhang K(2020)Semi-supervised Trajectory Understanding with POI Attention for End-to-End Trip RecommendationACM Transactions on Spatial Algorithms and Systems10.1145/33788906:2(1-25)Online publication date: 7-Feb-2020
https://dl.acm.org/doi/10.1145/3378890
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten