Penentuan Rute Distribusi Air Galon Menggunakan Algoritma Sweep dan Algoritma Local Search di AMDK PDAM Kota X - PRATAMA, TEGUH SASMITO; FITRIA, LISYE (e-Proceeding FTI, 2024)
AMDK PDAM Bandung is a municipally owned company that produces drinking water packaging with various types of products. Companies need to distribute these products to consumers where distribution activities are still not effective and efficient. Utilization of vehicle capacity that is not yet optimal and distribution routes that are still subjective according to operators are problems that are modeled with the Vehicle Routing Problem (VRP). There are two types of VRP problems experienced by companies, namely Vehickle Routing Problem Pickup and Delivery (VRPPD) where delivery involves a company-owned goods pickup service and Heterogeneous Fleet Vehicle Routing Problem (HFVRP) which is a problem with different types of distribution vehicles. The methods used to solve this problem are the Sweep Algorithm and the Local Search Insertion intra route (1-0) algorithm which aims to minimize the total distance and total distribution time. The total distribution distance obtained was 470.79 km with an efficiency of 38%, while the total time was 59.25 hours with an efficiency of 25%. Abstrak AMDK PDAM Kota Bandung merupakan perusahaan daerah yang memproduksi air minum kemasan dengan berbagai jenis produk. Perusahaan perlu mendistribusikan produk tersebut kepada konsumen dimana kegiatan distribusi tersebut masih belum efektif dan efisien. Pemanfaatan kapasitas kendaraan yang belum maksimal dan rute pendistribusian yang masih subjektif menurut operator menjadi permasalahan yang di modelkan dengan Vehicle Routing Problem (VRP). Terdapat dua jenis permasalahan VRP yang dialami perusahaan yaitu Vehickle Routing Problem Pickup and Delivery (VRPPD) dimana pengiriman yang terdapat layanan pengambilan barang yang dimiliki perusahaan dan Heterogeneous Fleet Vehicle Routing Problem (HFVRP) yaitu permasalahan jenis kendaran distribusi yang berbeda – beda. Metode yang digunakan untuk memecakan masalah tersebut yaitu Algoritma Sweep dan Algoritma Local Search Insertion intra route (1-0) yang bertujuan meminimumkan total jarak dan total waktu distribusi. Total Jarak Distribusi yang didapat yaitu 470,79 km dengan efisiensi 38%, sedangkan untuk total waktu yaitu 59,25 jam dengan efisiensi 25%.