Exact bidirectional algorithm for the least expected travel-time path problem on stochastic and time-dependent networks (Q2669733)
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: Exact bidirectional algorithm for the least expected travel-time path problem on stochastic and time-dependent networks |
scientific article; zbMATH DE number 7486404
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Exact bidirectional algorithm for the least expected travel-time path problem on stochastic and time-dependent networks |
scientific article; zbMATH DE number 7486404 |
Statements
Exact bidirectional algorithm for the least expected travel-time path problem on stochastic and time-dependent networks (English)
0 references
9 March 2022
0 references
pulse algorithm
0 references
least expected travel time
0 references
stochastic and time-dependent networks
0 references
dynamic and random travel times
0 references
transportation networks
0 references
0 references
0 references
0 references
0 references
0.7754564881324768
0 references
0.7741951942443848
0 references
0.7598520517349243
0 references
0.7477536797523499
0 references
