𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An improving dynamic programming algorithm to solve the shortest path problem with time windows

✍ Scribed by Nora Touati Moungla; Lucas Létocart; Anass Nagih

Book ID
108120780
Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
291 KB
Volume
36
Category
Article
ISSN
1571-0653

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

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