Implementasi Algoritma Clarke And Wright’s Savings dalam Menyelesaikan Capacitated Vehicle Routing Problem (CVRP).

Abstract

Model to choose vehicle route is known as Vehicle Routing Problem (VRP). VRP is related to optimal routing problem that involve more than one vehicle of each capacity to serve costumer’s demand. Capacitated Vehicle Routing Problem is one of VRP form which each of vehicle has finite capacity. Solution in this research use Clarke and Wright’s Savings Algorithm. This algorithm may get a route depand to vehicle capacity and customer’s demand. Data that use in this research is distance between source and customer, between each customer, customer’s demand and vehicle’s capacity. In this research, the resolution of CVRP by using Clarke and Wright’s Savings Algorithm. From the results of the solution by using Clarke and Wright’s Savings Algorithm obtained 5 optimal route with vehicles of different capacities.