✦ LIBER ✦

Dynamic shortest path problems with time-varying costs

✍ Scribed by S. Mehdi Hashemi; Shaghayegh Mokarami; Ebrahim Nasrabadi

Publisher: Springer-Verlag
Year: 2009
Tongue: English
Weight: 276 KB
Volume: 4
Category: Article
ISSN: 1862-4472
DOI: 10.1007/s11590-009-0162-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A finite-time algorithm for shortest pat

A finite-time algorithm for shortest path problems with time-varying costs

✍ A.B. Philpott; A.I. Mees 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 338 KB

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.

Continuous-time shortest path problems w

Continuous-time shortest path problems with stopping and starting costs

✍ A.B. Philpott; A.I. Mees 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 344 KB

We describe a general solution method for the problem of finding the shortest path between two vertices of a graph in which each edge has some transit time, costs can vary with time, and stopping and parking (with corresponding costs) are allowed at the vertices.

Dynamic shortest paths minimizing travel

Dynamic shortest paths minimizing travel times and costs

✍ Ravindra K. Ahuja; James B. Orlin; Stefano Pallottino; Maria G. Scutellà 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 141 KB

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

On Dynamic Shortest Paths Problems

✍ Liam Roditty; Uri Zwick 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 702 KB