Robust Counterpart Open-Capacitated Vehicle Routing Problem with Time Windows and Deadline (RCOCVRPTWD) Model in Optimization of Waste Transportation in Subdistrict Kalidoni, Palembang Using LINGO 13.0

Abstract

Robust Counterpart-Open Capacitated Vehicle Routing Problem with time windows and deadline (RC-OCVRPTWD) model which was formed and explained in this paper, is a model used to design solid waste control routes to minimize the distance and time needed for vehicles to complete waste transportation in Kalidoni Sub-District, Palembang. The completion of this route is expected to be able to overcome the occurrence of solid waste accumulation in Kalidoni District, Palembang that involved two characteristics the time that takes for the vehicle to across the route and the time needed to transport waste to the vehicle, which is called time windows. The second combination of time above is deadline. Waste that are transported every day are divided into working areas where the distance of temporary disposal to other disposal in one working area and the volume of waste transported will affect the length of deadline needed. This RC-OCVRPTWD model uses the LINGO 13.0 application to obtain optimal routes and deadlines. The results show that the working route for Kalidoni Sub-District in working area 1 is completed within 28.6 km and a deadline of 2 hours 51 minutes. In working area 2, is with a distance of 23.6 km and a deadline of 1 hour 42 minutes, and in working area 3 is with a distance of 38 km and a deadline of 3 hours 16 minutes.

Penerapan Algoritma Tabu Search Pada Model Acvrp Untuk Menentukan Rute Pengangkutan Sampah Yang Optimal Di Kecamatan Kalidoni

“…VRP didefinisikan sebagai masalah dalam merancang rute kendaraan dengan tujuan meminimumkan biaya yang biasanya erat kaitannya dengan jarak tempuh (Hartono et al, 2018;Puspita & Permatasari, 2017). Salah satu variasi VRP adalah Capacitated Vehicle Routing Problem (CVRP) dimana proses pengangkutan sampah memperhitungkan kapasitas kendaraan dan kapasitas permintaan pada setiap rute (Yuliza et al, 2020;Puspita et al, 2021). CVRP dibagi menjadi dua bentuk yaitu CVRP simetris, yaitu perjalanan dari tempat i ke j sama dengan perjalanan dari tempat j ke i sehingga matriks jarak yang dihasilkan simetris (Kubil et al, 2018).…”