A Recourse Approach for the Capacitated Vehicle Routing Problem with Evidential Demands

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10369)


The capacitated vehicle routing problem with stochastic demands can be modelled using either the chance-constrained approach or the recourse approach. In previous works, we extended the former approach to address the case where uncertainty on customer demands is represented by belief functions, that is where customers have so-called evidential demands. In this paper, we propose an extension of the recourse approach for this latter case. We also provide a technique that makes computations tractable for realistic situations. The feasibility of our approach is then shown by solving instances of this difficult problem using a metaheuristic algorithm.


Vehicle routing problem Stochastic Programming with Recourse Belief function 


  1. 1.
    Birge, J.R., Louveaux, F.: Introduction to Stochastic Programming. Springer, New York (1997)zbMATHGoogle Scholar
  2. 2.
    Bodin, L.D., Golden, B.L., Assad, A.A., Ball, M.O.: Routing and scheduling of vehicles and crews: the state of the art. Comput. Oper. Res. 10(2), 63–212 (1983)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Denoeux, T.: Analysis of evidence-theoretic decision rules for pattern classification. Pattern Recogn. 30(7), 1095–1107 (1997)CrossRefGoogle Scholar
  4. 4.
    Dror, M., Laporte, G., Trudeau, P.: Vehicle routing with stochastic demands: properties and solution frameworks. Transport. Sci. 23(3), 166–176 (1989)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Gauvin, C., Desaulniers, G., Gendreau, M.: A branch-cut-and-price algorithm for vehicule routing problem with stochastic demands. Comput. Oper. Res. 50, 141–153 (2014)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Harmanani, H., Azar, D., Helal, N., Keirouz, W.: A simulated annealing algorithm for the capacitated vehicle routing problem. In: 26th International Conference on Computers and Their Applications, New Orleans, USA (2011)Google Scholar
  7. 7.
    Helal, N., Pichon, F., Porumbel, D., Mercier, D., Lefèvre, É.: The capacitated vehicle routing problem with evidential demands: a belief-constrained programming approach. In: Vejnarová, J., Kratochvíl, V. (eds.) BELIEF 2016. LNCS, vol. 9861, pp. 212–221. Springer, Cham (2016). doi: 10.1007/978-3-319-45559-4_22 CrossRefGoogle Scholar
  8. 8.
    Masri, H., Ben Abdelaziz, F.: Belief linear programming. Int. J. Approx. Reason. 51, 973–983 (2010)CrossRefzbMATHGoogle Scholar
  9. 9.
    Mourelatos, Z.P., Zhou, J.: A design optimization method using evidence theory. J. Mech. Design 128, 901–908 (2006)CrossRefGoogle Scholar
  10. 10.
    Vehicle Routing Data sets. Accessed 20 Mar 2016
  11. 11.
    Shafer, G.: A Mathematical Theory of Evidence. Princeton University Press, Princeton (1976)zbMATHGoogle Scholar
  12. 12.
    Srivastava, R.K., Deb, K., Tulshyan, R.: An evolutionary algorithm based approach to design optimization using evidence theory. J. Mech. Design 135(8), 081003-12 (2013)CrossRefGoogle Scholar
  13. 13.
    Sungur, I., Ordónez, F., Dessouky, M.: A robust optimization approach for the capacitated vehicle routing problem with demand uncertainty. IIE Trans. 40, 509–523 (2008)CrossRefGoogle Scholar
  14. 14.
    Stewart Jr., W.R., Golden, B.L.: Stochastic vehicle routing: a comprehensive approach. Eur. J. Oper. Res. 14(4), 371–385 (1983)CrossRefzbMATHGoogle Scholar

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  1. 1.Univ. Artois, EA 3926, Laboratoire de Génie Informatique et d’Automatique de l’Artois (LGI2A)BéthuneFrance
  2. 2.Conservatoire National des Arts et Métiers, EA 4629, CedricParisFrance

Personalised recommendations