Optimasi Rute Distribusi Sapi Kurban Menggunakan Vehicle Routing Problem

Abstract

Permasalahan penentuan rute distribusi penting dalam sistem logistik, terutama pada permintaan musiman seperti distribusi sapi kurban menjelang Hari Raya Iduladha. Penelitian ini bertujuan menentukan rute distribusi sapi kurban yang optimal dari depot ke pelanggan dengan meminimumkan biaya distribusi dan memenuhi batasan operasional. Permasalahan dimodelkan menggunakan pendekatan Vehicle Routing Problem dalam bentuk integer linear programming dan diselesaikan menggunakan LINGO 20.0. Model utama menghasilkan solusi optimal global dengan meminimumkan biaya tetap penggunaan kendaraan. Pengembangan model dilakukan melalui dua skenario, yaitu penambahan biaya variabel berdasarkan jarak tempuh yang menghasilkan solusi fisibel dan penerapan model multitrip yang menghasilkan solusi fisibel dengan dua ritasi. Model pengembangan menghasilkan rute yang lebih representatif terhadap kondisi operasional dan mendukung perencanaan distribusi yang lebih efisien.

The distribution routing problem is important in logistics systems, particularly for seasonal demand such as sacrificial cattle distribution prior to Eid al-Adha. This study aims to determine optimal distribution routes from depots to customers by minimizing distribution costs while satisfying operational constraints. The problem is modeled as a Vehicle Routing Problem using an integer linear programming approach and solved with LINGO 20.0. The main model produces a globally optimal solution by minimizing fixed vehicle usage costs. The model is extended through two scenarios: the addition of variable costs based on travel distance, which yields a feasible solution, and the application of a multitrip model, which yields a feasible solution with two trips. The extended model produces routes that better represent operational conditions and supports more efficient distribution planning.