<![CDATA[Abstrak Distribusi merupakan komponen krusial dalam aktivitas logistik karena berperan dalam kelancaran proses pengiriman. Penelitian ini bertujuan menyusun rute distribusi dengan jarak terpendek berdasarkan kapasitas kendaraan, menggunakan algoritma Clarke and Wright Saving untuk membentuk rute awal serta algoritma Nearest Neighbor untuk mengatur urutan kunjungan. Pendekatan penelitian dilakukan secara kuantitatif melalui perhitungan algoritmik dengan memanfaatkan data lokasi pelanggan dan jumlah permintaan. Temuan penelitian menunjukkan bahwa rute usulan memiliki total jarak tempuh 151.69 km untuk mendistribusikan 300 ekor ayam beku, atau 18.97 km (11.12%) lebih pendek dibandingkan rute aktual perusahaan yang mencapai 170.66 km. Dengan demikian, penerapan kedua algoritma tersebut mampu menghasilkan rancangan rute yang lebih ringkas sekaligus mempertimbangkan jarak tempuh dan keterbatasan kapasitas kendaraan.Kata kunci: Clarke and Wright Saving, Capacitated Vehicle Routing Problem, Nearest NeighborAbstract Distribution is a crucial component in logistics activities because it plays a role in the smooth delivery process. This study aims to develop the shortest distribution route based on vehicle capacity, using the Clarke and Wright Saving algorithm to form the initial route and the Nearest Neighbor algorithm to arrange the order of visits. The research approach was conducted quantitatively through algorithmic calculations using customer location data and number of requests. The findings show that the proposed route has a total distance of 151.69 km to distribute 300 frozen chickens, which is 18.97 km (11.12%) shorter than the company's actual route of 170.66 km. Thus, the application of these two algorithms is able to produce a more concise route design while considering travel distance and vehicle capacity limitations.Keywords: Clarke and Wright Saving, Capacitated Vehicle Routing Problem, Nearest Neighbor]]>
Copyrights © 2026
