Vehicle Routing Problem with Time Window Constrain using KMeans Clustering to Obtain the Closest Customer
In this paper, the problem statement is solving the Vehicle Routing Problem (VRP) with Time Window constraint using the Ant Colony Algorithm with K-Means Clustering. In this problem, the vehicles must start at a common depot, pickup from various ware houses, deliver to the respective nodes within the time window provided by the customer and returns to depot. The objectives defined are to reduction in usage of number of vehicles, the total logistics cost and to reduce carbon emissions. The mathematical model described in this paper has considered multiple pickup and multiple delivery points. The proposed solution of this paper aims to provide better and more efficient solution while minimizing areas of conflict so as to provide the best output on a large scale in Vehicle Routing Problem, K-Means Clustering, Time Window constraint, Ant Colony Algorithm.
