Vehicle Routing Problem pada Distribusi Sayuran Organik

Abstract

Pengendalian permasalahan yang terjadi pada distribusi sayuran organik dapat diselesaikan dengan Multiple Trip Vehicle Routing Problem for Multiple Product and Compartments with Time Windows (MTVRPMPCTW) dan diselesaikan dengan salah satu metode eksak, yaitu Integer Linear Programming. Aplikasi model dilakukan terhadap tiga kasus berbeda, pelayanan 5 lokasi dengan rute tunggal, pelayanan 10 lokasi dengan rute majemuk, dan pelayanan 15 lokasi dengan rute majemuk serta adanya time windows yang harus terpenuhi. Pada kasus 10 lokasi dan 15 lokasi, kendaraan yang telah selesai mengantarkan sayuran organik harus kembali ke depot dan dapat melakukan lebih dari satu kali proses distribusi apabila masih terdapat lokasi yang belum dilayani. Setiap lokasi pada seluruh kasus dapat memesan lebih dari satu jenis sayuran organik. Produk yang dikirim akan ditempatkan di kompartemen yang spesifik agar produk tidak saling bercampur. Solusi yang diperoleh berupa rute pendistribusian sayuran organik yang meminimumkan total biaya distribusi, serta semakin bertambahnya lokasi maka semakin bertambah pula waktu komputasi yang diperlukan.

The distribution problem of organic vegetables can be solved by the Multiple Trip Vehicle Routing Problem for Multiple Products and Compartments with Time Windows (MTVRPMPCTW) and solved by one exact method, namely Integer Linear Programming. The application of the model is carried out on three different cases, service for 5 locations with a single trip, service for 10 locations with multiple trip, and service for 15 locations with multiple trip and there are time windows that must be met. In the case of 10 locations and 15 locations, vehicles that have finished delivering organic vegetables must return to the depot and can carry out more than one distribution process if there are still locations that have not been served. Each location in all cases can order more than one type of organic vegetable. Products sent will be placed in a specific compartment so that the products do not mix with each other. The solution obtained is in the form of an organic vegetable distribution route that minimizes the total distribution cost, and the more locations, the more computational time required.