Graph neural networks for travel distance estimation and route recommendation under probabilistic hazards
Estimating the shortest travel time and providing route recommendations between different locations in a city or region can quantitatively measure the conditions of the transportation network during or after extreme events. One common approach is to use Dijkstra’s algorithm, which produces the short...
Guardat en:
| Autors principals: | , |
|---|---|
| Format: | Artigo |
| Idioma: | Inglês |
| Publicat: |
KeAi Communications Co., Ltd.
2026-03-01
|
| Col·lecció: | International Journal of Transportation Science and Technology |
| Matèries: | |
| Accés en línia: | http://www.sciencedirect.com/science/article/pii/S2046043025000371 |
| Etiquetes: |
Sense etiquetes, Sigues el primer a etiquetar aquest registre!
|