%0 Thesis
%9 Skripsi
%A ADE NOVIANTI HIDAYAH, NIM. 13610008
%B FAKULTAS SAINS DAN TEKNOLOGI
%D 2018
%F digilib:33655
%I UIN SUNAN KALIJAGA YOGYAKARTA
%K Nearest Neighbour (NN) and A*, Vehicle Routing Problem with  Multiple Trips and Intermediate Facility (VRPMTIF), Route.
%P 117
%T Optimasi Vehicle Routing Problem With Multiple Trips and  Intermediate Facility (VRPMTIF) Menggunakan Metode Nearest  Neighbour (NN) dan A*
%U https://digilib.uin-suka.ac.id/id/eprint/33655/
%X Vehicle routing problem (VRP) is a matter of determining vehicle routes that  play an important role in the industrial world, namely the problem of logistics and  transportation management. There are various VRP models that are developing,  one of which is the Vehicle Routing Problem with Multiple Trips and  Intermediate Facility (VRPMTIF) which is discussed in this study by taking the  problem of optimization of waste transport routes in the Jatinom Sector in Klaten  City. This study compares the Nearest Neighbor Method and Method A * in the  process of forming a route. Based on the number of routes, both methods produce  three trips in one route and carry 18 m3 of 14 polling stations. Based on the  effectiveness of distance and time taken, the route in the Nearest Neighbor  Method produces the least total distance and visit time compared to Method A *.  Where the route with Nearest Neighboring method traveled 111.84 km, with a  travel time of 275.76 minutes, while the route on Method A * traveled as far as  123.65 km and travel time was 293.475 minutes. These results prove that, the  route formed using the Nearest Neighbor Method is more effective 11.81 km and  the time needed is also more effective 17.715 minutes.
%Z Dr. M. Wakhid Musthofa, M. Si