Mathematical Methods of Operations Research

, Volume 89, Issue 2, pp 281–317 | Cite as

Algorithms for non-linear and stochastic resource constrained shortest path

  • Axel ParmentierEmail author
Original Article


Resource constrained shortest path problems are usually solved thanks to a smart enumeration of all the non-dominated paths. Recent improvements of these enumeration algorithms rely on the use of bounds on path resources to discard partial solutions. The quality of the bounds determines the performance of the algorithm. The main contribution of this paper is to introduce a standard procedure to generate bounds on paths resources in a general setting which covers most resource constrained shortest path problems, among which stochastic versions. In that purpose, we introduce a generalization of the resource constrained shortest path problem where the resources are taken in a monoid. The resource of a path is the monoid sum of the resources of its arcs. The problem consists in finding a path whose resource minimizes a non-decreasing cost function of the path resource among the paths that respect a given constraint. Enumeration algorithms are generalized to this framework. We use lattice theory to provide polynomial procedures to find good quality bounds. These procedures solve a generalization of the algebraic path problem, where arc resources belong to a lattice ordered monoid. The practical efficiency of the approach is proved through an extensive numerical study on some deterministic and stochastic resource constrained shortest path problems.


Resource constrained shortest path Stochastic shortest path Risk measures Lattice ordered monoid 

Mathematics Subject Classification




I greatly thank my Ph.D. advisor Frédéric Meunier for his numerous and deep remarks on the mathematics and the way to write this article. I am also grateful to the anonymous referees for their useful comments that clearly helped me improve this paper.


  1. 9th dimacs implementation challenge, shortest paths (2006). Accessed 7 Dec 2016
  2. Adulyasak Y, Jaillet P (2015) Models and algorithms for stochastic and robust vehicle routing with deadlines. Transp Sci 50(2):608–626Google Scholar
  3. Aho AV, Hopcroft JE (1974) The design and analysis of computer algorithms. Pearson Education India, ChennaizbMATHGoogle Scholar
  4. Artzner P, Delbaen F, Eber JM, Heath D (1999) Coherent measures of risk. Math Finance 9(3):203–228MathSciNetzbMATHGoogle Scholar
  5. Backhouse RC, Carré BA (1975) Regular algebra applied to path-finding problems. IMA J Appl Math 15(2):161–186MathSciNetzbMATHGoogle Scholar
  6. Bast H, Delling D, Goldberg A, Müller-Hannemann M, Pajor T, Sanders P, Wagner D, Werneck R (2014) Route planning in transportation networksGoogle Scholar
  7. Beasley J, Christofides N (1989) An algorithm for the resource constrained shortest path problem. Networks 19(4):379–394MathSciNetzbMATHGoogle Scholar
  8. Bellman R (1958) On a routing problem. Q Appl Math 16:87–90zbMATHGoogle Scholar
  9. Bertsimas DJ (1992) A vehicle routing problem with stochastic demand. Oper Res 40(3):574–585MathSciNetzbMATHGoogle Scholar
  10. Bertsimas DJ, Simchi-Levi D (1996) A new generation of vehicle routing research: robust algorithms, addressing uncertainty. Oper Res 44(2):286–304zbMATHGoogle Scholar
  11. Blyth TS (2005) Lattices and ordered algebraic structures, vol 1. Springer, BerlinzbMATHGoogle Scholar
  12. Bogerding M (2013) Kissfft library. Accessed 16 Feb 2017
  13. Borndörfer R, Grötschel M, Löbel A (2001) Scheduling duties by adaptive column generation. Technischer Bericht 01–02, Konrad-Zuse-Zentrum für Informationstechnik Berlin (ZIB), Berlin.
  14. Carlyle WM, Royset JO, Kevin Wood R (2008) Lagrangian relaxation and enumeration for solving constrained shortest-path problems. Networks 52(4):256–270MathSciNetzbMATHGoogle Scholar
  15. Carré BA (1971) An algebra for network routing problems. IMA J Appl Math 7(3):273–294MathSciNetzbMATHGoogle Scholar
  16. Chang TS, Wan Y, Ooi WT (2009) A stochastic dynamic traveling salesman problem with hard time windows. Eur J Oper Res 198(3):748–759MathSciNetzbMATHGoogle Scholar
  17. Chen A, Ji Z (2005) Path finding under uncertainty. J Adv Transp 39(1):19–37Google Scholar
  18. Chen BY, Lam WH, Sumalee A, Li Q, Shao H, Fang Z (2013) Finding reliable shortest paths in road networks under uncertainty. Netw Spat Econ 13(2):123–148MathSciNetzbMATHGoogle Scholar
  19. Cousot P, Cousot R (1977) Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on principles of programming languages. ACM, New York, pp 238–252Google Scholar
  20. Cousot P, Cousot R (1979) Constructive versions of Tarski’s fixed point theorems. Pac J Math 82(1):43–57MathSciNetzbMATHGoogle Scholar
  21. Davey BA, Priestley HA (2002) Introduction to lattices and order. Cambridge University Press, CambridgezbMATHGoogle Scholar
  22. De Silva A (2001) Combining constraint programming and linear programming on an example of bus driver scheduling. Ann Oper Res 108(1–4):277–291MathSciNetzbMATHGoogle Scholar
  23. Desrochers M, Soumis F (1988) A generalized permanent labeling algorithm for the shortest path problem with time windows. INFOR Inf Syst Oper Res 26(3):191–212zbMATHGoogle Scholar
  24. Dijkstra EW (1959) A note on two problems in connexion with graphs. Numer Math 1(1):269–271MathSciNetzbMATHGoogle Scholar
  25. Dumitrescu I, Boland N (2003) Improved preprocessing, labeling and scaling algorithms for the weight-constrained shortest path problem. Networks 42(3):135–153MathSciNetzbMATHGoogle Scholar
  26. Eiger A, Mirchandani PB, Soroush H (1985) Path preferences and optimal paths in probabilistic networks. Transp Sci 19(1):75–84MathSciNetGoogle Scholar
  27. Eppstein D (1998) Finding the k shortest paths. SIAM J Comput 28(2):652–673MathSciNetzbMATHGoogle Scholar
  28. Fahle T, Junker U, Karisch SE, Kohl N, Sellmann M, Vaaben B (2002) Constraint programming based column generation for crew assignment. J Heuristics 8(1):59–81zbMATHGoogle Scholar
  29. Fan Y, Nie Y (2006) Optimal routing for maximizing the travel time reliability. Netw Spat Econ 6(3–4):333–344MathSciNetzbMATHGoogle Scholar
  30. Feillet D, Dejax P, Gendreau M, Gueguen C (2004) An exact algorithm for the elementary shortest path problem with resource constraints: application to some vehicle routing problems. Networks 44(3):216–229MathSciNetzbMATHGoogle Scholar
  31. Fink E (1992) A survey of sequential and systolic algorithms for the algebraic path problem. University of Waterloo, Faculty of MathematicsGoogle Scholar
  32. Flajolet A, Blandin S, Jaillet P (2014) Robust adaptive routing under uncertainty. arXiv preprint arXiv:1408.3374
  33. Ford LR, Fulkerson DR (1956) Maximal flow through a network. Can J Math 8(3):399–404MathSciNetzbMATHGoogle Scholar
  34. Frank H (1969) Shortest paths in probabilistic graphs. Oper Res 17(4):583–599MathSciNetzbMATHGoogle Scholar
  35. Fu L (2001) An adaptive routing algorithm for in-vehicle route guidance systems with real-time information. Transp Res Part B Methodol 35(8):749–765Google Scholar
  36. Fu L, Rilett LR (1998) Expected shortest paths in dynamic and stochastic traffic networks. Transp Res Part B Methodol 32(7):499–516Google Scholar
  37. Gondran M, Minoux M (2008) Graphs, dioids and semirings: new models and algorithms, vol 41. Springer, BerlinzbMATHGoogle Scholar
  38. Gounaris CE, Wiesemann W, Floudas CA (2013) The robust capacitated vehicle routing problem under demand uncertainty. Oper Res 61(3):677–693MathSciNetzbMATHGoogle Scholar
  39. Gualandi S, Malucelli F (2009) Constraint programming-based column generation. 4OR 7(2):113–137MathSciNetzbMATHGoogle Scholar
  40. Gualandi S, Malucelli F (2012) Resource constrained shortest paths with a super additive objective function. In: Milano M (ed) Principles and practice of constraint programming. Springer, Berlin, pp 299–315Google Scholar
  41. Hall RW (1986) The fastest path through a network with random time-dependent travel times. Transp Sci 20(3):182–188MathSciNetGoogle Scholar
  42. Handler GY, Zang I (1980) A dual algorithm for the constrained shortest path problem. Networks 10(4):293–309MathSciNetzbMATHGoogle Scholar
  43. Hart PE, Nilsson NJ, Raphael B (1968) A formal basis for the heuristic determination of minimum cost paths. IEEE Trans Syst Sci Cybern 4(2):100–107Google Scholar
  44. Ioachim I, Gelinas S, Soumis F, Desrosiers J (1998) A dynamic programming algorithm for the shortest path problem with time windows and linear node costs. Networks 31(3):193–204MathSciNetzbMATHGoogle Scholar
  45. Irnich S (2008) Resource extension functions: properties, inversion, and generalization to segments. OR Spectr 30(1):113–148MathSciNetzbMATHGoogle Scholar
  46. Irnich S, Desaulniers G (2005) Shortest path problems with resource constraints. Springer, BerlinzbMATHGoogle Scholar
  47. Irnich S, Villeneuve D (2006) The shortest-path problem with resource constraints and k-cycle elimination for \(k \ge 3\). INFORMS J Comput 18(3):391–406MathSciNetzbMATHGoogle Scholar
  48. Jaillet P, Qi J, Sim M (2016) Routing optimization under uncertainty. Oper Res 64(1):186–200MathSciNetzbMATHGoogle Scholar
  49. Joksch HC (1966) The shortest route problem with constraints. J Math Anal Appl 14(2):191–197MathSciNetzbMATHGoogle Scholar
  50. Jula H, Dessouky M, Ioannou PA (2006) Truck route planning in nonstationary stochastic networks with time windows at customer locations. IEEE Trans Intell Transp Syst 7(1):51–62Google Scholar
  51. Junker U, Karisch SE, Kohl N, Vaaben B, Fahle T, Sellmann M (1999) A framework for constraint programming based column generation. In: International conference on principles and practice of constraint programming. Springer, Berlin, pp 261–274Google Scholar
  52. Kohl N, Desrosiers J, Madsen OB, Solomon MM, Soumis F (1999) 2-path cuts for the vehicle routing problem with time windows. Transp Sci 33(1):101–116zbMATHGoogle Scholar
  53. Kosuch S, Lisser A (2010) Stochastic shortest path problem with delay excess penalty. Electron Notes Discrete Math 36:511–518zbMATHGoogle Scholar
  54. Larsen J (1999) Parallelization of the vehicle routing problem with time windows. Ph.D. Thesis, Technical University of Denmark, Department of Informatics and Mathematical ModelingGoogle Scholar
  55. Lehmann DJ (1977) Algebraic structures for transitive closure. Theor Comput Sci 4(1):59–76MathSciNetzbMATHGoogle Scholar
  56. Li X, Tian P, Leung SC (2010) Vehicle routing problems with time windows and stochastic travel and service times: models and algorithm. Int J Prod Econ 125(1):137–145Google Scholar
  57. Loui RP (1983) Optimal paths in graphs with stochastic or multidimensional weights. Commun ACM 26(9):670–676MathSciNetzbMATHGoogle Scholar
  58. Lozano L, Medaglia AL (2013) On an exact method for the constrained shortest path problem. Comput Oper Res 40(1):378–384zbMATHGoogle Scholar
  59. Mazmanyan L, Trietsch D, Baker K (2009) Stochastic traveling salesperson models with safety time. Tech. rep., Working paperGoogle Scholar
  60. Mirchandani PB (1976) Shortest distance and reliability of probabilistic networks. Comput Oper Res 3(4):347–355Google Scholar
  61. Mohri M (2002) Semiring frameworks and algorithms for shortest-distance problems. J Autom Lang Comb 7(3):321–350MathSciNetzbMATHGoogle Scholar
  62. Murthy I, Sarkar S (1996) A relaxation-based pruning technique for a class of stochastic shortest path problems. Transp Sci 30(3):220–236zbMATHGoogle Scholar
  63. Murthy I, Sarkar S (1998) Stochastic shortest path problems with piecewise-linear concave utility functions. Manag Sci 44(11–part–2):S125–S136zbMATHGoogle Scholar
  64. Nie Y, Fan Y (2006) Arriving-on-time problem: discrete algorithm that ensures convergence. Transp Res Rec J Transp Res Board 1964(1):193–200Google Scholar
  65. Nikolova E (2010) High-performance heuristics for optimization in stochastic traffic engineering problems. In: Lirkov I, Margenov S, Wisniewski J (eds) Large-scale scientific computing. Springer, Berlin, pp 352–360Google Scholar
  66. Nikolova E, Kelner JA, Brand M, Mitzenmacher M (2006) Stochastic shortest paths via quasi-convex maximization. In: Algorithms–ESA 2006. Springer, Berlin, pp 552–563Google Scholar
  67. Parmentier A (2016) Algorithms for shortest path and airline problems. Ph.D. Thesis, École des Ponts Paristech, Université Paris EstGoogle Scholar
  68. Parmentier A, Meunier F (2017) Aircraft routing and crew pairing: updated algorithms at air France. arXiv preprint arXiv:1706.06901
  69. Powell WB, Chen ZL (1998) A generalized threshold algorithm for the shortest path problem with time windows. DIMACS Ser Discrete Math Theor Comput Sci 40:303–318MathSciNetzbMATHGoogle Scholar
  70. Righini G, Salani M (2009) Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming. Comput Oper Res 36(4):1191–1203zbMATHGoogle Scholar
  71. Rousseau LM, Gendreau M, Pesant G, Focacci F (2004) Solving VRPTWS with constraint programming based column generation. Ann Oper Res 130(1–4):199–216MathSciNetzbMATHGoogle Scholar
  72. Roy B (1959) Transitivité et connexité. C R Hebd Seances Acad Sci 249(2):216–218zbMATHGoogle Scholar
  73. Russell R, Urban T (2008) Vehicle routing with soft time windows and erlang travel times. J Oper Res Soc 59(9):1220–1228zbMATHGoogle Scholar
  74. Sabran G, Samaranayake S, Bayen AM (2014) Precomputation techniques for the stochastic on-time arrival problem. In: ALENEX. SIAM, Philodelphia, pp 138–146Google Scholar
  75. Samaranayake S, Blandin S, Bayen A (2012) A tractable class of algorithms for reliable routing in stochastic networks. Transp Res Part C Emerg Technol 20(1):199–217zbMATHGoogle Scholar
  76. Santos L, Coutinho-Rodrigues J, Current JR (2007) An improved solution algorithm for the constrained shortest path problem. Transp Res Part B Methodol 41(7):756–771Google Scholar
  77. Sivakumar RA, Batta R (1994) The variance-constrained shortest path problem. Transport Sci 28(4):309–316MathSciNetzbMATHGoogle Scholar
  78. Sungur I, Ordónez F, Dessouky M (2008) A robust optimization approach for the capacitated vehicle routing problem with demand uncertainty. IIE Trans 40(5):509–523Google Scholar
  79. Taş D, Gendreau M, Dellaert N, Van Woensel T, De Kok A (2014) Vehicle routing with soft time windows and stochastic travel times: a column generation and branch-and-price solution approach. Eur J Oper Res 236(3):789–799MathSciNetzbMATHGoogle Scholar
  80. Tsaggouris G, Zaroliagis C (2004) Non-additive shortest paths. In: European symposium on algorithms. Springer, Berlin, pp 822–834Google Scholar
  81. Zimmermann U (1981) Linear and combinatorial optimization in ordered algebraic structures. Elsevier, AmsterdamzbMATHGoogle Scholar

Copyright information

© Springer-Verlag GmbH Germany, part of Springer Nature 2018

Authors and Affiliations

  1. 1.École Nationale des Ponts et Chaussées, CERMICSMarne-la-Vallée Cedex 2France

Personalised recommendations