Determination of the Distribution Route for Bottled Drinking Water Using Sweep Algorithm and Saving Algorithm

Abstract

The route determination by the heuristic way in the Vehicle Routing Problem (VRP) is an approach to distribution with the goal of minimizing distribution routes, assuming that vehicle routes must depart from and return to the central facility by finding the shortest or fastest route. The heuristic methods used include the sweep method and saving matrix for the grouping phase, while the improvement phase for each formed cluster utilizes the intra-route insertion algorithm. The results show that the heuristic approach indicates that the saving method produces shorter travel distances compared to the sweep method. For the characteristics of this data, the saving method may be better in handling vehicle capacity constraints. The choice between the saving method and the sweep method depends heavily on factors such as the distance between consumers, the number of distribution points, and vehicle capacity constraints.