Model for vehicle routing problem with loaded distance by clustering algorithm

This independent study aims to determine the optimal route for delivery of fresh food that needs to maintain at a stable temperature, with less loading and the shortest route for customer satisfaction. The vehicle routing problem with load distance (VRPLD) models has been developed to represent the problem. The presented method, Clustering Algorithm, is well founded. On the other hand, when applied with Sweep Clustering or Saving Clustering are better than usual compared with the generated cluster that uses X-means, K-means, and K-Medoid Clustering. The results also confirm the quality by multiple testing with VRP instances.