Time-varying shortest path problems with
โ
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.