𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Dynamic algorithms for the shortest path routing problem: learning automata-based solutions

✍ Scribed by Misra, S.; Oommen, B.J.

Book ID
117938430
Publisher
IEEE
Year
2005
Tongue
English
Weight
622 KB
Volume
35
Category
Article
ISSN
1083-4419

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

New dynamic programming algorithms for t
New dynamic programming algorithms for the resource constrained elementary shortest path problem
✍ Giovanni Righini; Matteo Salani πŸ“‚ Article πŸ“… 2008 πŸ› John Wiley and Sons 🌐 English βš– 173 KB

## Abstract The resource constrained elementary shortest path problem (RCESPP) arises as a pricing subproblem in branch‐and‐price algorithms for vehicle‐routing problems with additional constraints. We address the optimization of the RCESPP and we present and compare three methods. The first method

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