Penyelesaian Capacitated Vehicle Routing Problem Menggunakan Greedy Randomized Adaptive Search Procedure

Abstract

Capacitated Vehicle Routing Problem (CVRP) is a variation of Vehicle Routing Problem (VRP), which is intended is the problem to determine the route of vehicle with increasing its capacity. The goal of CVRP is either to minimize the mileage or delivery time of shipping product. In this paper, the CVRP problem will be solved by using a heuristic method, namely Greedy Randomized Adaptive Search Procedure (GRASP).This method has two phases, firstly is determining the initial solution and secondly is improving the quality of the solution. Determination of initial solution was carried out by classifying customers into groups and then designing the routes to minimize distances. Further, the initial solutions are improved by using the 2-opt method. The application of CVRP is showed as an ilustration in determining the minimum distance route of bread product delivery.