Theodoros Chondrogiannis
Panagiotis Bouros
Johann Gamper
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.
- 2005. Choice Routing. Cambridge Vehicle Information Technology Ltd.. (2005).Google Scholar
- 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. Google ScholarDigital Library
- Vedat Akgun, Erhan Erkut, and Rajan Batta. 2000. On Finding Dissimilar Paths. European Journal of Operational Research 121, 2 (2000), 232--246.Google ScholarCross Ref
- 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. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- 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
- 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 Google ScholarDigital Library
- Tali Eilam-Tzoreff. 1998. The disjoint shortest paths problem. Discrete applied mathematics 85, 2 (1998), 113--138. Google ScholarDigital Library
- 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.Google ScholarCross Ref
- 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
- Donald E. Knuth. 2005. The Art of Computer Programming, Vol. 4, Fas. 3: Generating All Combinations and Partitions. Addison-Wesley Professional, Boston, MA, USA. Google ScholarDigital Library
- 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
- Jin Y Yen. 1971. Finding the K Shortest Loopless Paths in a Network. Management Science 17, 11 (1971), 712--716.Google ScholarDigital Library
Index Terms
- Finding k-dissimilar paths with minimum collective length
Recommendations
Most Diverse Near-Shortest Paths
SIGSPATIAL '21: Proceedings of the 29th International Conference on Advances in Geographic Information SystemsComputing 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 SystemsShortest 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 SystemsConsider 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