Text
PENGAPLIKASIAN ALGORITMA NEAREST NEIGHBOUR TERHADAP MODEL ASYMMETRIC CAPACITATED VEHICLE ROUTING PROBLEM DALAM MENDESAIN RUTE OPTIMAL PENGANGKUTAN SAMPAH DI KECAMATAN PLAJU KOTA PALEMBANG
A large amount of waste that occurs in Indonesia every year needs to be handled properly by the government, because it harms public health. One of the causes of a large number of waste piles is the population that continues to increase. The Plaju sub-district is one of the sub-districts in the city of Palembang which has a population increase of 0.06% per year. Garbage transportation is one way to deal with a large amount of waste that occurs. The process of transporting waste must be carried out optimally in each area, therefore a waste transportation route is needed according to road conditions in the field that has an asymmetric distance matrix. The Nearest Neighbor algorithm is one of the heuristic methods that can be used to solve the problem of transporting waste using the Asymmetric Vehicle Routing Problem (ACVRP) model. The waste transportation route in Plaju District based on the Work Area obtained using the Nearest Neighbor algorithm on the ACVRP model has a total distance of 390 km and a vehicle travel time of 781 minutes, while the total waste transportation not based on the Work Area is 356.2 km with a vehicle travel time 721 minutes. Therefore, the optimal route of transportation of waste obtained is the route of transportation of waste not based on the Work Area, because the distance and travel time traversed by the vehicle is smaller.
Inventory Code | Barcode | Call Number | Location | Status |
---|---|---|---|---|
2207002973 | T75061 | T750612022 | Central Library (Referens) | Available but not for loan - Not for Loan |
No other version available