A Recourse Approach for the Capacitated Vehicle Routing Problem with Evidential Demands
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.
KeywordsVehicle routing problem Stochastic Programming with Recourse Belief function
- 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.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
- 10.Vehicle Routing Data sets. http://www.coin-or.org/SYMPHONY/branchandcut/VRP/data/index.htm. Accessed 20 Mar 2016