Solving capacitated vehicle routing problem using saving matrix, sequential insertion, and nearest neighbor of product ‘X’ in Grobogan district

Abstract

One variation of Vehicle Routing Problem (VRP) is the Capacitated Vehicle Routing Problem (CVRP). CVRP is a VRP which has an additional vehicle capacity constraint. The purposes of this research are to solve CVRP for distribution routes in Grobogan district using the Saving Matrix Algorithm, Sequential Insertion Algorithm and Nearest Neighbor Algorithm, and to find out which one is the best solution from the three algorithms. Based on the calculations carried out in solving CVRP, the total distance traveled using the Saving Matrix Algorithm is 126.6 km, using the Sequential Insertion Algorithm is 136.4 km, using the Nearest Neighbor is 133.7 km. This show that Saving Matrix Algorithm is more effective in determining these distribution routes in the Grobogan district with the cost of the route is Rp. 96,849.