Filters








558 Hits in 8.1 sec

Fast Exact Shortest Path and Distance Queries on Road Networks with Parametrized Costs [article]

Julian Dibbelt, Ben Strasser, Dorothea Wagner
2015 arXiv   pre-print
We study a scenario for route planning in road networks, where the objective to be optimized may change between every shortest path query.  ...  Since this invalidates many of the known speedup techniques for road networks that are based on preprocessing of shortest path structures, we investigate optimizations exploiting solely the topological  ...  Related Work The classic solution to solving shortest path problems on road networks is Dijkstra's algorithm [14] .  ... 
arXiv:1509.03165v1 fatcat:sulijol6yfgpvju6b3pdwxdt6e

A Survey of Shortest-Path Algorithms [article]

Amgad Madkour, Walid G. Aref, Faizan Ur Rehman, Mohamed Abdur Rahman, Saleh Basalamah
2017 arXiv   pre-print
There is no one general algorithm that is capable of solving all variants of the shortest-path problem due to the space and time complexities associated with each algorithm.  ...  A shortest-path algorithm finds a path containing the minimal cost between two vertices in a graph.  ...  It tackles time-dependent road networks where it proposes a fast and exact route planning algorithm. The issue it faces is space complexity.  ... 
arXiv:1705.02044v1 fatcat:fkh55mi34vezhbvjbzu7ekmdai

Route Planning in Transportation Networks [chapter]

Hannah Bast, Daniel Delling, Andrew Goldberg, Matthias Müller-Hannemann, Thomas Pajor, Peter Sanders, Dorothea Wagner, Renato F. Werneck
2016 Lecture Notes in Computer Science  
Although exact algorithms are fast enough for interactive queries on metropolitan transit systems, dealing with continent-sized instances requires simplifications or heavy preprocessing.  ...  For road networks, we show that one can compute driving directions in milliseconds or less even at continental scale.  ...  Computing exact reaches requires computing shortest paths for all pairs of vertices, which is too expensive on large road networks.  ... 
doi:10.1007/978-3-319-49487-6_2 fatcat:zbg272ftdfempady3cjynh6q4e

Route Planning in Transportation Networks [article]

Hannah Bast, Daniel Delling, Andrew Goldberg, Matthias Müller-Hannemann, Thomas Pajor, Peter Sanders, Dorothea Wagner, Renato F. Werneck
2015 arXiv   pre-print
Although exact algorithms are fast enough for interactive queries on metropolitan transit systems, dealing with continent-sized instances requires simplifications or heavy preprocessing.  ...  For road networks, we show that one can compute driving directions in milliseconds or less even at continental scale.  ...  Computing exact reaches requires computing shortest paths for all pairs of vertices, which is too expensive on large road networks.  ... 
arXiv:1504.05140v1 fatcat:ox42rhvuynd5loq6dljhnfecvu

Analysis and Experimental Evaluation of Time-Dependent Distance Oracles [chapter]

Spyros Kontogiannis, George Michalopoulos, Georgia Papastavrou, Andreas Paraskevopoulos, Dorothea Wagner, Christos Zaroliagis
2014 2015 Proceedings of the Seventeenth Workshop on Algorithm Engineering and Experiments (ALENEX)  
Urban road networks are represented as directed graphs, accompanied by a metric which assigns cost functions (rather than scalars) to the arcs, e.g. representing time-dependent arc-traversal-times.  ...  We conduct an extensive, comparative experimental study with all query algorithms and six landmark sets.  ...  In the parametric shortest path (PSP) problem, the network comes with two distinct (but fixed) arc-cost metrics.  ... 
doi:10.1137/1.9781611973754.13 dblp:conf/alenex/KontogiannisMPPWZ15 fatcat:fw63juzbqvgpdohr6zu3x5onji

Route Planning with Flexible Objective Functions [chapter]

Robert Geisberger, Moritz Kobitzsch, Peter Sanders
2010 2010 Proceedings of the Twelfth Workshop on Algorithm Engineering and Experiments (ALENEX)  
We present the first fast route planning algorithm that answers shortest paths queries for a customizable linear combination of two different metrics, e. g. travel time and energy cost, on large scale  ...  road networks.  ...  We thank Veit Batz for support when starting this project and Daniel Delling for his ALT implementation.  ... 
doi:10.1137/1.9781611972900.12 dblp:conf/alenex/GeisbergerKS10 fatcat:k3h3wgadinbuthry2scjx6vgu4

Fast Approximate Distance Queries in Unweighted Graphs Using Bounded Asynchrony [chapter]

Adam Fidel, Francisco Coral Sabido, Colton Riedel, Nancy M. Amato, Lawrence Rauchwerger
2017 Lecture Notes in Computer Science  
Results of an implementation of this algorithm are presented on up to 32,768 cores, showing 2.27x improvement over the exact KLA algorithm and 3.8x improvement over the level-synchronous version with minimal  ...  We introduce a new parallel algorithm for approximate breadthfirst ordering of an unweighted graph by using bounded asynchrony to parametrically control both the performance and error of the algorithm.  ...  Acknowledgments We would like to thank Daniel Latypov for help with aspects of the proof. We would also like to thank our anonymous reviewers. This  ... 
doi:10.1007/978-3-319-52709-3_4 fatcat:gmq3xt25yfeqrblwvh2k5qnafi

A Highly Scalable Labelling Approach for Exact Distance Queries in Complex Networks [article]

Muhammad Farhan, Qing Wang, Yu Lin, Brendan Mckay
2021 arXiv   pre-print
In this work, we present novel techniques to efficiently construct distance labelling and process exact shortest path distance queries for complex networks with billions of vertices and billions of edges  ...  Answering exact shortest path distance queries is a fundamental task in graph theory.  ...  CONCLUSION We have presented a scalable solution for answering exact shortest path distance queries on very large (billion-scale) complex networks.  ... 
arXiv:1812.02363v2 fatcat:lp6xmip7ujfc7fe6qddegcfuea

Distance Oracles for Time-Dependent Networks [article]

Spyros Kontogiannis, Christos Zaroliagis
2015 arXiv   pre-print
Our oracle is based only on the sparsity of the network, along with two quite natural assumptions about travel-time functions which allow the smooth transition towards asymmetric and time-dependent distance  ...  Our oracle uses subquadratic space and time preprocessing, and provides two sublinear-time query algorithms that deliver constant and (1+σ)-approximate shortest-travel-times, respectively, for arbitrary  ...  The focus is on maintaining and efficiently updating a data structure representing the shortest path tree from a single source, or at least supporting fast shortest path queries between arbitrary vertices  ... 
arXiv:1309.4973v3 fatcat:heo247oqxnbirhjil64ir6j7zq

Intelligent route planning system based on interval computing

Wojciech Chmiel, Iwona Skalna, Stanisław Jędrusik
2018 Multimedia tools and applications  
Accordingly, we develop algorithms for effective route replanning in a highly dynamic road network environment that combines traffic image processing with interval data for dynamic path optimisation.  ...  The efficiency of the proposed algorithms and their ability to support the dynamics of road traffic is verified using real data.  ...  Delling et al. in [12] proposed the shortest path algorithm which supports turn costs, enables real-time queries, and can incorporate a newly defined cost function in a few seconds.  ... 
doi:10.1007/s11042-018-6714-x fatcat:w6naakndkjdwrbx37sptk4on5y

GPU-based computation of distance functions on road networks with applications

Marta Fort, J. Antoni Sellarès
2009 Proceedings of the 2009 ACM symposium on Applied Computing - SAC '09  
We present a GPU-based algorithm for computing discretized distance functions on road networks.  ...  As applications, we provide algorithms for computing discrete Order-k Network Voronoi diagrams and for approximately solving k-Nearest Neighbor queries and Aggregate k-Nearest Neighbor queries on road  ...  We have used four real road networks: 1) Rock Island defined by 13,442 nodes and 12,865 edges; 2) Washington with 81,389 nodes and 100,703 edges; 3) Nevada with 280,942 ACKNOWLEDGMENTS We wish to thank  ... 
doi:10.1145/1529282.1529579 dblp:conf/sac/FortS09 fatcat:xgmtz6xo5jeurj7ypoz4sswe5i

Fleet management for ride-pooling with meeting points at scale: a case study in the five boroughs of New York City [article]

Motahare Mounesan, Vindula Jayawardana, Yaocheng Wu, Samitha Samaranayake, Huy T. Vo
2021 arXiv   pre-print
The high scalability of STaRS+ is achieved by utilizing a heuristic optimization strategy along with a novel shortest-path caching scheme.  ...  Passengers may choose to walk to a meeting point for a cost reduction. Drivers may also get matched with more riders without making additional stops.  ...  The backbone of an RP model or simulation framework is efficient shortest path queries. Shortest paths caching has been studied extensively to support fast querying in large scale road networks.  ... 
arXiv:2105.00994v1 fatcat:pnydyiwl3ngn5gqagchppzedk4

Roads, codes, and spatiotemporal queries

Sandeep Gupta, Swastik Kopparty, Chinya Ravishankar
2004 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems - PODS '04  
We present a novel coding-based technique for answering spatial and spatiotemporal queries on objects moving along a system of curves on the plane such as many road networks.  ...  We handle join, range, intercept, and other spatial and spatiotemporal queries under these assumptions, with distances being measured along the trajectories.  ...  [13] solved the k-nearest neighbor problem with distance measured as the shortest path on the road network.  ... 
doi:10.1145/1055558.1055576 dblp:conf/pods/GuptaKR04 fatcat:mjkly7pptfdahouu5wvmpt6yke

Path oracles for spatial networks

Jagan Sankaranarayanan, Hanan Samet, Houman Alborzi
2009 Proceedings of the VLDB Endowment  
estimated to be around 12 for road networks, but that can retrieve an intermediate link in a shortest path in O(log n) time using a B-tree.  ...  of source and destination vertices into groups that share common vertices or edges on the shortest paths between them.  ...  From a practical standpoint with respect to our experience with road networks, we observe that the minimum geodesic distance between any two vertices on a road network is at least 1 meter.  ... 
doi:10.14778/1687627.1687763 fatcat:dfdcfeo3snfzfn5tzdacxfwni4

Inferring Spatial Distance Rankings with Partial Knowledge on Routing Networks

Dominik Köppl
2022 Information  
Our proposal can be adopted for both static and time-dependent networks, and it can be used in conjunction with a general shortest-path algorithm.  ...  The most common problem on routing networks is to compute the shortest paths from a source vertex to a set of target vertices.  ...  Acknowledgments: We thank Roland Glück for comments and discussion on this topic. Conflicts of Interest: The author declares no conflict of interest.  ... 
doi:10.3390/info13040168 fatcat:2sniexbe75eodiqchutwtg6yxi
« Previous Showing results 1 — 15 out of 558 results