Track: Supply Chain Management

Abstract

The Vehicle Routing Problem (VRP) is a problem related to the distribution of products using the optimal and involving more than one vehicle by taking into account several obstacles in serving a number of agents according to the request of each related agent. The Capacited Vehicle Routing Problem (CVRP) is one of the variations of VRP, namely by adding constraint in the form of vehicle capacity used in product distribution. Tis paper applies the formation of a CVRP model to the problem of the distribution route of the Solopos daily mail and its solution using the Sweep algorithm method which aims to optimize the distribution route. The Sweep algorithm is an algorithm consisting of two stages, the first stage is clustering agents, then the second stage is the formation of routes for each cluster with the Nearest Neighbor method. Based on the calculations carried out in solving CVRP problems using the Sweep algorithm, the results obtained that the total vehicle mileage is 216,5 km with a time windows of 6 hours 5 minutes.