MODEL VEHICLE ROUTING PROBLEM DALAM MENENTUKAN BANYAKNYA RUTE DAN ARMADA PENGANGKUTAN SAMPAH DI KOTA BOGOR

Maya Widyastiti, Isti Kamila

Abstract


Garbage problem is a common problem in urban areas, including in Bogor. This study aims to determine the number of routes and fleet of garbage transportation in Bogor. The method used is the Branch and Bound method by using the Vehicle Routing Problem model. The results obtained in the form of 69 garbage transportation routes and 36 garbage transport fleets are needed, with details of Central Bogor as many as 7 routes and 4 garbage transport fleets, North Bogor as many as 13 routes and 4 transport fleet units, East Bogor as much as 6 units 3 units of transport routes and fleets, 14 units of West Bogor and 7 units of transport fleet, 16 units of Bogor Selatan and 8 units of transport fleet, and 12 units of Tanah Sareal and 6 units of garbage transport fleet.


Keywords


garbage, route, transport fleet, vehicle routing problem

References


Apriyanti, D., Kresnawati, D. K. & Diniyah, W. F. (2018). Pemanfaatan Sistem Informasi Geografis Untuk Analisis Rute Armada Pengangkutan Sampah Di Kota Bogor. Proceeding National Seminar of Geomatics Geospatial Information Agency. Bogor, Indonesia.

Crevier B, Cordeau JF, Laporte G. (2007). The multi-depot vehicle routing problem with inter-depot routes. European Journal of Operational Research. 176(2): 756-773.

Kim BI, Kim S, Sahoo S. (2006). Waste collection vehicle routing problem with time windows. Computer & Operations Research. 33(12): 3624-3642.

Taha HA. (1996). Pengantar Riset Operasi. Daniel Wirajaya, penerjemah. Jakarta: Binarupa Aksara. Terjemahan dari: Operations Research.

Toth P, Vigo D. (2002). An overview of vehicle routing problems. Di dalam Toth P, et al., editor. The Vehicle Routing Problem. Philadelphia: Siam; hlm. 1-26.

Winston WL. (2004). Operations Research Applications and Algorithms. Ed ke-4. New York: Duxbury.


Full Text: PDF

DOI: 10.33751/ekol.v19i1.1661

Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.