A Clustering Algorithm For The Capacitated Vehicle Routing Problems With Stochastic Demands

Abstract

In today’s world, logistics problems are crucial for the supply chain management. The vehicle routing problems are one of the most studied combinatorial optimization problems in the logistics literature. In real life applications, all of the parameters of the problem may not be known. In this paper, we considered the capacitated vehicle routing problem with stochastic demands. Uniform and normal distributions were analyzed on customer demands to observe the stochastic nature of the problem. These methods were compared by using GAMS with different test problems which were taken from the literature. The clustering analysis including the K-means algorithm also applied on large-sized test problems. All of the obtained results were presented in detail.