𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A shortest path algorithm with novel heuristics for dynamic transportation networks

✍ Scribed by Huang, B.; Wu, Q.; Zhan, F. B.

Book ID
111864415
Publisher
Taylor and Francis Group
Year
2007
Tongue
English
Weight
580 KB
Volume
21
Category
Article
ISSN
1365-8824

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A fully dynamic algorithm for distribute
A fully dynamic algorithm for distributed shortest paths
✍ Serafino Cicerone; Gabriele Di Stefano; Daniele Frigioni; Umberto Nanni πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 297 KB

We propose a fully dynamic distributed algorithm for the all-pairs shortest paths problem on general networks with positive real edge weights. If is the number of pairs of nodes changing the distance after a single edge modiΓΏcation (insert, delete, weight decrease, or weight increase) then the messa

Dynamic and stochastic shortest path in
Dynamic and stochastic shortest path in transportation networks with two components of travel time uncertainty
✍ Parichart Pattanamekar; Dongjoo Park; Laurence R. Rilett; Jeomho Lee; Choulki Le πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 682 KB

The existing dynamic and stochastic shortest path problem (DSSPP) algorithms assume that the mean and variance of link travel time (or other specific random variable such as cost) are available. When they are used with observed data from previous time periods, this assumption is reasonable. However,