Time-Dependent Alternative Route Planning: Theory and Practice
نویسندگان
چکیده
We consider the problem of computing a set meaningful alternative origin-to-destination routes, in real-world road network instances whose arcs are accompanied by travel-time functions rather than fixed costs. In this time-dependent route scenario, we present novel query algorithm, called Time-Dependent Alternative Graph (TDAG), that exploits outcome time-consuming preprocessing phase to create manageable amount metadata, order provide answers for arbitrary alternative-routes queries, only few milliseconds continental-size instances. The resulting routes is aggregated form graph, which characterized minimum overlap, small stretch factor, size, and low complexity. To our knowledge, first work deals with setting framework routes. preprocessed metadata prescribe informations between “landmark” nodes all other graph. TDAG algorithm carries out two distinct phases: initially, collection constructs candidate routes; consequently, pruning cautiously discards uninteresting or low-quality from set. Our experimental evaluation on real-world, networks demonstrates performed much better (by one orders magnitude) existing baseline approaches.
منابع مشابه
Time-Dependent Route Planning
In this paper, we present an overview over existing speed-up techniques for timedependent route planning. Apart from only explaining each technique one by one, we follow a more systematic approach. We identify basic ingredients of these recent techniques and show how they need to be augmented to guarantee correctness in time-dependent networks. With the ingredients adapted, three efficient spee...
متن کاملImproved Alternative Route Planning
We present improved methods for computing a set of alternative source-to-destination routes in road networks in the form of an alternative graph. The resulting alternative graphs are characterized by minimum path overlap, small stretch factor, as well as low size and complexity. Our approach improves upon a previous one by introducing a new pruning stage preceding any other heuristic method and...
متن کاملTime-Dependent Route Planning with Generalized Objective Functions
We consider the problem of finding routes in road networks that optimize a combination of travel time and additional time-invariant costs. These could be an approximation of energy consumption, distance, tolls, or other penalties. The resulting problem is NP-hard, but if the additional cost is proportional to driving distance we can solve it optimally on the German road network within 2.3 s usi...
متن کاملTheory and Practice in Planning
This paper explores opportunities for synergy between theoretical and applied researchers in the area of automated planning. From the diiering perspectives of theorists, experimentalists, and practitioners, we examine the causes of current dissatisfaction with existing theoretical and experimental results. We survey approaches from theoretical computer science that provide alternatives to the s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithms
سال: 2021
ISSN: ['1999-4893']
DOI: https://doi.org/10.3390/a14080220