Trip-based path algorithms using the transit network hierarchy (Q298925)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Trip-based path algorithms using the transit network hierarchy |
scientific article; zbMATH DE number 6595925
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Trip-based path algorithms using the transit network hierarchy |
scientific article; zbMATH DE number 6595925 |
Statements
Trip-based path algorithms using the transit network hierarchy (English)
0 references
21 June 2016
0 references
public transit modeling
0 references
network hierarchy
0 references
schedule-based transit network
0 references
shortest path
0 references
hyperpath
0 references
transit \(\mathrm A^*\)
0 references
0 references
0 references
0.7668153643608093
0 references
0.7653683423995972
0 references
0.7603887319564819
0 references
0.7564055919647217
0 references
0.7364133596420288
0 references
