Labelling algorithms for the elementary shortest path problem with resource constraints considering EU drivers’ rules

2010 ◽  
Vol 2 (2) ◽  
pp. 79-96 ◽  
Author(s):  
Michael Drexl ◽  
Eric Prescott-Gagnon
2015 ◽  
Vol 2015 ◽  
pp. 1-7 ◽  
Author(s):  
Hyunchul Tae ◽  
Byung-In Kim

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