Skripsi
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
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.
Inventory Code | Barcode | Call Number | Location | Status |
---|---|---|---|---|
2307003357 | T93596 | T935962023 | Central Library (Referens) | Available |
No other version available