scholarly journals New dynamic programming algorithms for the resource constrained elementary shortest path problem

Networks ◽  
2007 ◽  
Vol 51 (3) ◽  
pp. 155-170 ◽  
Author(s):  
Giovanni Righini ◽  
Matteo Salani
Keyword(s):  
Dynamic Programming ◽  
Shortest Path ◽  
Shortest Path Problem ◽  
Resource Constrained ◽  
Elementary Shortest Path ◽  
Programming Algorithms

A rollout algorithm for the resource constrained elementary shortest path problem

2018 ◽  
Vol 34 (5) ◽  
pp. 1056-1074 ◽  
Author(s):  
Francesca Guerriero ◽  
Luigi Di Puglia Pugliese ◽  
Giusy Macrina
Keyword(s):  
Shortest Path ◽  
Shortest Path Problem ◽  
Resource Constrained ◽  
Elementary Shortest Path ◽  
Rollout Algorithm

scholarly journals A Multiple-Starting-Path Approach to the Resource-Constrainedkth Elementary Shortest Path Problem

2015 ◽  
Vol 2015 ◽  
pp. 1-7 ◽  
Author(s):  
Hyunchul Tae ◽  
Byung-In Kim
Keyword(s):  
Shortest Path ◽  
Resource Constraints ◽  
Shortest Paths ◽  
Shortest Path Problem ◽  
Computational Results ◽  
Resource Constrained ◽  
New Approach ◽  
Elementary Shortest Path

The resource-constrained elementary shortest path problem (RCESPP) aims to determine the shortest elementary path from the origin to the sink that satisfies the resource constraints. The resource-constrainedkth elementary shortest path problem (RCKESPP) is a generalization of the RCESPP that aims to determine thekth shortest path when a set ofk-1shortest paths is given. To the best of our knowledge, the RCKESPP has been solved most efficiently by using Lawler’s algorithm. This paper proposes a new approach named multiple-starting-path (MSP) to the RCKESPP. The computational results indicate that the MSP approach outperforms Lawler’s algorithm.

Sign in / Sign up

Export Citation Format

Share Document