Skripsi
VEHICLE ROUTING PROBLEM (VRP) DENGAN METODE SEQUENTIAL INSERTION DAN NEAREST NEIGHBOUR DALAM MENENTUKAN RUTE PENGANGKUTAN SAMPAH DI DESA PULAU SEMAMBU
The Vehicle Routing Problem (VRP) can be used to solve the problem of waste transportation routes using heuristic methods. Heuristic methods such as Sequential Insertion (SI) and Nearest Neighbour (NN) taking into account the capacity of transport vehicles can be used in determining vehicle routes and minimum mileage. Pulau Semambu Village consists of 6 hamlets which have 12 Temporary Disposal Sites (TDS) and 1 Final Disposal Site (FDS), every 2 hamlets is formed into 1 Working Area (WA). The purpose of this study is to apply the SI and NN methods to determine the optimal route with minimum distance for waste transportation in each WA of Pulau Semambu Village, then to analyze and to compare the results obtained from the two methods. The final result of the optimal route for the SI and NN methods for WA 1 the distance obtained is 13.49 km with the route FDS Palem Raya-TDS 1 Hamlet 1-TDS 2 Hamlet 1-TDS 1 Hamlet 2-TDS 2 Hamlet 2-FDS Palem Raya, for WA 2 using the SI method obtained a distance of 18.31 km with the route FDS Palem Raya-TDS 1 Hamlet 4-TDS 1 Hamlet 5-TDS 2 Hamlet 5-TDS 2 Hamlet 4-FDS Palem Raya while using the NN method obtained a distance of 16,2 km with the route FDS Palem Raya-TDS 1 Hamlet 4-TDS 2 Hamlet 4-TDS 1 Hamlet 5-TDS 2 Hamlet 5-FDS Palem Raya, and for WA 3 using the SI and NN methods obtained a distance of 16.24 km with the route FDS Palem Raya-TDS 1 Hamlet 6-TDS 2 Hamlet 6-TDS 1 Hamlet 3-TDS 2 Hamlet 3-FDS Palem Raya. In WK 2 the distance obtained using the NN method is minimum, so it can be concluded that the NN method is better than the SI method in determining the optimal route of waste transportation in Pulau Semambu Village.
Inventory Code | Barcode | Call Number | Location | Status |
---|---|---|---|---|
2307004418 | T93573 | T935732023 | Central Library (Referens) | Available but not for loan - Not for Loan |
No other version available