Text
APLIKASI ALGORITMA TABU SEARCH PADA MODEL ASYMMETRIC CAPACITATED VEHICLE ROUTING PROBLEM DALAM MENDESAIN RUTE OPTIMAL PENGANGKUTAN SAMPAH DI KECAMATAN ILIR TIMUR 3
The waste problem is a still serious problem that continues to be considered, such as the problem of transporting waste. The waste problem can be solved by determining the optimal route of waste transportation using the ACVRP (Asymmetric Capacitated Vehicle Routing Problem) model. ACVRP is a model with the distance matrix formed as an asymmetric matrix, which means that the journey from place i to j is not the same as the trip from place j to i. By using the Tabu Search algorithm, it is expected that the ACVRP model can determine the optimal route of waste transportation in Ilir Timur District 3. The Tabu Search algorithm process moves from one solution to the next by choosing the best solution on the Tabu List. The results of the calculations in this study indicate that the shortest distance obtained using the Tabu Search Algorithm in WK 1 is 11.65 km, with the route TPS Jl. Mayor Ruslan Iba – TPS Jl. Betet – TPS Jl. M. Isa – TPS Jl. Ramakasih – TPS Jl. Bambang Utoyo – TPA Sukawinatan. WK 2 is 10.7 km, with the route TPA Sukawinatan – TPS Seduduk Putih Dekat Kantor Lurah 8 Ilir – TPS Jl. Rajawali – TPS Jembatan Geledek – TPS Jl. Dempo Depan Ruko Apat. WK 3 is 12,65 km, with the route TPA Sukawinatan – TPS Jl. Veteran – TPS Jl. M. Isa Kel.Kuto Batu – TPS Jl. Perintis Kemerdekaan – TPS Pasar Kuto. WK 4 is 7,4 km, with the route TPS Bendungan 10 Ilir – TPS Lr. Masjid 8 Ilir – TPA Sukawinatan.
Inventory Code | Barcode | Call Number | Location | Status |
---|---|---|---|---|
2207000706 | T67709 | T677092022 | Central Library (Referens) | Available but not for loan - Not for Loan |
No other version available