The Capacitated Vehicle Routing Problem with Evidential Demands: A Belief-Constrained Programming Approach

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.

[1]  M. J. L. Kirby.  THE CURRENT STATE OF CHANCE-CONSTRAINED PROGRAMMING , 2015 .

[2]  Kalyanmoy Deb,et al.  An evolutionary algorithm based approach to design optimization using evidence theory , 2013 .

[3]  Z. Mourelatos,et al.  A Design Optimization Method Using Evidence Theory , 2006, DAC 2005.

[4]  Ronald R. Yager,et al.  Arithmetic and Other Operations on Dempster-Shafer Structures , 1986, Int. J. Man Mach. Stud..

[5]  W. T. Tucker,et al.  Sensitivity in risk analyses with uncertain numbers. , 2006 .

[6]  Gilbert Laporte,et al.  An Integer L-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands , 2002, Oper. Res..

[7]  Thierry Denoeux,et al.  Relevance and truthfulness in information correction and fusion , 2012, Int. J. Approx. Reason..

[8]  L. Bodin.  ROUTING AND SCHEDULING OF VEHICLES AND CREWS–THE STATE OF THE ART , 1983 .

[9]  Danielle Azar,et al.  A Simulated Annealing Algorithm for the Capacitated Vehicle Routing Problem , 2011, CATA.

[10]  Fouad Ben Abdelaziz,et al.  Belief linear programming , 2010, Int. J. Approx. Reason..

[11]  Thierry Denoeux,et al.  State Estimation Using Interval Analysis and Belief-Function Theory: Application to Dynamic Vehicle Localization , 2010, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[12]  F. Ordóñez,et al.  A robust optimization approach for the capacitated vehicle routing problem with demand uncertainty , 2008 .

[13]  Daniele Vigo,et al.  Chapter 6 Vehicle Routing , 2007, Transportation.

[14]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[15]  Glenn Shafer,et al.  A Mathematical Theory of Evidence , 2020, A Mathematical Theory of Evidence.

[16]  A. Charnes,et al.  Chance-Constrained Programming , 1959 .