
MODEL VEHICLE ROUTING PROBLEM DALAM MENGOPTIMUMKAN RUTE PENGANGKUTAN SAMPAH DI KOTA BOGOR
Author(s) -
Maya Widyastiti,
Isti Kamila
Publication year - 2019
Publication title -
jurnal matematika, statistika dan komputasi/jurnal matematika statistik dan komputasi
Language(s) - English
Resource type - Journals
eISSN - 2614-8811
pISSN - 1858-1382
DOI - 10.20956/jmsk.v16i2.7023
Subject(s) - garbage , vehicle routing problem , transport engineering , garbage collection , routing (electronic design automation) , environmental science , engineering , computer science , waste management , computer network
Garbage is a common problem that often occurs in many cities, including in Bogor. Every day, the volume of garbage in Bogor reaches 600 tons and only 475 tons can be transported to the Galuga Landfill Site. However, the vehicle which is owned by the Environmental Agency of Bogor is limited and has certain capacity.In this study, we formulated garbage transportation in the form of a Vehicle Routing Problem model with Branch and Bound method and completed using LINGO 11.0. The optimal solution obtained is a garbage transport route with a minimum distance, and obtained a distance is 1583.24 km, with West Bogor is 172.6 km, Central Bogor is 344.99 km, East Bogor is 298.79 km, North Bogor is 267.4 km, South Bogor is 252.41 km and Tanah Sareal is 247.05 km. Of the six sub-districts, there was a decrease in the distance of garbage transportation from Temporary Disposal sites to the Galuga Landfill. Keywords: Garbage transportation, Optimization, Vehicle Routing Problem.