An Alternative Approach to Alternative Routes: HiDAR

Kobitzsch, Moritz

doi:10.1007/978-3-642-40450-4_52

Cited by 20 publications

(10 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We take the union of all paths P s,v,t with v ∈ V C that adhere to the feasibility criteria as alternative graph. This corresponds to an approach previously discussed in [12].…”

Section: Adjustments For Our Settingmentioning

confidence: 98%

See 1 more Smart Citation

Pruning Techniques for the Stochastic on-time Arrival Problem\texorpdfstring -- An Experimental Study

Kobitzsch,

Samaranayake,

Schieferdecker

2014

Preprint

Self Cite

View full text Add to dashboard Cite

Computing shortest paths is one of the most researched topics in algorithm engineering. Currently available algorithms compute shortest paths in mere fractions of a second on continental sized road networks. In the presence of unreliability, however, current algorithms fail to achieve results as impressive as for the static setting. In contrast to speed-up techniques for static route planning, current implementations for the stochastic on-time arrival problem require the computationally expensive step of solving convolution products. Running times can reach hours when considering large scale networks. We present a novel approach to reduce this immense computational effort of stochastic routing based on existing techniques for alternative routes. In an extensive experimental study, we show that the process of stochastic route planning can be speed-up immensely, without sacrificing much in terms of accuracy.

show abstract

“…We take the union of all paths P s,v,t with v ∈ V C that adhere to the feasibility criteria as alternative graph. This corresponds to an approach previously discussed in [12].…”

Section: Adjustments For Our Settingmentioning

confidence: 98%

“…Via-Node Alternative Routes. The via-node approach to alternatives routes was first introduced in [5] and later refined by [1,12,14]. The main idea behind this approach is to model alternative routes P s,v,t as a concatenation of two shortest paths P s,v , P v,t , with v called a via node.…”

Section: Existing Techniquesmentioning

confidence: 99%

Pruning Techniques for the Stochastic on-time Arrival Problem\texorpdfstring -- An Experimental Study

Kobitzsch,

Samaranayake,

Schieferdecker

2014

Preprint

Self Cite

View full text Add to dashboard Cite

show abstract

“…The experimental results are also valuable as benchmarks for existing algorithms searching locally optimal v-paths for route planning purposes (Abraham et al, 2013;Kobitzsch, 2013;Luxen and Schieferdecker, 2015). Some of these algorithms apply approximations to gain efficiency.…”

Section: Significancementioning

confidence: 99%

Locally optimal routes for route choice sets

Fischer

2019

Preprint

View full text Add to dashboard Cite

Route choice is often modelled as a two-step procedure in which travellers choose their routes from small sets of promising candidates. Many methods developed to identify such choice sets rely on assumptions about the mechanisms behind the route choice and require corresponding data sets. Furthermore, existing approaches often involve considerable complexity or perform many repeated shortest path queries. This makes it difficult to apply these methods in comprehensive models with numerous origin-destination pairs. In this paper, we address these issues by developing an algorithm that efficiently identifies locally optimal routes. Such paths arise from travellers acting rationally on local scales, whereas unknown factors may affect the routes on larger scales. Though methods identifying locally optimal routes are available already, these algorithms rely on approximations and return only few, heuristically chosen paths for specific origin-destination pairs. This conflicts with the demands of route choice models, where an exhaustive search for many origins and destinations would be necessary. We therefore extend existing algorithms to return (almost) all admissible paths between a large number of origin-destination pairs. We test our algorithm on a road network modelling the Canadian province British Columbia and analyze the distribution of locally optimal paths in the province.

show abstract

“…Only the running time of TD-S+A is affected. Note that, while this alternative algorithm is simple to implement, other algorithms exist [1,22,23,26,2] that yield different and possibly better alternatives.…”

Section: Adding Alternatives: Td-s+amentioning

confidence: 99%

Intriguingly Simple and Efficient Time-Dependent Routing in Road Networks

Strasser

2016

Preprint

View full text Add to dashboard Cite

We study the earliest arrival problem in road networks with static time-dependent functions as arc weights. We propose and evaluate the following simple algorithm: (1) average the travel time in k time windows, (2) compute a shortest time-independent path within each window and mark the edges in these paths, and (3) compute a shortest time-dependent path in the original graph restricted to the marked edges. Our experimental evaluation shows that this simple algorithm yields near optimal results on well-established benchmark instances. We additionally demonstrate that the error can be further reduced by additionally considering alternative routes at the expense of more marked edges. Finally, we show that the achieved subgraphs are small enough to be able to efficiently implement profile queries using a simple sampling-based approach. A highlight of our introduced algorithms is that they do not rely on linking and merging profile functions.

show abstract

An Alternative Approach to Alternative Routes: HiDAR

Cited by 20 publications

References 10 publications

Pruning Techniques for the Stochastic on-time Arrival Problem\texorpdfstring -- An Experimental Study

Pruning Techniques for the Stochastic on-time Arrival Problem\texorpdfstring -- An Experimental Study

Locally optimal routes for route choice sets

Intriguingly Simple and Efficient Time-Dependent Routing in Road Networks

Contact Info

Product

Resources

About