Zobrazeno 1 - 10
of 134
pro vyhledávání: '"Contraction hierarchies"'
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Larsson, Martin
As the transport industry shifts towards Battery Electric Vehicles (BEVs) the need for accurate route planning rises. BEVs have reduced range compared to traditional fuel based vehicles, and the range can vary greatly depending on ambient conditions
Externí odkaz:
http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-333079
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Tobias Rupp, Stefan Funke
Publikováno v:
Algorithms, Vol 14, Iss 6, p 164 (2021)
We prove a Ω(n) lower bound on the query time for contraction hierarchies (CH) as well as hub labels, two popular speed-up techniques for shortest path routing. Our construction is based on a graph family not too far from subgraphs that occur in rea
Externí odkaz:
https://doaj.org/article/6ec02bfc0661447f99e80dfd78ae54cf
Autor:
Delborg, Olle, Insulander, Elias
This thesis addresses route planning of Battery Electric Heavy-Duty Commercial Vehicles to enhance the reliability of electric vehicle transport. Collaborating with Scania, a Swedish truck manufacturing company, the goal is to develop a pipeline that
Externí odkaz:
http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-505219
Publikováno v:
Algorithms, Vol 12, Iss 9, p 196 (2019)
Graph partitioning has many applications. We consider the acceleration of shortest path queries in road networks using Customizable Contraction Hierarchies (CCH). It is based on computing a nested dissection order by recursively dividing the road net
Externí odkaz:
https://doaj.org/article/429da88a6b7a40d88bf54074916ca690
Autor:
Klaus Nökel, Arne Schneck
Publikováno v:
Transportation Research Record: Journal of the Transportation Research Board. 2674:188-196
In many algorithms for traffic assignment, the most time-consuming step is shortest path search between all O–D pairs. Almost unnoticed by the transport modeling community, there has been an enormous amount of research on acceleration techniques fo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8f064af9b338f5266f0e8f1bb8a93f7e
https://doi.org/10.1177/0361198119898455
https://doi.org/10.1177/0361198119898455
Publikováno v:
IEEE Access, Vol 8, Pp 154338-154353 (2020)
When an emergency occurs in the city, a large area of road congestion usually occurs. Therefore, it is particularly important to provide an effective emergency path planning strategy for vehicles. However, existing emergency path planning methods do
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::53130d7094e917956ad7da6fa42b7597
https://ieeexplore.ieee.org/document/9174825/
https://ieeexplore.ieee.org/document/9174825/
Publikováno v:
Proceedings of the VLDB Endowment. 13:602-615
Computing the shortest path between two vertices is a fundamental problem in road networks that is applied in a wide variety of applications. To support efficient shortest path query processing, a plethora of index-based methods have been proposed in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1f169956e5a9e1afe1ac76e99152b363
https://doi.org/10.14778/3377369.3377371
https://doi.org/10.14778/3377369.3377371
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.