Computing all shortest passenger routes with a tropical Dijkstra algorithm
Given a public transportation network, which and how many passenger routes can potentially be shortest paths, when all possible timetables are taken into account? This question leads to shortest path problems on graphs with interval costs on their arcs and is closely linked to multi-objective optimi...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Artigo |
| Language: | Inglês |
| Published: |
Elsevier
2025-01-01
|
| Series: | EURO Journal on Transportation and Logistics |
| Subjects: | |
| Online Access: | http://www.sciencedirect.com/science/article/pii/S2192437625000123 |
| Tags: |
No Tags, Be the first to tag this record!
|