Finding a minimum cost path between a pair of nodes in a time-varying road network with a congestion charge (Q2514743)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding a minimum cost path between a pair of nodes in a time-varying road network with a congestion charge |
scientific article |
Statements
Finding a minimum cost path between a pair of nodes in a time-varying road network with a congestion charge (English)
0 references
3 February 2015
0 references
heuristic
0 references
minimum cost path
0 references
time-varying
0 references
congestion charge
0 references
0 references
