OPTIMASI RUTE DISTRIBUSI PRODUK AIR MINUM DALAM KEMASAN MENGGUNAKAN METODE CAPACITATED VEHICLE ROUTING PROBLEM (CVRP) DENGAN ALGORITMA CLARKE AND WRIGHT SAVINGS PADA PT SEGAR MITRA NUSANTARA

• Main Author: Muhammad Yusuf, Nur
• Format: Final Project
• Language: Indonesia
• Online Access: https://digilib.itb.ac.id/gdl/view/71078
• Institution: Institut Teknologi Bandung

PT Segar Mitra Nusantara (Semitra) is a company who run its business in production, distribution, and marketing of bottled mineral water. PT Semitra has customers spread across various regions so that the fulfillment of customer requests through the distribution process must be considered. The problem is closely related to the vehicle routing problem. Based on March 2022 delivery data, there were 12 shipments that exceeded capacity. The Capacitated Vehicle Routing Problem (CVRP) method is one of the methods used in solving VRP that limits route selection with capacity constraints. This study used the Clarke and Wright Savings algorithms as reference algorithms. The existence of different types of vehicles, a large number of customers, and diverse customer demands make problems complex and solutions using heuristic methods more practical. This reference algorithm needs to be modified by adding time constraints and changing the process of merging points into the route. The route merging process is changed by considering the saving value with the points set as head and tail. The modification algorithm is modeled and implemented into the Python programming language using Google Colab. The results showed that the route determined using a modification algorithm could result in distribution cost savings of 27.56% compared to the company's existing conditions and resulted in distribution cost savings of 3.46% compared to the reference algorithm using a benchmark dataset. PT Semitra is recommended to implement a modified algorithm that has been developed so that the efficiency of distribution costs is achieved and the company's profits can increase.