Penentuan Rute Distribusi Roti Gepeng Menggunakan Algoritma Nearest Neighbour dan Algoritma Clarke Wright (Studi Kasus: Roti Gepeng ZB)

Restu Agung Nugraha (Universitas Mulawarman)
Muriani Emelda Isharyani (Universitas Mulawarman)
Ridzky Zul Asdi (Universitas Mulawarman)

Jurnal Teknik Industri Terintegrasi (JUTIN)
Vol. 9 No. 4 (2026): October

Roti Gepeng ZB is a flatbread producer that independently manages its distribution to market agents. Observations revealed inefficiencies in fuel costs due to suboptimal delivery routes, causing vehicles to travel unnecessarily long distances. This problem is classified as a Vehicle Routing Problem (VRP) and was analyzed using the Nearest Neighbor and Clarke and Wright methods. The Nearest Neighbor method required 2 vehicles, producing a total distance of 55.6 km and fuel costs of Rp42,769.23, with savings of 32.9 km (37%) and Rp25,307.69 compared with the company’s route. The Clarke and Wright method also required 2 vehicles, producing a distance of 68.2 km and fuel costs of Rp52,461.54, with savings of 20.3 km (23%) and Rp15,615.38. Thus, Nearest Neighbor provided greater distance and fuel cost savings.