VEHICLE ROUTING PROBLEM WITH TIME WINDOWS MENGGUNAKAN ALGORITMA BRANCH & BOUND UNTUK MEMINIMALKAN JARAK TEMPUH KENDARAAN (Studi Kasus UD Dwi Jaya Berkah)

UD. Dwi Jaya Berkah is a rice milling and distribution company serving 28 customers in Gresik Regency. The problem faced by the company is delivery delays caused by distribution route planning that does not consider the service time constraints (time windows) of each customer. This condition results in some customers being unable to receive deliveries on the first visit, requiring the company to perform redelivery, which increases both travel distance and distribution costs. This study aims to develop an alternative distribution route using the Vehicle Routing Problem with Time Windows (VRPTW) approach and to compare the travel distance and delivery delays between the company's existing routes and the proposed routes. The method employed in this research is the Branch and Bound algorithm, an exact optimization method used to obtain an optimal solution. The research data include customer locations, customer demand, vehicle capacity, distance matrix, travel time matrix, service time, and customer time windows. Data processing was conducted using Google Colab and the Python programming language. The results indicate that the implementation of the VRPTW method using the Branch and Bound algorithm produces a more optimal distribution route than the company's existing route, reducing the total travel distance by 21.8 km or 9.76%. Therefore, the proposed method can improve distribution efficiency within the company.