𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Dynamic shortest paths minimizing travel times and costs

✍ Scribed by Ravindra K. Ahuja; James B. Orlin; Stefano Pallottino; Maria G. Scutellà

Publisher
John Wiley and Sons
Year
2003
Tongue
English
Weight
141 KB
Volume
41
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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 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,

A dynamic programming algorithm for the
A dynamic programming algorithm for the shortest path problem with time windows and linear node costs
✍ Ioachim, Irina; G�linas, Sylvie; Soumis, Fran�ois; Desrosiers, Jacques 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 154 KB 👁 3 views

This paper presents an optimal dynamic programming algorithm, the first such algorithm in the literature to solve the shortest path problem with time windows and additional linear costs on the node service start times. To optimally solve this problem, we propose a new dynamic programming algorithm w