Zobrazeno 1 - 10
of 28
pro vyhledávání: '"Thomas Pajor"'
Publikováno v:
Algorithmica. 82:1490-1546
We study the problem of computing paths that minimize energy consumption of a battery electric vehicle. For that, we must cope with specific properties, such as regenerative braking and constraints imposed by the battery capacity. These restrictions
Publikováno v:
Proceedings of the International Symposium on Combinatorial Search. 4:213
We study the problem of computing all Pareto-optimal journeys in a dynamic public transit network for two criteria: arrival time and number of transfers. Existing algorithms consider this as a graph problem, and solve it using variants of Dijkstra's
Publikováno v:
Proceedings of the International Symposium on Combinatorial Search. 4:212
Computing driving directions in road networks is a fundamental problem. Although it can be solved in essentially linear time by Dijkstra's algorithm, this is not fast enough to enable interactive queries on large-scale inputs. Instead, modern algorit
Publikováno v:
Transportation Science. 51:566-591
We propose the first routing engine for computing driving directions in large-scale road networks that satisfies all requirements of a real-world production system. It supports arbitrary metrics (cost functions) and turn costs, enables real-time quer
Publikováno v:
Transportation Science. 49:591-604
We study the problem of computing all Pareto-optimal journeys in a dynamic public transit network for multiple criteria, such as arrival time and number of transfers. Existing algorithms consider this as a graph problem and solve it using various gra
Publikováno v:
ACM Journal of Experimental Algorithmics. 19:1-19
In the multimodal route planning problem, we are given multiple transportation networks (e.g., pedestrian, road, public transit) and ask for a best integrated journey between two points. The main challenge is that a seemingly optimal journey may have
Publikováno v:
Computational Geometry. 47:381-406
Motivated by drawing route sketches, we consider the d-regular path schematization problem. For this problem we are given an embedded path P (e.g., a route in a road network) and a positive integer d. The goal is to find a d-schematized embedding of
Publikováno v:
Experimental Algorithms ISBN: 9783319388502
SEA
SEA
Algorithms for computing driving directions on road networks often presume constant costs on each arc. In practice, the current traffic situation significantly influences the travel time. One can distinguish traffic congestion that can be predicted u
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b6760b7f0cc5828a017e7c87adbf82ae
https://doi.org/10.1007/978-3-319-38851-9_3
https://doi.org/10.1007/978-3-319-38851-9_3
Autor:
Thomas Pajor, Daniel Delling, Hannah Bast, Andrew V. Goldberg, Peter Sanders, Matthias Müller-Hannemann, Renato F. Werneck, Dorothea Wagner
Publikováno v:
Algorithm Engineering ISBN: 9783319494869
Algorithm Engineering
Algorithm Engineering
We survey recent advances in algorithms for route planning in transportation networks. For road networks, we show that one can compute driving directions in milliseconds or less even at continental scale. A variety of techniques provide different tra
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::565fe0d257cc5d40de9cd53548e2483f
https://doi.org/10.1007/978-3-319-49487-6_2
https://doi.org/10.1007/978-3-319-49487-6_2