Acceleration strategies for the weight constrained shortest path problem with replenishment
- 296 Downloads
The weight constrained shortest path problem with replenishment (WCSPP-R) generalizes the constrained shortest path problem (CSP) and has multiple applications in transportation, scheduling, and telecommunications. We present an exact algorithm based on a recursive depth-first search that combines and extends ideas proposed in state-of-the-art algorithms for the CSP and the WCSPP-R. The novelty lies in a set of acceleration strategies that significantly improves the algorithm’s performance. We conducted experiments over large real-road networks with up to 6 million nodes and 15 million arcs, achieving speedups of up to 219 times against the state-of-the-art algorithm.
KeywordsConstrained shortest path problem replenishment large-scale networks
- 1.Corneil, D.: Lexicographic breadth first search: A survey. Graph-Theoretic Concepts in Computer Science. Lecture Notes in Computer Science, vol. 3353, pp. 1–19. Springer, Berlin, Heidelberg (2005)Google Scholar
- 2.Demetrescu, C., Goldberg, A., Johnson, D.: 9th DIMACS implementation challenge-shortest paths (2006). www.dis.uniroma1.it/challenge9/
- 3.Dongarra, J.J.: Performance of various computers using standard linear equations software. Technical report CS-89-85, University of Tennessee, USA (2013)Google Scholar