๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On Solving Quickest Time Problems in Time-Dependent, Dynamic Networks

โœ Scribed by Elise Miller-Hooks; Sarah Stock Patterson

Book ID
111589752
Publisher
Springer Netherlands
Year
2004
Tongue
English
Weight
262 KB
Volume
3
Category
Article
ISSN
1570-1166

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Solving the -shortest path problem with
Solving the -shortest path problem with time windows in a time varying network
โœ Konstantinos N. Androutsopoulos; Konstantinos G. Zografos ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 922 KB

The k-shortest path problem in a network with time dependent cost attributes arises in many transportation decisions including hazardous materials routing and urban trip planning. The present paper proposes a label setting algorithm for solving this problem given that departure and arrival are const