Skripsi
ALGORITMA ANT COLONY SYSTEM (ACS) DAN COST MATRIX PADA VEHICLE ROUTING PROBLEM (VRP) UNTUK PENENTUAN RUTE PENGANGKUTAN SAMPAH DI DESA PULAU SEMAMBU KABUPATEN OGAN ILIR SUMATERA SELATAN
Vehicle Routing Problem (VRP) model can be implemented to determited the route for waste transportation which is solved using Ant Colony System (ACS) algorithm Cost Matrix. Pulau Semambu Village consists of 6 hamlets which have 12 Temporary Disposal Sites (TPS), 1 Final Disposal Site (TPA) and every 2 hamlets is formed into 1 Working Area (WK). The purpose of this study is to apply the ACS algorithm and Cost Matrix to determine the route and minimum mileage for waste transportation in each WK in Pulau semambu Village, then analyze and compare the results obtained using as a Mixed Integer Linear Programming (MILP). The optimal distance with ACS Algorithm and Cost Matrix for WK 1 is 13,33 km with successive garbage hauling route of TPA Palem Raya – TPS 1 Dusun 1 – TPS 1 - Dusun 2 – TPS 2 Dusun 2 – TPS 1 Dusun 2 – TPA Palem Raya and TPA Palem Raya – TPS 1 Dusun 2 – TPS 2 Dusun 2 – TPS 1 Dusun 1 – TPS 2 Dusun 1 – TPA Palem Raya, for WK 2 is 16,20 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, and for WK 3 is 15,97 km with successive garbage hauling route of TPA Palem Raya – TPS 1 Dusun 6 – TPS 1 Dusun 3 – TPS 2 Dusun 3 – TPS 2 Dusun 6 – TPA Palem Raya and TPA Palem Raya – TPS 2 Dusun 6 – TPS 1 Dusun 3 – TPS 2 Dusun 3 – TPS 1 Dusun 6 – TPA Palem Raya.
Inventory Code | Barcode | Call Number | Location | Status |
---|---|---|---|---|
2307000823 | T89216 | T892162023 | Central Library (Referens) | Available |
No other version available