An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems

Networks ◽  
2004 ◽  
Vol 44 (3) ◽  
pp. 216-229 ◽  
Author(s):  
Dominique Feillet ◽  
Pierre Dejax ◽  
Michel Gendreau ◽  
Cyrille Gueguen
Keyword(s):  
Vehicle Routing ◽  
Shortest Path ◽  
Resource Constraints ◽  
Exact Algorithm ◽  
Shortest Path Problem ◽  
Vehicle Routing Problems ◽  
Routing Problems ◽  
Elementary Shortest Path

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