RANI, NADIA and Indrawati, Indrawati and Yuliza, Evi (2023) APLIKASI ALGORITMA CHEAPEST INSERTION HEURISTIC DAN ALGORITMA SIMULATED ANNEALING PADA MODEL ASYMMETRIC CAPACITATED VEHICLE ROUTING PROBLEM DALAM PENENTUAN RUTE OPTIMAL PENGANGKUTAN SAMPAH DI KECAMATAN ILIR TIMUR 3. Undergraduate thesis, Sriwijaya University.
![]() |
Text
RAMA_44201_08011281924121.pdf - Accepted Version Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (3MB) | Request a copy |
![]() |
Text
RAMA_44201_08011281924121_TURNITIN.pdf - Accepted Version Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (14MB) | Request a copy |
![]() |
Text
RAMA_44201_08011281924121_0010067102_0027077805_01_front_ref.pdf - Accepted Version Available under License Creative Commons Public Domain Dedication. Download (2MB) |
![]() |
Text
RAMA_44201_08011281924121_0010067102_0027077805_02.pdf - Accepted Version Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (489kB) | Request a copy |
![]() |
Text
RAMA_44201_08011281924121_0010067102_0027077805_03.pdf - Accepted Version Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (183kB) | Request a copy |
![]() |
Text
RAMA_44201_08011281924121_0010067102_0027077805_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_08011281924121_0010067102_0027077805_05.pdf - Accepted Version Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (186kB) | Request a copy |
![]() |
Text
RAMA_44201_08011281924121_0010067102_0027077805_06_ref.pdf - Bibliography Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (408kB) | Request a copy |
![]() |
Text
RAMA_44201_08011281924121_0010067102_0027077805_07_lamp.pdf - Accepted Version Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (320kB) | Request a copy |
Abstract
The waste transportation route problem can be modeled as an Asymmetric Capacitated Vehicle Routing Problem (ACVRP) with the condition that the journey from place i to place j is not the same as the trip from place j to i. This study aims to optimize the garbage transport route in the ACVRP model in Ilir Timur 3 District using the Cheapest Insertion Heuristic (CIH) algorithm and the Simulated Annealing (SA) algorithm. Then an analysis and comparison of the results obtained by the two algorithms are carried out. The final result of the optimal route for Working Area (WA) 1 using the CIH algorithm is to obtain a route with a distance of 21.2 km, while using the SA algorithm, a route with a distance of 19.05 km is obtained. For WA 2 using the CIH algorithm and the SA algorithm, the route is obtained with a distance of 18.9 km. For WA 3 using the CIH algorithm, a route with a distance of 21.45 km was obtained and the SA algorithm obtained a route with a distance of 20.6 km. For WA 4 using the CIH algorithm and the SA algorithm, a route with a distance of 13.5 km is obtained. It can be concluded that the SA algorithm is better than the CIH algorithm in determining the optimal route for transporting waste in Ilir Timur 3 District.
Item Type: | Thesis (Undergraduate) |
---|---|
Uncontrolled Keywords: | Simulated Annealing,Cheapest Insertion Heuristic, Capacitated Vehicle Routing Problem, Asymmetric Capacitated Vehicle Routing Problem, 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: | Nadia Rani |
Date Deposited: | 06 Apr 2023 03:21 |
Last Modified: | 06 Apr 2023 03:21 |
URI: | http://repository.unsri.ac.id/id/eprint/93596 |
Actions (login required)
![]() |
View Item |