𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Solving the -shortest path problem with time windows in a time varying network

✍ Scribed by Konstantinos N. Androutsopoulos; Konstantinos G. Zografos

Publisher
Elsevier Science
Year
2008
Tongue
English
Weight
922 KB
Volume
36
Category
Article
ISSN
0167-6377

No coin nor oath required. For personal study only.

✦ Synopsis

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 constrained within specified time windows.

πŸ“œ SIMILAR VOLUMES

Time-varying shortest path problems with
Time-varying shortest path problems with constraints
✍ Cai, X.; Kloks, T.; Wong, C. K. πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 159 KB

We study a new version of the shortest path problem. Let G Γ… (V, E) be a directed graph. Each arc e √ E has two numbers attached to it: a transit time b(e, u) and a cost c(e, u), which are functions of the departure time u at the beginning vertex of the arc. Moreover, postponement of departure (i.e.