This talk introduces a decomposition of the Elementary Shortest Path Problem with Resource Constraints(ESPPRC), where the path is combined by smaller sub paths. We show computational result by comparing different approaches for the decomposition and compare the best of these with existing algorithms. We show that the algorithm for many instances outperforms a bidirectional labeling algorithm.
|Publication status||Published - 2009|
|Event||The 20th International Symposium of Mathematical Programming - Chicago, US|
Duration: 1 Jan 2009 → …
Conference number: 20
|Conference||The 20th International Symposium of Mathematical Programming|
|Period||01/01/2009 → …|