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 socalled 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.
CITATION STYLE
Helal, N., Pichon, F., Porumbel, D., Mercier, D., & Lefèvre, É. (2017). A recourse approach for the capacitated vehicle routing problem with evidential demands. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10369 LNAI, pp. 190–200). Springer Verlag. https://doi.org/10.1007/978-3-319-61581-3_18
Mendeley helps you to discover research relevant for your work.