R.F.: Faster customization of road networks (2013)

by D Delling, Werneck
Venue:In: Proc. International Symposium on Experimental Algorithms (SEA), LNCS
Add To MetaCart
Results 1 - 10 of 15

Recent advances in graph partitioning

by Aydın Buluç, Henning Meyerhenke, Ilya Safro, Peter Sanders, Christian Schulz , 2013
"... We survey recent trends in practical algorithms for balanced graph partitioning together with applications and future research directions. ..."
Abstract - Cited by 6 (2 self) - Add to MetaCart
We survey recent trends in practical algorithms for balanced graph partitioning together with applications and future research directions.

Optimizing landmark-based routing and preprocessing

by Alexandros Efentakis, Dieter Pfoser - In Proceedings of the 6th ACM SIGSPATIAL International Workshop on Computational Transportation Science, IWCTS ’13 , 2013
"... Many acceleration techniques exist for the single-pair shortest path problem on road networks. Most of them have been significantly improved over the years to achieve faster preprocessing times and superior performance. In this spirit, our current work significantly improves the classic ALT (A ∗ + L ..."
Abstract - Cited by 3 (3 self) - Add to MetaCart
Many acceleration techniques exist for the single-pair shortest path problem on road networks. Most of them have been significantly improved over the years to achieve faster preprocessing times and superior performance. In this spirit, our current work significantly improves the classic ALT (A ∗ + Landmarks + Triangle equality) algorithm. By carefully optimizing both preprocessing and query phases, we managed to effectively minimize preprocessing time to a few seconds, making the ALT algorithm also suitable for dynamic scenarios, i.e., road networks with changing edge weights due to traffic updates. We also accelerated the query phase for both unidi-rectional and bidirectional versions of the ALT algorithm, provid-ing fast enough query times (including full-path unpacking) suit-able for real-time services and continental road networks. Categories and Subject Descriptors

Energy-optimal routes for electric vehicles

by Moritz Baum, Julian Dibbelt, Thomas Pajor, Dorothea Wagner - In Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, SIGSPATIAL’13 , 2013
"... Abstract. We study the problem of electric vehicle route planning, where an important aspect is computing paths that minimize energy consumption. Thereby, any method must cope with specific properties, such as recuperation, battery constraints (over- and under-charging), and frequently changing cost ..."
Abstract - Cited by 3 (0 self) - Add to MetaCart
Abstract. We study the problem of electric vehicle route planning, where an important aspect is computing paths that minimize energy consumption. Thereby, any method must cope with specific properties, such as recuperation, battery constraints (over- and under-charging), and frequently changing cost functions (e. g., due to weather conditions). This work presents a practical algorithm that quickly computes energy-optimal routes for networks of continental scale. Exploiting multi-level overlay graphs [26, 31], we extend the Customizable Route Planning approach [8] to our scenario in a sound manner. This includes the efficient computation of profile queries and the adaption of bidirectional search to battery constraints. Our experimental study uses detailed consumption data measured from a production vehicle (Peugeot iOn). It reveals for the network of Europe that a new cost function can be incorporated in about five seconds, after which we answer random queries within 0.3ms on average. Additional evaluation on an artificial but realistic [22, 36] vehicle model with unlimited range demonstrates the excellent scalability of our algorithm: Even for long-range queries across Europe it achieves query times below 5ms on average—fast enough for interactive applications. Altogether, our algorithm exhibits faster query times than previous approaches, while improving (metric-dependent) preprocessing time by three orders of magnitude. 1
(Show Context)

Evolution and evaluation of the penalty method for alternative routes

by Moritz Kobitzsch, Marcel Radermacher, Dennis Schieferdecker - In ATMOS , 2013
"... Computing meaningful alternative routes in a road network is a complex problem – already giving a clear definition of a best alternative seems to be impossible. Still, multiple methods [1, 2, 4, 17, 18] describe how to compute reasonable alternative routes, each according to their own quality criter ..."
Abstract - Cited by 2 (1 self) - Add to MetaCart
Computing meaningful alternative routes in a road network is a complex problem – already giving a clear definition of a best alternative seems to be impossible. Still, multiple methods [1, 2, 4, 17, 18] describe how to compute reasonable alternative routes, each according to their own quality criteria. Among these methods, the penalty method has received much less attention than the via-node or plateaux based approaches. A mayor cause for the lack of interest might be the unavailability of an efficient implementation. In this paper, we take a closer look at the penalty method and extend upon its ideas. We provide the first viable implementation –suitable for interactive use – using dynamic runtime adjustments to perform up to multiple orders of magnitude faster queries than previous implementations. Using our new implementation, we thoroughly evaluate the penalty method for its flaws and benefits.

Hub Label Compression

by Daniel Delling, Andrew V. Goldberg, Renato F. Werneck - IN PROCEEDINGS OF THE 12TH INTERNATIONAL SYMPOSIUM ON EXPERIMENTAL ALGORITHMS (SEA’13), VOLUME 7933 OF LECTURE NOTES IN COMPUTER SCIENCE , 2013
"... The hub labels (HL) algorithm is the fastest known technique for computing driving times on road networks, but its practical appli-cability can be limited by high space requirements relative to the best competing methods. We develop compression techniques that substantially reduce HL space requirem ..."
Abstract - Cited by 2 (2 self) - Add to MetaCart
The hub labels (HL) algorithm is the fastest known technique for computing driving times on road networks, but its practical appli-cability can be limited by high space requirements relative to the best competing methods. We develop compression techniques that substantially reduce HL space requirements with a small performance penalty.
(Show Context)

Customizable Point-of-Interest Queries in Road Networks

by Daniel Delling, Renato F. Werneck
"... We present a unified framework for dealing with exact point-of-interest (POI) queries in dynamic continental road networks within interactive applications. We show that partition-based algorithms developed for point-to-point shortest path computations can be naturally extended to handle augmented q ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
We present a unified framework for dealing with exact point-of-interest (POI) queries in dynamic continental road networks within interactive applications. We show that partition-based algorithms developed for point-to-point shortest path computations can be naturally extended to handle augmented queries such as finding the closest restaurant or the best post office to stop on the way home, always ranking POIs according to a user-defined cost function. Our solution allows different trade-offs between indexing effort (time and space) and query time. Our most flexible variant allows the road network to change frequently (to account for traffic information or personalized cost functions) and the set of POIs to be specified at query time. Even in this fully dynamic scenario, our solution is fast enough for interactive applications on continental road networks.
(Show Context)

An Exact Combinatorial Algorithm for Minimum Graph Bisection

by Daniel Delling, Daniel Fleischman, Renato F. Werneck - MATH. PROGRAM., SER. A MANUSCRIPT NO. (WILL BE INSERTED BY THE EDITOR)
"... We present a novel exact algorithm for the minimum graph bisection problem, whose goal is to partition a graph into two equally-sized cells while minimizing the number of edges between them. Our algorithm is based on the branch-and-bound framework and, unlike most previous approaches, it is fully c ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
We present a novel exact algorithm for the minimum graph bisection problem, whose goal is to partition a graph into two equally-sized cells while minimizing the number of edges between them. Our algorithm is based on the branch-and-bound framework and, unlike most previous approaches, it is fully combinatorial. We introduce novel lower bounds based on packing trees, as well as a new decomposition technique that contracts entire regions of the graph while preserving optimality guarantees. Our algorithm works particularly well on graphs with relatively small minimum bisections, solving to optimality several large real-world instances (with up to millions of vertices) for the first time.

Customizable Route Planning in Road Networks

by Daniel Delling, Andrew V. Goldberg, Thomas Pajor, Renato F. Werneck , 2013
"... We propose the first routing engine for computing driving directions in large-scale road networks that satisfies all requirements of a real-world production system. It supports arbitrary metrics (cost functions) and turn costs, enables real-time queries, and can incorporate a new metric in less th ..."
Abstract - Cited by 1 (1 self) - Add to MetaCart
We propose the first routing engine for computing driving directions in large-scale road networks that satisfies all requirements of a real-world production system. It supports arbitrary metrics (cost functions) and turn costs, enables real-time queries, and can incorporate a new metric in less than a second, which is fast enough to support real-time traffic updates and personalized cost functions. The amount of metric-specific data is a small fraction of the graph itself, which allows us to maintain several metrics in memory simultaneously. The algorithm is the core of the routing engine currently in use by Bing Maps.
(Show Context)

KaHIP v0.6 -- Karlsruhe High Quality Partitioning -- user guide

by Peter Sanders, Christian Schulz
"... This paper severs as a user guide to the graph partitioning framework KaHIP (Karlsruhe High Quality Partitioning). We give a rough overview of the techniques used within the framework and describe the user interface as well as the file formats used. Moreover, we provide a short description of the cu ..."
Abstract - Add to MetaCart
This paper severs as a user guide to the graph partitioning framework KaHIP (Karlsruhe High Quality Partitioning). We give a rough overview of the techniques used within the framework and describe the user interface as well as the file formats used. Moreover, we provide a short description of the current library functions pro-

KaHIP v0.73 -- Karlsruhe High Quality Partitioning -- User Guide

by Peter Sanders, Christian Schulz
"... This paper serves as a user guide to the graph partitioning framework KaHIP (Karlsruhe High Quality Partitioning). We give a rough overview of the techniques used within the framework and describe the user interface as well as the file formats used. Moreover, we provide a short description of the cu ..."
Abstract - Add to MetaCart
This paper serves as a user guide to the graph partitioning framework KaHIP (Karlsruhe High Quality Partitioning). We give a rough overview of the techniques used within the framework and describe the user interface as well as the file formats used. Moreover, we provide a short description of the current library functions pro-