poster

Finding k-dissimilar paths with minimum collective length

Authors:

Theodoros Chondrogiannis,

Panagiotis Bouros,

Johann Gamper,

Ulf Leser,

David B. BlumenthalAuthors Info & Claims

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

Pages 404 - 407

https://doi.org/10.1145/3274895.3274903

Published: 06 November 2018 Publication History

Get Access

Abstract

Shortest path computation is a fundamental problem in road networks. However, in many real-world scenarios, determining solely the shortest path is not enough. In this paper, we study the problem of finding k-Dissimilar Paths with Minimum Collective Length (kDPwML), which aims at computing a set of paths from a source s to a target t such that all paths are pairwise dissimilar by at least θ and the sum of the path lengths is minimal. We introduce an exact algorithm for the kDPwML problem, which iterates over all possible s - t paths while employing two pruning techniques to reduce the prohibitively expensive computational cost. To achieve scalability we also define the much smaller set of the simple single-via paths, and we adapt two algorithms for kDPwML queries to iterate over this set. Our experimental analysis on real road networks shows that iterating over all paths is impractical, while iterating over the set of simple single-via paths can lead to scalable solutions with only a small trade-off in the quality of the results.

References

[1]

2005. Choice Routing. Cambridge Vehicle Information Technology Ltd. (2005).

Google Scholar

[2]

Ittai Abraham, Daniel Delling, Andrew V Goldberg, and Renato F Werneck. 2013. Alternative Routes in Road Networks. Journal of Exp. Alg. 18 (2013), 1--17.

Digital Library

Google Scholar

[3]

Vedat Akgun, Erhan Erkut, and Rajan Batta. 2000. On Finding Dissimilar Paths. European Journal of Operational Research 121, 2 (2000), 232--246.

Crossref

Google Scholar

[4]

Roland Bader, Jonathan Dees, Robert Geisberger, and Peter Sanders. 2011. Alternative Route Graphs in Road Networks. In Proc. of the 1st Int. ICST Conf. on Theory and Practice of Algorithms in (Computer) Systems. 21--32.

Digital Library

Google Scholar

[5]

Theodoros Chondrogiannis, Panagiotis Bouros, Johann Gamper, and Ulf Leser. 2015. Alternative Routing: K-shortest Paths with Limited Overlap. In Proc. of the 23rd ACM SIGSPATIAL Conf. 68:1--68:4.

Digital Library

Google Scholar

[6]

Theodoros Chondrogiannis, Panagiotis Bouros, Johann Gamper, and Ulf Leser. 2017. Exact and Approximate Algorithms for Finding k-Shortest Paths with Limited Overlap. In Proc. of the 20th EDBT Conf. 414--425.

Google Scholar

[7]

Theodoros. Chondrogiannis, Panagiotis. Bouros, Johann. Gamper, Ulf Leser, and David B. Blumenthal. 2018. Finding k-Dissimilar Paths with Minimum Collective Length. (2018). arXiv:1809.06831

Digital Library

Google Scholar

[8]

Tali Eilam-Tzoreff. 1998. The disjoint shortest paths problem. Discrete applied mathematics 85, 2 (1998), 113--138.

Digital Library

Google Scholar

[9]

Yeon-Jeong Jeong, Tschangho John Kim, Chang-Ho Park, and Dong-Kyu Kim. 2009. A Dissimilar Alternative Paths-search Algorithm for Navigation Services: A Heuristic Approach. KSCE Journal of Civil Engineering 14, 1 (2009), 41--49.

Crossref

Google Scholar

[10]

Alireza Karduni, Amirhassan Kermanshah, and Sybil Derrible. 2016. A Protocol to Convert Spatial Polyline Data to Network Formats and Applications to World Urban Road Networks. Scientific Data 3, 160046 (2016).

Google Scholar

[11]

Donald E. Knuth. 2005. The Art of Computer Programming, Vol. 4, Fas. 3: Generating All Combinations and Partitions. Addison-Wesley Professional, Boston, MA, USA.

Digital Library

Google Scholar

[12]

H Liu, C. Jin, B Yang, and A. Zhou. 2017. Finding Top-k Shortest Paths with Diversity. IEEE TKDE 30, 3 (2017), 488--502.

Google Scholar

[13]

Jin Y Yen. 1971. Finding the K Shortest Loopless Paths in a Network. Management Science 17, 11 (1971), 712--716.

Digital Library

Google Scholar

Cited By

View all

Fahmin AShen BAamir Cheema MToosi AEunus Ali M(2024)Efficient Alternative Route Planning in Road NetworksIEEE Transactions on Intelligent Transportation Systems10.1109/TITS.2024.339617325:10(14220-14232)Online publication date: Oct-2024
https://doi.org/10.1109/TITS.2024.3396173
Bachtler OBergner TKrumke S(2024)Almost disjoint paths and separating by forbidden pairsTheoretical Computer Science10.1016/j.tcs.2023.114272982:COnline publication date: 8-Jan-2024
https://dl.acm.org/doi/10.1016/j.tcs.2023.114272
Yamamoto DHiura YKim Y(2023)k-Fewest Turn and Shortest Path Algorithm based on Stroke GraphProceedings of the 16th ACM SIGSPATIAL International Workshop on Computational Transportation Science10.1145/3615895.3628170(32-41)Online publication date: 13-Nov-2023
https://dl.acm.org/doi/10.1145/3615895.3628170
Show More Cited By

Index Terms

Finding k-dissimilar paths with minimum collective length
1. Information systems
  1. Information systems applications
    1. Spatial-temporal systems
      1. Geographic information systems
2. Mathematics of computing
  1. Discrete mathematics
    1. Graph theory
      1. Graph algorithms

Recommendations

Most Diverse Near-Shortest Paths
SIGSPATIAL '21: Proceedings of the 29th International Conference on Advances in Geographic Information Systems

Computing the shortest path in a road network is a fundamental problem that has attracted lots of attention. However, in many real-world scenarios, determining solely the shortest path is not enough as users want to have additional, alternative ways of ...
Alternative routing: k-shortest paths with limited overlap
SIGSPATIAL '15: Proceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems

Shortest path computation is a fundamental problem in road networks with application in various domains in research and industry. However, returning only the shortest path is often not satisfying; users are also interested in alternative paths which ...
Finding The Most Preferred Path
SIGSPATIAL '17: Proceedings of the 25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems

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 ...

Comments

Information & Contributors

Information

Published In

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

November 2018

655 pages

ISBN:9781450358897

DOI:10.1145/3274895

General Chairs:
Farnoush Banaei-Kashani
University of Colorado, Denver
,
Erik Hoel
Esri
,
Program Chairs:
Ralf Hartmut Güting
FernUniversität in Hagen, Germany
,
Roberto Tamassia
Brown University
,
Li Xiong
Emory University

Permission to make digital or hard copies of part or all 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 third-party components of this work must be honored. For all other uses, contact the Owner/Author.

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 06 November 2018

Check for updates

Author Tags

Qualifiers

Poster

Conference

SIGSPATIAL '18

Sponsor:

SIGSPATIAL

SIGSPATIAL '18: 26th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems

November 6 - 9, 2018

Washington, Seattle

Acceptance Rates

SIGSPATIAL '18 Paper Acceptance Rate 30 of 150 submissions, 20%;

Overall Acceptance Rate 220 of 1,116 submissions, 20%

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

13
Total Citations
View Citations
213
Total Downloads

Downloads (Last 12 months)19
Downloads (Last 6 weeks)4

Reflects downloads up to 04 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Fahmin AShen BAamir Cheema MToosi AEunus Ali M(2024)Efficient Alternative Route Planning in Road NetworksIEEE Transactions on Intelligent Transportation Systems10.1109/TITS.2024.339617325:10(14220-14232)Online publication date: Oct-2024
https://doi.org/10.1109/TITS.2024.3396173
Bachtler OBergner TKrumke S(2024)Almost disjoint paths and separating by forbidden pairsTheoretical Computer Science10.1016/j.tcs.2023.114272982:COnline publication date: 8-Jan-2024
https://dl.acm.org/doi/10.1016/j.tcs.2023.114272
Yamamoto DHiura YKim Y(2023)k-Fewest Turn and Shortest Path Algorithm based on Stroke GraphProceedings of the 16th ACM SIGSPATIAL International Workshop on Computational Transportation Science10.1145/3615895.3628170(32-41)Online publication date: 13-Nov-2023
https://dl.acm.org/doi/10.1145/3615895.3628170
Rashid SAli MCheema M(2023)DeepAltTrip: Top-K Alternative Itineraries for Trip RecommendationIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2023.323959535:9(9433-9447)Online publication date: 1-Sep-2023
https://doi.org/10.1109/TKDE.2023.3239595
Upadhyay AGhosh MEkenna C(2023)Minimal Path Violation Problem with Application to Fault Tolerant Motion Planning of Manipulators2023 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)10.1109/IROS55552.2023.10342242(8673-8679)Online publication date: 1-Oct-2023
https://doi.org/10.1109/IROS55552.2023.10342242
Otaki KMaeda TYoshimura TSakai H(2023)Roaming Navigation: Diverse Constrained Paths Using Heuristic SearchIEEE Access10.1109/ACCESS.2023.329583011(75617-75627)Online publication date: 2023
https://doi.org/10.1109/ACCESS.2023.3295830
Anzoom RNagi RVogiatzis C(2023)Uncovering illicit supply networks and their interfaces to licit counterparts through graph-theoretic algorithmsIISE Transactions10.1080/24725854.2022.216216956:3(224-240)Online publication date: 31-Jan-2023
https://doi.org/10.1080/24725854.2022.2162169
Luo ZLi LZhang MHua WXu YZhou X(2022)Diversified top-k route planning in road networkProceedings of the VLDB Endowment10.14778/3551793.355186315:11(3199-3212)Online publication date: 1-Jul-2022
https://dl.acm.org/doi/10.14778/3551793.3551863
Wieme JBaert MHoebeke J(2022)Relay selection in Bluetooth Mesh networks by embedding genetic algorithms in a Digital Communication Twin2022 IEEE 23rd International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM)10.1109/WoWMoM54355.2022.00087(561-566)Online publication date: Jun-2022
https://doi.org/10.1109/WoWMoM54355.2022.00087
Wiedemann NAdjiashvili D(2022)An Optimization Framework for Power Infrastructure PlanningIEEE Transactions on Power Systems10.1109/TPWRS.2021.309944537:2(1207-1217)Online publication date: Mar-2022
https://doi.org/10.1109/TPWRS.2021.3099445
Show More Cited By

View Options

Get Access

Login options

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

Cited By

Index Terms

Recommendations

Most Diverse Near-Shortest Paths

Alternative routing: k-shortest paths with limited overlap

Finding The Most Preferred Path