English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

We study the earliest arrival problem in road networks with statictime-dependent functions as arc weights. We propose and evaluate the followingsimple algorithm: (1) average the travel time in k time windows, (2) compute ashortest time-independent path within each window and mark the edges in thesepaths, and (3) compute a shortest time-dependent path in the original graphrestricted to the marked edges. Our experimental evaluation shows that thissimple algorithm yields near optimal results on well-established benchmarkinstances. We additionally demonstrate that the error can be further reduced byadditionally considering alternative routes at the expense of more markededges. Finally, we show that the achieved subgraphs are small enough to be ableto efficiently implement profile queries using a simple sampling-basedapproach. A highlight of our introduced algorithms is that they do not rely onlinking and merging profile functions.

Intriguingly Simple and Efficient Time-Dependent Routing in Road Networks