Multi-Modal Route Planning in Road and Transit Networks

09/14/2018
by   Daniel Tischner, et al.
0

We present algorithms for multi-modal route planning in road and public transit networks, as well as in combined networks. Therefore, we explore the nearest neighbor and shortest path problem and propose solutions based on Cover-Trees, ALT and CSA. Further, we illustrate the theory behind the algorithms, give a short overview of other techniques, present experimental results and compare the techniques with each other.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/03/2020

Deep Reinforcement Learning Based Dynamic Route Planning for Minimizing Travel Time

Route planning is important in transportation. Existing works focus on f...
research
08/18/2022

Customizable Hub Labeling: Properties and Algorithms

Hub Labeling (HL) is one of the state-of-the-art preprocessing-based tec...
research
04/26/2020

An Efficient Index Method for the Optimal Route Query over Multi-Cost Networks

Smart city has been consider the wave of the future and the route recomm...
research
06/10/2021

Efficient Exact k-Flexible Aggregate Nearest Neighbor Search in Road Networks Using the M-tree

This study proposes an efficient exact k-flexible aggregate nearest neig...
research
09/14/2022

ImageArg: A Multi-modal Tweet Dataset for Image Persuasiveness Mining

The growing interest in developing corpora of persuasive texts has promo...
research
10/28/2022

Towards Trustworthy Multi-Modal Motion Prediction: Evaluation and Interpretability

Predicting the motion of other road agents enables autonomous vehicles t...
research
06/12/2023

Performance of Graph Database Management Systems as route planning solutions for different data and usage characteristics

Graph databases have grown in popularity in recent years as they are abl...

Please sign up or login with your details

Forgot password? Click here to reset