APLIKASI ALGORITMA GREEDY DAN ALGORITMA SIMULATED ANNEALING PADA MODEL ASYMMETRIC CAPACITATED VEHICLE ROUTING PROBLEM DALAM MENDESAIN RUTE OPTIMAL PENGANGKUTAN SAMPAH DI KECAMATAN SEBERANG ULU 1 PALEMBANG

JANNAH, MIFTAHUL and Suprihatin, Bambang and Indrawati, Indrawati (2023) APLIKASI ALGORITMA GREEDY DAN ALGORITMA SIMULATED ANNEALING PADA MODEL ASYMMETRIC CAPACITATED VEHICLE ROUTING PROBLEM DALAM MENDESAIN RUTE OPTIMAL PENGANGKUTAN SAMPAH DI KECAMATAN SEBERANG ULU 1 PALEMBANG. Undergraduate thesis, Sriwijaya University.

[thumbnail of RAMA_44201_08011381924097.pdf] Text
RAMA_44201_08011381924097.pdf - Accepted Version
Restricted to Repository staff only
Available under License Creative Commons Public Domain Dedication.

Download (3MB) | Request a copy
[thumbnail of RAMA_44201_08011381924097_TURNITIN.pdf] Text
RAMA_44201_08011381924097_TURNITIN.pdf - Accepted Version
Restricted to Repository staff only
Available under License Creative Commons Public Domain Dedication.

Download (13MB) | Request a copy
[thumbnail of RAMA_44201_08011381924097_0026017102_0010067102_01_front_ref.pdf]
Preview
Text
RAMA_44201_08011381924097_0026017102_0010067102_01_front_ref.pdf - Accepted Version
Available under License Creative Commons Public Domain Dedication.

Download (1MB) | Preview
[thumbnail of RAMA_44201_08011381924097_0026017102_0010067102_02.pdf] Text
RAMA_44201_08011381924097_0026017102_0010067102_02.pdf - Accepted Version
Restricted to Repository staff only
Available under License Creative Commons Public Domain Dedication.

Download (321kB) | Request a copy
[thumbnail of RAMA_44201_08011381924097_0026017102_0010067102_03.pdf] Text
RAMA_44201_08011381924097_0026017102_0010067102_03.pdf - Accepted Version
Restricted to Repository staff only
Available under License Creative Commons Public Domain Dedication.

Download (86kB) | Request a copy
[thumbnail of RAMA_44201_08011381924097_0026017102_0010067102_04.pdf] Text
RAMA_44201_08011381924097_0026017102_0010067102_04.pdf - Accepted Version
Restricted to Repository staff only
Available under License Creative Commons Public Domain Dedication.

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

Download (152kB) | Request a copy
[thumbnail of RAMA_44201_08011381924097_0026017102_0010067102_06_ref.pdf] Text
RAMA_44201_08011381924097_0026017102_0010067102_06_ref.pdf - Bibliography
Restricted to Repository staff only
Available under License Creative Commons Public Domain Dedication.

Download (217kB) | Request a copy
[thumbnail of RAMA_44201_08011381924097_0026017102_0010067102_07_lamp.pdf] Text
RAMA_44201_08011381924097_0026017102_0010067102_07_lamp.pdf - Accepted Version
Restricted to Repository staff only
Available under License Creative Commons Public Domain Dedication.

Download (600kB) | Request a copy

Abstract

The research aims to determine the minimum distance and route for transporting waste in the Seberang Ulu 1 Palembang sub-district using the Greedy algorithm and the Simulated Annealing algorithm. The calculation is done by dividing the sub-district area into 4 working areas. The calculation results show that with the Greedy algorithm for each work area 1 to work area 4, the minimum distance and route is obtained, namely 24.655 km starting from TPA – TPS 4 – TPS 5 – TPS 3 – TPS 1 – TPS 2 – TPA, 29.7 km starting from TPA – TPS 7 – TPS 8 – TPS 3 – TPS 4 – TPS 6 – TPS 1 – TPS 2 – TPS 5 – TPA, 22.7 km starting from TPA – TPS 1 – TPS 2 – TPA, and 24,705 km starting from TPA – TPS 3 – TPS 2 – TPS 1 – TPS 4 – TPA. Whereas with the Simulated Annealing algorithm, the minimum distance and route for each work area is obtained, namely 24.325 km starting from TPA – TPS 2 – TPS 4 – TPS 1 – TPS 5 – TPS 3 – TPA, 32.45 km with 3 routes, namely the first TPA – TPS 1 – TPS 2 – TPS 5 – TPS 6 – TPS 4 – TPS 8 – TPS 7 – TPS 3 – TPA, both TPA – TPS 3 – TPS 7 – TPS 4 – TPS 8 – TPS 1 – TPS 2 – TPS 5 – TPS 6 – TPA, the three TPA – TPS 3 – TPS 8 – TPS 4 – TPS 7 – TPS 1 – TPS 2 – TPS 5 – TPS 6 – TPA, 22.5 km starting from TPA – TPS 2 – TPS 1 – TPA , and 22,385 km starting from TPA – TPS 4 – TPS 3 – TPS 2 – TPS 1 – TPA. This means that the Simulated Annealing algorithm produces the majority of minimum distances compared to the Greedy algorithm in the Asymmetric Capacitated Vehicle Routing Problem model in Seberang Ulu 1 District, Palembang.

Item Type: Thesis (Undergraduate)
Uncontrolled Keywords: Sampah, ACVRP, Algoritma Greedy, Algoritma Simulated Annealing, 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: Miftahul Jannah
Date Deposited: 01 Feb 2023 02:02
Last Modified: 01 Feb 2023 02:02
URI: http://repository.unsri.ac.id/id/eprint/88421

Actions (login required)

View Item View Item