Abstract
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.
Similar content being viewed by others
References
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)
Demetrescu, C., Goldberg, A., Johnson, D.: 9th DIMACS implementation challenge-shortest paths (2006). www.dis.uniroma1.it/challenge9/
Dongarra, J.J.: Performance of various computers using standard linear equations software. Technical report CS-89-85, University of Tennessee, USA (2013)
Dumitrescu, I., Boland, N.: Improved preprocessing, labeling and scaling algorithms for the weight-constrained shortest path problem. Networks 42(3), 135–153 (2003)
Handler, G.Y., Zang, I.: A dual algorithm for the constrained shortest path problem. Networks 10(4), 293–309 (1980)
Joksch, H.C.: The shortest route problem with constraints (shortest route problem with constraint, using set of nodes). J. Math. Anal. Appl. 14(2), 191–197 (1966)
Korf, R.E.: Depth-first iterative-deepening: an optimal admissible tree search. Artif. Intell. 27(1), 97–109 (1985)
Lozano, L., Medaglia, A.L.: On an exact method for the constrained shortest path problem. Comput. Oper. Res. 40(1), 378–384 (2013)
Raith, A., Ehrgott, M.: A comparison of solution strategies for biobjective shortest path problems. Comput. Oper. Res. 36(4), 1299–1331 (2009)
Santos, L., Coutinho-Rodrigues, J., Current, J.R.: An improved solution algorithm for the constrained shortest path problem. Transp. Res. Part B: Methodol. 41(7), 756–771 (2007)
Smith, O.J., Boland, N., Waterer, H.: Solving shortest path problems with a weight constraint and replenishment arcs. Comput. Oper. Res. 39(5), 964–984 (2012)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Bolívar, M.A., Lozano, L. & Medaglia, A.L. Acceleration strategies for the weight constrained shortest path problem with replenishment. Optim Lett 8, 2155–2172 (2014). https://doi.org/10.1007/s11590-014-0742-x
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11590-014-0742-x