MASALAH OPTIMASI PENGANGKUTAN SAMPAH DI KOTA PALEMBANG DENGAN MODEL DEMAND ROBUST COUNTERPART OPEN CAPACITATED VEHICLE ROUTING PROBLEM (DRC-OCVRP)

SYAPUTRI, NADIA ZULIATY and Puspita, Fitri Maya and Suprihatin, Bambang (2018) MASALAH OPTIMASI PENGANGKUTAN SAMPAH DI KOTA PALEMBANG DENGAN MODEL DEMAND ROBUST COUNTERPART OPEN CAPACITATED VEHICLE ROUTING PROBLEM (DRC-OCVRP). Undergraduate thesis, Sriwijaya University.

[img] Text
RAMA_44201_08011181320029_ 0006107501_01_front_ref.pdf - Accepted Version
Available under License Creative Commons Public Domain Dedication.

Download (476kB)
[img] Text
RAMA_44201_08011181320029_ 0006107501_02.pdf - Accepted Version
Restricted to Repository staff only
Available under License Creative Commons Public Domain Dedication.

Download (286kB) | Request a copy
[img] Text
RAMA_44201_08011181320029_ 0006107501_03.pdf - Accepted Version
Restricted to Repository staff only
Available under License Creative Commons Public Domain Dedication.

Download (70kB) | Request a copy
[img] Text
RAMA_44201_08011181320029_ 0006107501_04.pdf - Accepted Version
Restricted to Repository staff only
Available under License Creative Commons Public Domain Dedication.

Download (1MB) | Request a copy
[img] Text
RAMA_44201_08011181320029_ 0006107501_05.pdf - Accepted Version
Restricted to Repository staff only
Available under License Creative Commons Public Domain Dedication.

Download (59kB) | Request a copy
[img] Text
RAMA_44201_08011181320029_ 0006107501_06_ref.pdf - Bibliography
Restricted to Repository staff only
Available under License Creative Commons Public Domain Dedication.

Download (84kB) | Request a copy

Abstract

Demand Robust Counterpart Open Capacitated Vehicle Routing Problem (DRCOCVRP) Model has been established to optimize garbage transport in Palembang City. Vehicle starts from driver’s home to TPS in every working area and returns to TPA Karya Jaya to empty its load, so this route forms an open path with the uncertainty of garbage volume data on each TPS. This model is completed with the help of LINGO 13.0 to order to obtained the optimum route. From the results obtained, it can be concluded that the Work Area 3 in Kemuning District with a distance of 12.9 km became the route with the shortest path because only visited one TPS in they route, and the Work Area 5 in Sukarami District with a distance of 77.66 km into a route with a path farthest because of the location of TPA and between TPS that went far apart and the phenomenon of ‘back-forth’.

Item Type: Thesis (Undergraduate)
Uncontrolled Keywords: Garbage Transportation, OCVRP, Robust, Lingo, Optimization
Subjects: Q Science > QA Mathematics
Q Science > QA Mathematics > QA1-939 Mathematics
Q Science > QA Mathematics > QA801-939 Analytic mechanics
Divisions: 08-Faculty of Mathematics and Natural Science > 44201-Mathematics (S1)
Depositing User: Mrs Dies Meirita Sari
Date Deposited: 22 Jul 2019 02:50
Last Modified: 22 Jul 2019 02:50
URI: http://repository.unsri.ac.id/id/eprint/504

Actions (login required)

View Item View Item