37 citations · 50 across the 8 of their papers we have counts for
8 papers
Modeling and Engineering Constrained Shortest Path Algorithms for Battery Electric Vehicles
Moritz Baum, Julian Dibbelt, Dorothea Wagner +1
We study the problem of computing constrained shortest paths for battery electric vehicles. Since battery capacities are limited, fastest routes are often infeasible. Instead, user…
Shortest Feasible Paths with Charging Stops for Battery Electric Vehicles
Moritz Baum, Julian Dibbelt, Andreas Gemsa +2
We study the problem of minimizing overall trip time for battery electric vehicles in road networks. As battery capacity is limited, stops at charging stations may be inevitable. C…
Connection Scan Algorithm
Julian Dibbelt, Thomas Pajor, Ben Strasser +1
We introduce the Connection Scan Algorithm (CSA) to efficiently answer queries to timetable information systems. The input consists, in the simplest setting, of a source position a…
Dynamic Time-Dependent Route Planning in Road Networks with User Preferences
Moritz Baum, Julian Dibbelt, Thomas Pajor +1
There has been tremendous progress in algorithmic methods for computing driving directions on road networks. Most of that work focuses on time-independent route planning, where it…
Fast Computation of Isochrones in Road Networks
Moritz Baum, Valentin Buchhold, Julian Dibbelt +1
We study the problem of computing isochrones in road networks, where the objective is to identify the region that is reachable from a given source within a certain amount of time.…
Fast Exact Shortest Path and Distance Queries on Road Networks with Parametrized Costs
Julian Dibbelt, Ben Strasser, Dorothea Wagner
We study a scenario for route planning in road networks, where the objective to be optimized may change between every shortest path query. Since this invalidates many of the known…
Public Transit Labeling
Daniel Delling, Julian Dibbelt, Thomas Pajor +1
We study the journey planning problem in public transit networks. Developing efficient preprocessing-based speedup techniques for this problem has been challenging: current approac…
Customizable Contraction Hierarchies
Julian Dibbelt, Ben Strasser, Dorothea Wagner
We consider the problem of quickly computing shortest paths in weighted graphs given auxiliary data derived in an expensive preprocessing phase. By adding a fast weight-customizati…