PENYELESAIAN CAPACITATED VEHICLE ROUTING PROBLEM MENGGUNAKAN METODE BRANCH AND CUT DAN ALGORITMA CLARKE AND WRIGHT UNTUK MENENTUKAN RUTE PENDISTRIBUSIAN GAS LPG

The problem of finding the optimal vehicle route or Capacitated Vehicle Routing Problem (CVRP) is a problem that discusses how to choose a number of routes that must be passed by a number of transport vehicles in the process of distributing goods that combine customer demand with regard to transport capacity. Capacitated Vehicle Routing Problem is designed the optimal delivery route where each vehicle only takes one route, each vehicle has the same characteristics, each customer has a request and there is only one depot. Based on the Branch and Cut method, the LPG gas distribution route at PT. Lebong Terang as follows: 0-5-11-0, 0-3-13-0, 0-17-15-0, 0-2-20-0, 0-8-10-0, 0-14-18 -0, 0-19-21-0, 0-22-23-0, 0-4-16-0, 0-7-9-0, 0-12-1-0, 0-24-0, and 0-6-0 with a total distance of 145.99 km. The route for distributing LPG gas at PT. Lebong Terang uses the Clarke and Wright algorithm as follows: 0-4-16-0, 0-3-13-9-0, 0-10-12-0, 0-5-19-0, 0-2-11-23-21-0 , 0-8-14-0, 0-17-20-0, 0-1-0, 0-6-0, 0-7-0, 0-15-0, 0-18-0, 0-22 -0, and 0-24-0 with a total distance of 151.94 km.