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.
KeywordsVehicle routing problem Stochastic programming Chance-constrained programming Belief functions
- 3.Cordeau, J.-F., Laporte, G., Savelsbergh, M.W.P., Vigo, D.: Vehicle routing (Chap. 6). In: Barnhart, C., Laporte, G. (eds.) Transportation, Handbooks in Operations Research and Management Science, vol. 14, pp. 367–428. Elsevier, Amsterdam (2007)Google Scholar
- 4.Ferson, S., Tucker, W.T.: Sensitivity in risk analyses with uncertain numbers. Technical report, Sandia National Laboratories (2006)Google Scholar
- 5.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
- 6.Kirby, M.J.L.: The current state of chance-constrained programming. In: Kuhn, H.W. (ed.) Proceedings of the Princeton Symposium on Mathematical Programming, pp. 93–111. Princeton University Press (1970)Google Scholar
- 13.Vehicle Routing Data Sets. http://www.coin-or.org/SYMPHONY/branchandcut/VRP/data/index.htm. Accessed 20 Mar 2016