research-article

Public Access

Shortest-Path Diversification through Network Penalization: A Washington DC Area Case Study

Authors:

Olga Gkountouna,

Andreas Züfle,

Carola WenkAuthors Info & Claims

IWCTS'19: Proceedings of the 12th ACM SIGSPATIAL International Workshop on Computational Transportation Science

Article No.: 10, Pages 1 - 10

https://doi.org/10.1145/3357000.3366137

Published: 05 November 2019 Publication History

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.

References

[1]

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.

Digital Library

[2]

V. Akgün, E. Erkut, and R. Batta. On finding dissimilar paths. European Journal of Operational Research, 121(2):232--246, 2000.

[3]

H. Aljazzar and S. Leue. K*: A heuristic search algorithm for finding the k shortest paths. Artificial Intelligence, 175(18):2129--2154, 2011.

Digital Library

[4]

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.

Digital Library

[5]

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.

[6]

R. Bhandari. Survivable networks: algorithms for diverse routing. Springer Science & Business Media, 1999.

[7]

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.

[8]

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.

[9]

G. Cookson. Inrix global traffic scorecard (2017). INRIX Research, February, (published February 2018).

[10]

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.

[11]

E. W. Dijkstra. A note on two problems in connexion with graphs. Numerische mathematik, 1(1):269--271, 1959.

Digital Library

[12]

D. Eppstein. Finding the k shortest paths. SIAM Journal on computing, 28(2):652--673, 1998.

[13]

M. Haklay and P. Weber. Openstreetmap: User-generated street maps. IEEE Pervasive Computing, October-December:12--18, 2008.

[14]

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.

[15]

N. Katoh, T. Ibaraki, and H. Mine. An efficient algorithm for k shortest simple paths. Networks, 12(4):411--427, 1982.

[16]

M. Kobitzsch. An alternative approach to alternative routes: Hidar. In European Symposium on Algorithms, pages 613--624. Springer, 2013.

[17]

M. Kobitzsch, M. Radermacher, and D. Schieferdecker. Evolution and evaluation of the penalty method for alternative graphs. 2013.

[18]

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.

[19]

D. Luxen and D. Schieferdecker. Candidate sets for alternative routes in road networks. In International Symposium on Experimental Algorithms, pages 260--270. Springer, 2012.

Digital Library

[20]

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.

[21]

D. Schrank, B. Eisele, T. Lomax, and J. Bak. Urban Mobility Scorecard. The Texas A&M Transportation Institute and INRIX, 2015.

[22]

J. Suurballe. Disjoint paths in a network. Networks, 4(2):125--145, 1974.

[23]

J. W. Suurballe and R. E. Tarjan. A quick method for finding shortest pairs of disjoint paths. Networks, 14(2):325--336, 1984.

[24]

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.

[25]

J. Y. Yen. Finding the k shortest loopless paths in a network. Management Science, 17(11):712--716, 1971.

Digital Library

Cited By

Jha ASong HZinchenko Y(2024)Resilient Network Design: Disjoint Shortest Path Problem for Power Transmission ApplicationSystems10.3390/systems1204011712:4(117)Online publication date: 31-Mar-2024
https://doi.org/10.3390/systems12040117
Paricio-Garcia ALopez-Carmona M(2024)Impact of Static Urban Traffic Flow-Based Traffic Weighted Multi-Maps Routing Strategies on Pollutant EmissionsSystems10.3390/systems1203008912:3(89)Online publication date: 12-Mar-2024
https://doi.org/10.3390/systems12030089
Tenzer MTung ERasheed ZShafique K(2024)Generating Trajectories from Implicit Neural Models2024 25th IEEE International Conference on Mobile Data Management (MDM)10.1109/MDM61037.2024.00036(129-138)Online publication date: 24-Jun-2024
https://doi.org/10.1109/MDM61037.2024.00036
Show More Cited By

Index Terms

Shortest-Path Diversification through Network Penalization: A Washington DC Area Case Study
1. Applied computing
  1. Operations research
    1. Transportation
2. Information systems
  1. Information systems applications
    1. Decision support systems
      1. Data analytics

Recommendations

Realtime response of shortest path computation
IWCTS '14: Proceedings of the 7th ACM SIGSPATIAL International Workshop on Computational Transportation Science

Computing 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 Simulation

Multi-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 ...
A shortest path algorithm based on limited search heuristics
CSR'06: Proceedings of the First international computer science conference on Theory and Applications

Dijkstra's algorithm is arguably the most popular computational solution to finding single source shortest paths. Increasing complexity of road networks, however, has posed serious performance challenge. While heuristic procedures based on geometric ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

IWCTS'19: Proceedings of the 12th ACM SIGSPATIAL International Workshop on Computational Transportation Science

November 2019

89 pages

ISBN:9781450369671

DOI:10.1145/3357000

Editors:
Gautam Thakur
Oak Ridge National Laboratory, TN, USA
,
Jibonananda Sanyal
Oak Ridge National Laboratory, TN, USA

Copyright © 2019 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: 05 November 2019

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article
Research
Refereed limited

Funding Sources

National Science Foundation

Conference

SIGSPATIAL '19

Sponsor:

SIGSPATIAL

SIGSPATIAL '19: 27th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems

November 5, 2019

IL, Chicago, USA

Acceptance Rates

Overall Acceptance Rate 42 of 57 submissions, 74%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

13
Total Citations
View Citations
449
Total Downloads

Downloads (Last 12 months)137
Downloads (Last 6 weeks)36

Reflects downloads up to 01 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Jha ASong HZinchenko Y(2024)Resilient Network Design: Disjoint Shortest Path Problem for Power Transmission ApplicationSystems10.3390/systems1204011712:4(117)Online publication date: 31-Mar-2024
https://doi.org/10.3390/systems12040117
Paricio-Garcia ALopez-Carmona M(2024)Impact of Static Urban Traffic Flow-Based Traffic Weighted Multi-Maps Routing Strategies on Pollutant EmissionsSystems10.3390/systems1203008912:3(89)Online publication date: 12-Mar-2024
https://doi.org/10.3390/systems12030089
Tenzer MTung ERasheed ZShafique K(2024)Generating Trajectories from Implicit Neural Models2024 25th IEEE International Conference on Mobile Data Management (MDM)10.1109/MDM61037.2024.00036(129-138)Online publication date: 24-Jun-2024
https://doi.org/10.1109/MDM61037.2024.00036
Wang LWong RJensen C(2024)Congestion-Mitigating Spatiotemporal Routing in Road Networks2024 IEEE 40th International Conference on Data Engineering (ICDE)10.1109/ICDE60146.2024.00349(4586-4599)Online publication date: 13-May-2024
https://doi.org/10.1109/ICDE60146.2024.00349
Cornacchia GNanni MPedreschi DPappalardo L(2023)Effects of Route Randomization on Urban EmissionsSUMO Conference Proceedings10.52825/scp.v4i.2174(75-87)Online publication date: 29-Jun-2023
https://doi.org/10.52825/scp.v4i.217
Paricio-Garcia ALopez-Carmona M(2023)Application of Traffic Weighted Multi-Maps Based on Disjoint Routing Areas for Static Traffic AssignmentApplied Sciences10.3390/app13181007113:18(10071)Online publication date: 6-Sep-2023
https://doi.org/10.3390/app131810071
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
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
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
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

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

Media

Figures

Other

Tables

View Table of Contents