Text
APLIKASI ALGORITMA TABU SEARCH PADA MODEL VEHICLE ROUTING PROBLEM (VRP) DALAM MENDESAIN RUTE OPTIMAL PENGANGKUTAN SAMPAH DI DESA PULAU SEMAMBU
The problem of waste transportation routes with the Vehicle Routing Problem (VRP) model can be solved using exact or heuristic methods. Tabu Search (TS) algorithm included in the heuristic method that can be used to find the optimal VRP solution in determining a minimum mileage by considering the vehicle capacity. 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 TS algorithm 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 the LINGO 13.0 application as a Mixed Integer Linear Programming (MILP) model. The minimum distance for WK 1 is 13.33 km with the route of TPA Palem Raya – TPS 1 hamlet 2 – TPS 2 hamlet 2 – TPS 1 hamlet 1 – TPS 2 hamlet 1 – TPA Palem Raya, for WK 2 is 16.2 km with the route of TPA Palem Raya – TPS 1 hamlet 4 – TPS 2 hamlet 4 – TPS 1 hamlet 5 – TPS 2 hamlet 5 – TPA Palem Raya, and for WK 3 is 15.97 km with the route of TPA Palem Raya – TPS 1 hamlet 6 – TPS 1 hamlet 3 – TPS 2 hamlet 3 – TPS 2 hamlet 6 – TPA Palem Raya.
Inventory Code | Barcode | Call Number | Location | Status |
---|---|---|---|---|
2207003157 | T76229 | T762292022 | Central Library (Referens) | Available but not for loan - Not for Loan |
No other version available