< Terug naar vorige pagina

Publicatie

A low-memory alternative for time-dependent Dijkstra

Boekbijdrage - Boekabstract Conferentiebijdrage

Time-dependent routing is an important challenge: congestion has a tremendous impact on society. It is also difficult to get accurate results. Many of the recently proposed algorithms are complicated and require much memory. This research presents a novel time-dependent routing heuristic with low memory requirements and a straightforward implementation. The Time-Location Penalty Model (TLPM) combines time-dependent Dijkstra with a linear preprocessing step to strongly reduce memory usage.
Boek: ORBEL 34, 34th annual conference of the Belgian Operational Research Society (ORBEL), Abstracts
Aantal pagina's: 1
Jaar van publicatie:2020
Toegankelijkheid:Open