Dan Cheng
Dieter Pfoser
ABSTRACT
Traditional navigation systems compute the quantitatively shortest or fastest route between two locations in a spatial network. In practice, a problem resulting from all drivers using the shortest path is the congregation of individuals on routes having a high in-betweenness. To this end, several works have proposed methods for proposing alternative routes. In this work, we test solutions for traffic load-balancing by computing diversified routes proposing variants of the penalty method using the road network of the Washington DC metropolitan area as a case study. Our experimental evaluation shows that the tested Penalty-based approaches allow to significantly balance the load of a spatial network, compared to existing k-shortest path algorithms, and compared to a naive baseline that randomly changes the weights of the network at each shortest-path computation.
- I. Abraham, D. Delling, A. V. Goldberg, and R. F. Werneck. Alternative routes in road networks. In International Symposium on Experimental Algorithms, pages 23--34. Springer, 2010.Google Scholar
Digital Library
- V. Akgün, E. Erkut, and R. Batta. On finding dissimilar paths. European Journal of Operational Research, 121(2):232--246, 2000.Google ScholarCross Ref
- H. Aljazzar and S. Leue. K*: A heuristic search algorithm for finding the k shortest paths. Artificial Intelligence, 175(18):2129--2154, 2011.Google ScholarDigital Library
- R. Bader, J. Dees, R. Geisberger, and P. Sanders. Alternative route graphs in road networks. In International Conference on Theory and Practice of Algorithms in (Computer) Systems, pages 21--32. Springer, 2011.Google ScholarDigital Library
- M. E. Baran and F. F. Wu. Network reconfiguration in distribution systems for loss reduction and load balancing. IEEE Transactions on Power delivery, 4(2):1401--1407, 1989.Google ScholarCross Ref
- R. Bhandari. Survivable networks: algorithms for diverse routing. Springer Science & Business Media, 1999.Google Scholar
- T. Chondrogiannis, P. Bouros, J. Gamper, and U. Leser. Alternative routing: k-shortest paths with limited overlap. In Proceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems, page 68. ACM, 2015.Google Scholar
- T. Chondrogiannis, P. Bouros, J. Gamper, and U. Leser. Exact and approximate algorithms for finding k-shortest paths with limited overlap. In 20th International Conference on Extending Database Technology: EDBT 2017, pages 414--425, 2017.Google Scholar
- G. Cookson. Inrix global traffic scorecard (2017). INRIX Research, February, (published February 2018).Google Scholar
- D. Delling, A. V. Goldberg, T. Pajor, and R. F. Werneck. Customizable route planning. In International Symposium on Experimental Algorithms, pages 376--387. Springer, 2011.Google ScholarCross Ref
- E. W. Dijkstra. A note on two problems in connexion with graphs. Numerische mathematik, 1(1):269--271, 1959.Google ScholarDigital Library
- D. Eppstein. Finding the k shortest paths. SIAM Journal on computing, 28(2):652--673, 1998.Google Scholar
- M. Haklay and P. Weber. Openstreetmap: User-generated street maps. IEEE Pervasive Computing, October-December:12--18, 2008.Google Scholar
- M. Kashem, V. Ganapathy, and G. Jasmon. Network reconfiguration for load balancing in distribution networks. IEE Proceedings-Generation, Transmission and Distribution, 146(6):563--567, 1999.Google ScholarCross Ref
- N. Katoh, T. Ibaraki, and H. Mine. An efficient algorithm for k shortest simple paths. Networks, 12(4):411--427, 1982.Google ScholarCross Ref
- M. Kobitzsch. An alternative approach to alternative routes: Hidar. In European Symposium on Algorithms, pages 613--624. Springer, 2013.Google ScholarCross Ref
- M. Kobitzsch, M. Radermacher, and D. Schieferdecker. Evolution and evaluation of the penalty method for alternative graphs. 2013.Google Scholar
- H. Liu, C. Jin, B. Yang, and A. Zhou. Finding top-k shortest paths with diversity. IEEE Transactions on Knowledge and Data Engineering, 30(3):488--502, 2017.Google ScholarCross Ref
- D. Luxen and D. Schieferdecker. Candidate sets for alternative routes in road networks. In International Symposium on Experimental Algorithms, pages 260--270. Springer, 2012.Google ScholarDigital Library
- J. P. Rohrer, A. Jabbar, and J. P. Sterbenz. Path diversification: A multipath resilience mechanism. In Design of Reliable Communication Networks, 2009. DRCN 2009. 7th International Workshop on, pages 343--351. IEEE, 2009.Google ScholarCross Ref
- D. Schrank, B. Eisele, T. Lomax, and J. Bak. Urban Mobility Scorecard. The Texas A&M Transportation Institute and INRIX, 2015.Google Scholar
- J. Suurballe. Disjoint paths in a network. Networks, 4(2):125--145, 1974.Google ScholarCross Ref
- J. W. Suurballe and R. E. Tarjan. A quick method for finding shortest pairs of disjoint paths. Networks, 14(2):325--336, 1984.Google ScholarCross Ref
- E. Tiakas, A. N. Papadopoulos, and Y. Manolopoulos. Skyline queries: An introduction. In 2015 6th International Conference on Information, Intelligence, Systems and Applications (IISA), pages 1--6, July 2015.Google ScholarCross Ref
- J. Y. Yen. Finding the k shortest loopless paths in a network. Management Science, 17(11):712--716, 1971.Google ScholarDigital Library
Index Terms
- Shortest-Path Diversification through Network Penalization: A Washington DC Area Case Study
Recommendations
Distributed Processing of k Shortest Path Queries over Dynamic Road Networks
SIGMOD '20: Proceedings of the 2020 ACM SIGMOD International Conference on Management of DataThe problem of identifying the k -shortest paths (KSPs for short) in a dynamic road network is essential to many location-based services. Road networks are dynamic in the sense that the weights of the edges in the corresponding graph constantly change ...
Realtime response of shortest path computation
IWCTS '14: Proceedings of the 7th ACM SIGSPATIAL International Workshop on Computational Transportation ScienceComputing the shortest path between two locations in a network is an important and fundamental problem that finds applications in a wide range of fields. This problem has attracted considerable research interest and led to a plethora of algorithms. ...
Approximating Shortest Path in Large-Scale Road Networks with Turn Prohibitions Using Multi-constrained Path Algorithm
CIMSIM '13: Proceedings of the 2013 Fifth International Conference on Computational Intelligence, Modelling and SimulationMulti-Constrained Path (MCP) algorithms are path finding algorithms, unlike conventional routing algorithms, they not only give a path between source and destination, also verifies whether the path satisfies the given constraints (Right turn, Left turn ...
Comments