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