NADILA, SHINDY and Puspita, Fitri Maya and Indrawati, Indrawati (2024) APLIKASI ALGORITMA GREEDY DAN ALGORITMA SWEEP DALAM RUTE PENGANGKUTAN SAMPAH DIDESA PULAU SEMAMBU KABUPATEN OGAN ILIR. Undergraduate thesis, Sriwijaya Univercity.
![]() |
Text
RAMA_44201_08011382025106.pdf - Accepted Version Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (1MB) | Request a copy |
![]() |
Text
RAMA_44201_08011382025106_TURNITIN.pdf - Accepted Version Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (9MB) | Request a copy |
![]() |
Text
RAMA_44201_08011382025106_0006107501_0010067102_01_Front_reff.pdf - Accepted Version Available under License Creative Commons Public Domain Dedication. Download (997kB) |
![]() |
Text
RAMA_44201_08011382025106_0006107501_0010067102_02.pdf - Accepted Version Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (249kB) | Request a copy |
![]() |
Text
RAMA_44201_08011382025106_0006107501_0010067102_03.pdf - Accepted Version Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (44kB) | Request a copy |
![]() |
Text
RAMA_44201_08011382025106_0006107501_0010067102_04.pdf - Accepted Version Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (1MB) | Request a copy |
![]() |
Text
RAMA_44201_08011382025106_0006107501_0010067102_05.pdf - Accepted Version Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (63kB) | Request a copy |
![]() |
Text
RAMA_44201_08011382025106_0006107501_0010067102_06_ref.pdf - Bibliography Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (111kB) | Request a copy |
Abstract
The Greedy Algorithm and the Sweep Algorithm are used to solve garbage transportation routes using the Vehicle Routing Problem (VRP). Pulau Semambu Village has 6 hamlets with every 2 hamlets being one Working Area (WK) and each WK has 4 temporary dumping sites (TPS). The purpose of this study is to make the minimum distance of the optimal route for transporting a garbage in each WK of Pulau Semambu Village and then looking for a comparison of the results obtained from the two algorithms. The final result of the optimal route WK 1 from the Greedy Algorithm gets a distance of 13.49 km with the route of TPA Palem Raya - TPS 1 Dusun 1 - TPS 2 Dusun 1 - TPS 1 Dusun 2 - TPS 2 Dusun 2 - TPA Palem Raya. While using the Sweep Algorithm, it gets a distance of 15.77 km with the route of TPA Palem Raya - TPS 2 Dusun 2 - TPS 2 Dusun 1 - TPS 1 Dusun 1 - TPS 1 Dusun 2 - TPA Palem Raya. For WK 2 using the Greedy Algorithm to get a distance of 16.2 km with the route of TPA Palem Raya - TPS 1 Dusun 4 - TPS 2 Dusun 4 - TPS 1 Dusun 5 - TPS 2 Dusun 5 - TPA Palem Raya, while WK 2 using the Sweep Algorithm gets a distance of 16.71 km with the TPA Palem Raya - TPS 1 Dusun 5 - TPS 2 Dusun 5 - TPS 1 Dusun 4 - TPS 2 Dusun 4 - TPA Palem Raya.For WK 3 using the Greedy Algorithm to get a distance of 16.24 km with the route of TPA Palem Raya - TPS 1 Dusun 6 - TPS 2 Dusun 6 - TPS 1 Dusun 3 - TPS 2 Dusun 3 - TPA Palem Raya, while WK 3 using the Sweep Algorithm gets a distance of 16.25 km with transportation routes, namely: TPA Palem Raya - TPS 2 Dusun 6 - TPS 1 Dusun 6 - TPS 2 Dusun 3 - TPS 1 Dusun 3 - TPA Palem Raya.
Item Type: | Thesis (Undergraduate) |
---|---|
Uncontrolled Keywords: | Vehicle Routing Problem, Algoritma Greedy, Algoritma Sweep, Desa Pulau Semambu, Rute Optimal. |
Subjects: | Q Science > QA Mathematics > QA1-939 Mathematics > QA37.3.1.64 Applied Mathematics |
Divisions: | 08-Faculty of Mathematics and Natural Science > 44201-Mathematics (S1) |
Depositing User: | Shindy Nadila |
Date Deposited: | 29 Mar 2024 00:57 |
Last Modified: | 29 Mar 2024 00:57 |
URI: | http://repository.unsri.ac.id/id/eprint/142979 |
Actions (login required)
![]() |
View Item |