|
 
|
[HPP16] The Capacitated Vehicle Routing Problem with Evidential Demands: A Belief-Constrained Programming Approach
Conférence Internationale avec comité de lecture : The 4th International Conference on Belief Functions: Theory and Applications (BELIEF 2016), September 2016, Vol. 9861, pp.212-221, Series LNCS, Prague, République Tchèque, (DOI: 10.1007/978-3-319-45559-4_22)Mots clés: Vehicle routing problem, Stochastic programming, Chance-constrained programming, Belief functions
Résumé:
This paper studies a vehicle routing problem, where vehicles have a limited capacity and customer demands are uncertain and represented by belief functions. More specifically, this problem is formalized using a belief function based extension of the chance-constrained programming approach, which is a classical modeling of stochastic mathematical programs. In addition, it is shown how the optimal solution cost is influenced by some important parameters involved in the model. Finally, some instances of this difficult problem are solved using a simulated annealing metaheuristic, demonstrating the feasibility of the approach.
BibTeX
| @inproceedings { | |||
| HPP16, | |||
| title | = | "{The Capacitated Vehicle Routing Problem with Evidential Demands: A Belief-Constrained Programming Approach}", | |
| author | = | " N. Helal and F. Pichon and D. Porumbel and D. Mercier and E. Lefevre ", | |
| booktitle | = | "{The 4th International Conference on Belief Functions: Theory and Applications (BELIEF 2016)}", | |
| year | = | 2016, | |
| month | = | "September", | |
| series | = | "LNCS", | |
| volume | = | 9861, | |
| pages | = | "212-221", | |
| address | = | "Prague, République Tchèque", | |
| doi | = | "10.1007/978-3-319-45559-4_22", | |
| } | |||
