PENENTUAN RUTE BERBASIS MULTIPLR TRIP HETEROGENEOUS VEHICLE ROUTING PROBLEM (MTHVRP) MENGGUNAKAN ALGORITMA SWEEP DAN NEAREST NEIGHBOR (STUDI KASUS : DEPO BANCAR)

Distribution is one of the essential activities in the supply chain that significantly affects customer service levels and a company's operational costs. The problem faced by Bancar Drinking Water Depot is the inefficiency of its existing distribution routes, resulting in longer travel distances and higher transportation costs. This study aims to optimize distribution routes by applying the Multi-Trip Heterogeneous Vehicle Routing Problem (MTHVRP) method using the Sweep algorithm for customer clustering and the Nearest Neighbor algorithm for determining the sequence of customer visits within each route. The data used in this study include customer locations, customer demands, vehicle capacities, fleet composition, and distances between distribution points. The results indicate that the proposed method generates more efficient distribution routes than the company's existing routes by forming multiple trips according to vehicle capacities and establishing a more systematic visitation pattern. The improved routes lead to reductions in total travel distance, distribution time, fuel consumption, and transportation costs, while increasing vehicle utilization and overall distribution effectiveness. Therefore, the MTHVRP method combined with the Sweep and Nearest Neighbor algorithms can be considered an effective alternative for solving distribution routing problems at Bancar Drinking Water Depot and achieving a more optimal and efficient distribution system.